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

1093

---

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

1107

---

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

978

---

Convert Binary tree to linked list.

1084

---

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

1111

---

worst case complexities of Quick sort and Merge sort.

1022

---

What do you mean by hashing?

1101

---

What is the definition of tree ?

1034

---

When can you say a graph to be a tree?

1083

---

What do you mean by constant time complexity?

1230

---

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

1092

---

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

1093

---

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

1362

---

What are the differences between graph and tree?

1120

---

Differentiate between overriding and overloading cases?

1101

---