What are your 3 strengths and 3 weaknesses?
Developer Interview Questions
640,302 developer interview questions shared by candidates
Given two words as Strings, determine if they are isomorphic. Two words are called isomorphic if the letters in one word can be remapped to get the second word. Remapping a letter means replacing all occurrences of it with another letter while the ordering of the letters remains unchanged. No two letters may map to the same letter, but a letter may map to itself. * * Example: * given "foo", "app"; returns true * we can map 'f' -> 'a' and 'o' -> 'p' * * given "foo", "boa"; returns false * we can map 'f' -> 'b', 'o' -> 'o', we can't map 'o' -> 'a' * * given "bar", "foo"; returns false * we can't map both 'a' and 'r' to 'o' * * given "turtle", "tletur"; returns true * we can map 't' -> 't', 'u' -> 'l', 'r' -> 'e', 'l' -> 'u', 'e' ->'r' * * given "ab", "ca"; returns true * we can map 'a' -> 'c', 'b' -> 'a' */
Implement double pow(double a, int b) without using any already built-in functions (aka, don't use an already defined pow function).
What does the operating system do when you call a function?
Why Rakuten? If a system problem occurs at midnight, would you like to work out the problem immediately? What is your impression of Japanese?
If you had twelve identical looking-balls except that one weighed more or less than the other 11, and could weigh the balls (or any subset) three times, how can you find the correct ball and whether it weighed more or less?
Build a simple app that involves displaying data that changes in realtime
If I knew what the cross apply operator was
Phone Interview: The question was very open ended and related to Matrix (Basically, a form of Graph) Traversal, had to figure it out the exact requirements first and then come up with the sol. with the time constraints. P.S: I couldn't make it through the Phone Interview
Surprisingly the questions were found on the famous cracking the code interview. Like : find the lowest common ancestors of two nodes in a binary tree. (O(n) time). If each node has a pointer to parent, solve the problem in o(logn) time and o(1) space.
Viewing 1021 - 1030 interview questions