The entire process was quick and smooth.

It started with a phone call with the recruiter, where we discussed likes/dislikes, career path (general stuff), and went over my resume. She immediately let me know that I would be moving on to the second round.

The second round consisted of submitting a code sample from a project that I had worked on individually, and solving an hour-long coding problem. Once submitted, she emailed back a few hours later asking to schedule a technical phone interview with a Software Engineer.

That third round involved two basic coding questions that I talked through and coded on a code-collaborating website. The software engineer immediately sent his feedback to the recruiter, and she followed up with me to move on to the final round just a few hours after.

The final round was another 30-minute phone call with the director of Wayfair's lab program. The recruiter set up one more phone call to verbally give me the job offer and answer some remaining questions that I had.

Overall, it was an incredibly fast and smooth interview process. My only concern was not having an onsite interview. I enjoy being able to see the company and its culture at least once in person before joining, but in this case, there are tons of reviews and images available online about Wayfair, so it was not a deal-breaker.

General questions, such as:

• "Talk about a project that showcases your coding ability."
• "Talk about a project where you worked with a team."

Print all combinations from an array or arrays.

Example: Input: [ [ a, b ], [ c, d, e ], [ f, g ] ] Output: acf acg bcf bcg ... aeg

Given an array of integers (positive and negative), sort so all negative numbers are on the left and positive numbers are on the right, while retaining their original order.

Example: Input: [-2, 4, -19, 4, 0] Output: [-2, -19, 0, 4, 4]

Given a string, return a boolean value if the string contains matching brackets.

Example: Input: "This is [a valid] string" Output: True

Input: "This is an [invalid string" Output: False