Write a class that takes in a window size (n) in its constructor. The only method in the class takes in an integer, adds it into a sequence of numbers with that value, and returns the average of the last n values inserted into the sequence. Do not iterate over the sequence to calculate the average. Couldn't use STL. For example, if window size (n) is 2: update(1) returns 1 update(2) returns 1.5 update(3) returns 2.5 update(4) returns 3.5
Determine the fewest number of coins that can add up to a number. Should work for any 'currency'.
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.
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.
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.
Viewing 581 - 590 interview questions