Answer / Rahul Pratap

Range Search is a query operation in data structures that finds all elements within a given range. Data structures like segment trees, interval trees, and skip lists are used to perform efficient range searches.

Define disjoint set adt?

1 Answers  

---

Can arraylist have null values?

1 Answers  

---

What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms?

1 Answers  

---

What are linked lists used for?

1 Answers  

---

Write a program to sum values of given array.

1 Answers  

---

Why we need cursor implementation of linked lists?

1 Answers  

---

Is hashset thread safe?

1 Answers  

---

What are the advantages of array?

1 Answers  

---

What is the default size of arraylist?

1 Answers  

---

What is a sorting algorithm in data structure?

1 Answers  

---

What is unhashable type list?

1 Answers  

---

Describe the complexity of Binary search

1 Answers   Honeywell, Zomato,

---