Senior Java Developer

Interviewed at Atlassian

3.1★

Apr 13, 2016

A company uses a format to exchange messages with us. You need to validate the input. The character encoding ASCII. Valid characters are between 0x20 (space) and 0x7E (~). write validate function to generate valid output or the error message.

Software Engineer

Interviewed at Apple

4.1★

Jan 25, 2014

Ants are at the corners of an equilateral triangle labelled 1, 2, and 3, each ant starts moving towards the next one (1 towards 2, 2 towards 3, 3 towards 1) at the same constant speed. How long until they meet ?

Software Engineer

Interviewed at Airbnb

4★

May 3, 2015

Provide a set of positive integers (an array of integers). Each integer represent number of nights user request on Airbnb.com. If you are a host, you need to design and implement an algorithm to find out the maximum number a nights you can accommodate. The constrain is that you have to reserve at least one day between each request, so that you have time to clean the room. Example: 1) Input: [1, 2, 3] ===> output: 4, because you will pick 1 and 3 2) input: [5, 1, 2, 6] ===> output: 11, because you will pick 5 and 6 3) input: [5, 1, 2, 6, 20, 2] ===> output: 27, because you will pick 5, 2, 20

Applications Developer

Interviewed at JPMorganChase

3.9★

Feb 26, 2016

1. Take an integer input and output the number of 1's in it's binary representation. 2. Implement a mergesort. 3. Explain your level of understanding of data structures (trees, etc.) 4. What makes java different than other languages?

Software Engineer

Interviewed at Jane Street

4.4★

Oct 4, 2011

10 ropes with red and blue end. red end can only connect blue end. what is the expected value of cycles?

Software Engineer

Interviewed at Google

4.4★

Aug 9, 2009

The question was the following. I'm rephrasing the question to make it clear for everyone to understand: - You are going on a one-way flight trip that includes billions of layovers. - You have 1 ticket for each part of your trip (i.e: if your trip is from city A to city C with a layover in city B, then you will have 1 flight ticket from city A to city B, and 1 flight ticket from city B to city C. - Each layover is unique. You are not stopping twice in the same city. - You forgot the original departure city. - You forgot the final destination city. - All the tickets you have are randomly sorted. Question are: - Design an algorithm to reconstruct your trip with minimum complexity. - How would you improve your algorithm. Example: - randomly sorted: New York->London San Francisco-> Hong Kong Paris->New York London->San Francisco - sorted: Paris->New York New York->London London->San Francisco San Francisco-> Hong Kong

Software Engineer

Interviewed at Google

4.4★

Feb 10, 2018

Given two lowercase strings, S1 and S2, sort S1 in same order as S2. If a character in S1 doesn't exist in S2, put them at the end. If S1 is "program" and S2 is "grapo", then return "grrapom".

Software Engineer Intern

Interviewed at Bloomberg

4★

Oct 31, 2014

Implement a method for a Fibonacci sequence where instead of adding the last 2 elemenT's you add the last n elements. For n=3. 1 1 1 3 5 9...

Java Developer

Interviewed at WebKul

4.1★

Oct 24, 2016

The first question was to print pattern that is n=1 *** n=3 * * *** *** ************ *** *** * * n=5 * * *** *** ***** ***** ******************* ***** ***** *** *** * *

Software Engineer

Interviewed at Meta

3.6★

Apr 16, 2011

Write a function to tell if two line segments intersect or not.