What is the difference between quicksort & mergesort? When should they be used? What is their running time?

1104

---

Tell me about networking classes and interfaces.

1069

---

What is cookies in networking ?

1023

---

What is HttpURL connection ?

1069

---

Lowest Common ancestor in a Binary Search Tree and Binary Tree.

947

---

Program to Find the second largest element in an array.

1214

---

Print Vertical traversal of a Binary Tree.

1027

---

Make a data structure and implement an algorithm to print all the files in a directory. (The root directory can have sub-directories too.)

1355

---

Is {a, n, d} a palindrome? If you are given a random string, is it a palindrome or not?

1156

---

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

1106

---

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

1135

---

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

1001

---

Convert Binary tree to linked list.

1113

---

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

1131

---

worst case complexities of Quick sort and Merge sort.

1052

---