Add a value x to array from index l to r where 0 <= l <= r <= n-1

1095

---

Implement a stack with push (), pop() and min() in O(1) time.

1113

---

Find the value of a specified element of the array arr[i] where 0 <= i <= n-1

984

---

Convert Binary tree to linked list.

1093

---

Convert a BST into a DLL and DLL to BST in place.

1116

---

worst case complexities of Quick sort and Merge sort.

1033

---

What do you mean by hashing?

1109

---

What is the definition of tree ?

1040

---

When can you say a graph to be a tree?

1085

---

What do you mean by constant time complexity?

1250

---

Write a program to show whether a graph is a tree or not using adjacency matrix.

1098

---

You're given a Boolean 2D matrix, can you find the number of islands?

1111

---

What steps are taken when the OS shifts from one-thread execution to another?

1367

---

What are the differences between graph and tree?

1122

---

Differentiate between overriding and overloading cases?

1106

---