How to transfer a form in infix(prefix) notation to a form in post-fix notation.
Software Engineer V Interview Questions
666,190 software engineer v interview questions shared by candidates
Binary Tree - Common Ancestor of two nodes
Justify the suduku
Reverse linked list recursively.
Phone interview 1: 1. Describe what a hash map/table is. Later evolved into how to deal with collisions. 2. Write the code to take an int array and return a new int array whose value at i is the product of all values in the input array except the value at i.
You have two sorted arrays - how can you effectively merge them into one giant sorted array?
"You are given an array of integers where every integer occurs an even number of times, except one integer that appears an odd number of times. Return the odd occurring integer. Write functioning code and read it to me when you're done."
First phone screen: Print all the nodes of a tree in reverse level order (ie print all the nodes at the leaves first, then print the nodes on the level above the leaves, and then eventually work your way to the top).
- Find k-th element from the end of the singlylinked list in single pass?
Given 2 files, each line in the files is considered an entry. Print the entries that are duplicated in both files such that the number of repeated entries are minumal. Example: File 1: aaa aaa bbb bbb bbb ccc File 2: aaa aaa aaa bbb bbb result: aaa aaa bbb bbb
Viewing 2321 - 2330 interview questions