Interview Questions and Answers

The Knapsack problem is a combinatorial optimization problem where the goal is to select items with given weights and values to maximize the total value, subject to a constraint on the total weight.

An AVL tree is a self-balancing binary search tree where the height of the two child subtrees of any node differs by at most one. It ensures that the tree remains balanced, resulting in efficient search, insertion, and deletion operations.

The traveling salesman problem is a combinatorial optimization problem where the goal is to find the shortest possible tour that visits a given set of cities and returns to the starting city. It is NP-hard.

Karger's algorithm is a randomized algorithm used to find a minimum cut of a connected graph. It repeatedly contracts random edges until only two nodes (representing the two sides of the cut) remain.

The Ford-Fulkerson algorithm is used to find the maximum flow in a flow network. It can be applied to solve various optimization problems, such as network flow and bipartite matching.

The 0/1 Knapsack problem is a variation of the Knapsack problem where each item can be either selected or not selected, and the goal is to maximize the total value without exceeding the knapsack's capacity.

An R-Tree is a tree data structure used for spatial indexing of multidimensional data, such as rectangles in a 2D space or cuboids in a 3D space. It is particularly useful in database systems for spatial queries.

Primality testing determines whether a given number is prime or composite. Various algorithms, such as the Miller-Rabin algorithm, are used for efficient primality testing.

A B-tree is a self-balancing tree data structure that maintains sorted data and allows for efficient insertion, deletion, and search operations. It is commonly used in databases and file systems.

Manacher's algorithm is used to find the longest palindromic substring in a given string. It efficiently takes advantage of previously computed palindromic substrings to avoid redundant computations.

The Traveling Salesman Problem is a combinatorial optimization problem where the goal is to find the shortest possible tour that visits a given set of cities and returns to the starting city.

The Rabin-Karp algorithm is a string-searching algorithm that efficiently finds the occurrence of a pattern within a text by using hashing.