Was confused abit about TREE SYMMETRIC question. He was expecting a recursive solution. But explained him a solution using tree inorder/preorder/postorder traversals. Explained him, and wrote code for different traversals and some functions to integrate all. Finally he seems convincing with my approach and solution.
Nothing was too difficult. Bit-shifting, data structures, efficiency.
Compare two dates.
Recreate the StringBuilder class in C++ from the ground up.
Design a File System using OOPS concepts.
something related to computer architecture
easy questions, how to reverse a string, iteratively and recursively, and given an integer in base 10, convert to a given base
Questions asked in Second round was unexpected. I was expecting programming questions.
Most difficult for me was: Write code to - Given a list of numbers, return a list of all possible permutations. eg. given {1,2,3}, return {{},{1},{2},{3},{1,2},...,{1,2,3}} Had to use bit manipulation where I fumbled.
Given a list of numbers, in which every number occurs an even number of times except one number, which occurs an odd number of times, return the value of the odd number. Question should be done with a hash map but I used a n log n solution.
Viewing 1411 - 1420 interview questions