GeeksForGeeks Technical Member Staff Intern Interview Questions and Answers

Dijkstra's algorithm will not work when there are negative edge weights in the graph.

• Dijkstra's algorithm assumes that all edge weights are non-negative.

• If there are negative edge weights, the algorithm may produce incorrect shortest paths.

• In such cases, other algorithms like Bellman-Ford or Floyd-Warshall should be used.

• For example, consider a graph with a negative weight cycle.

Sparse table is a data structure used to efficiently answer range queries on an array.

• Sparse table is used to optimize range query operations on an array.

• It precomputes and stores the answers to all possible range queries in a table.

• The table is constructed using a divide-and-conquer approach.

• Sparse table reduces the time complexity of range queries from O(n) to O(1).

• It is commonly used in scenarios where range queries