Q: Why do you want to work in our company?
Software Engineers Interview Questions
419,183 software engineers interview questions shared by candidates
Same as others mentioned on glassdoor. 3 hour round is pawn only chess. 6 hour on-site has pair programming, leetcode and small one hour projects
a line of code has one logical bug in it, find the bug.
What are your 3 strengths and 3 weaknesses?
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).
Why Rakuten? If a system problem occurs at midnight, would you like to work out the problem immediately? What is your impression of Japanese?
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.
Third person: Given a 2-d array, write code to print it out in a snake pattern. For example, if the array is this: 1, 2, 3 4, 5, 6 7, 8, 9 the routine prints this: 1,2,3,6,9,8,7,4,5 The array is an NxN array. The final question was just how to write a connection pool (i.e, a class that returns connections to the user, and if the user is done, returns them back to the pool)
Viewing 921 - 930 interview questions
See Interview Questions for Similar Jobs
Operations EngineerPrincipal EngineerFirmware EngineerMobile DeveloperGame ProgrammerMobile Engineer.net DeveloperDevops EngineerData EngineerTechnical Program ManagerQa EngineerJr Security AnalystSoftware DeveloperAtg DeveloperApplication DeveloperC DeveloperLead EngineerSenior DeveloperPython Developer