* Merge two sorted linked list. The merged list should also be sorted. * Compact a string. i.e remove spaces * traverse a link list containing char* as data. test cases for the same. * reverse a string. test cases for the same. * remove all the given characters from a string.
Implement clearbit(int n, int p) function, p is the position of the bit to be cleared. Example : n is 13, p is 0. Binary representation of n : 1101. You need to clear the pth postion, means 0th position bit needs to be cleared.
Write a function to obtain a string with the binary representation of an integer
Pancakes, size varies, and are put in a stack with random order. You have one operation called Flip(int[] pancakes, int k) to flip all pancakes from the top one to kth pancake, write a sort(int[] pancakes]) method
What is a stack?
Implementing a dictionary of quick searching words
given two linked lists with a digit in each node, add the two linked lists together. the result must be a linked list with one digit in each node. use only one iteration of the two input lists.
1. Calculate the factorial of an array of integers. 2. How to improve the factorial algorithm?
Are two words palindrome of each other?
The tech questions were easy if you had some practices (leetcode, etc). The behavior questions did catch me. Be prepared for some real QA scenario questions!
Viewing 81 - 90 interview questions