Binary Tree level order traversal. In-order traversal a BST tree that each node points to its parent and all leaves link to each other(SLL). Find the last k fibonacci numbers that are smaller than n.
Intern Software Engineer Interview Questions
9,357 intern software engineer interview questions shared by candidates
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.
What kind of script language you'll use to delete all SSN in a large amount of files in distributed system? How to delete them?
Design a File System using OOPS concepts.
A complex tree question which involved implementation as queue and Linklist both
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.
Viewing 2381 - 2390 interview questions