Programming

Question 1

How to reset least significant 1 bit of a number

Answer 1

X & (X-1)

Question 2

Interval merge formula

Answer 2

end1 > start2 && end2 > start1

Question 3

When adding numbers always remember to :

Answer 3

Check for overflow condition.

Question 4

Linked list add remove. Always use :

Answer 4

Dummy head for single LL

dummy head and dummy tail for doubly LL

Question 5

O(n) of recursive calls formula :

Answer 5

0( branches ^ depth of tree)

For f(n) = f(n-1) + f(n-1)

It is 2^(n)

Question 6

Tree question first thing to check ?

Answer 6

is it a BST. If yes try to use the property

Question 7

C# - alphanumeric character how ?

Answer 7

Char.IsLetterOrDigit()

Question 8

N choose K possibilities

Answer 8

N! / (k! - (N-k)!)

Question 9

DP
Combinatorics
Optimization

Answer 9

Combinatorics:
How many ?
Number of ways ?

Optimization :
Minimum number of ..
Maximum cost of ..

Question 10

Index of node in a binary tree

Answer 10

Index of root = 1
Index of left child = parentIndex2
Index of right child = parentIndex2 + 1