Take this free Advanced DSA MCQ quiz to test your in-depth knowledge. Perfect for interview prep and mastering core data structures.

Advanced DSA MCQ Test

Sorting and linear scan — O(n log n) time

Using a hash map — O(n) time and O(n) space

XOR of all elements — O(n) time and O(1) space

Brute-force pair comparison — O(n^2) time

Given an array where every element appears twice except one, which appears only once — which approach solves this in linear time and constant space?

Which algorithm is being used in this pseudo code?



Which is the most efficient approach for detecting cycles in a directed graph?

In a weighted graph with positive edge weights, which of the following algorithms guarantees the shortest path from a single source to all other vertices?

You are given a directed graph with n nodes and m edges. You are tasked with identifying the number of strongly connected components (SCCs). Which of the following algorithms can be used to do this in linear time with respect to n + m?

Which algorithmic technique efficiently solves the problem of finding the Longest Increasing Subsequence (LIS) in O(n log n) time?

What is the time complexity of the below code?




What is the output of this pseudo snippet?





You are given n items, each with a weight w[i] and a value v[i]. You are also given a maximum weight capacity W. However, you can pick each item multiple times (unbounded) as long as the total weight does not exceed W.

What will be the maximum total value you can obtain?

For n = 3, W = 8
Weights: w = [3, 4, 5]
Values: v = [30, 50, 60]

What is the maximum total value achievable?



Using Union by Rank + Path Compression, what is the amortized time complexity of a find() or union() operation in a disjoint-set?

Which  data structure is ideal for LRU (Least Recently Used) cac

Time complexity to search an element in a balanced Red-Black Tree is:


Which algorithm efficiently computes the Lowest Common Ancestor (LCA) in a tree?


What is the time complexity of finding the maximum sum subarray of size k in an array of n elements using the sliding window approach?