What is the time complexity of accessing an element in an array by index?

What is the time complexity of two nested loops, each iterating from 0 to n?

What is the role of the base case in a recursive function?

Where are local variables in a function typically stored?

If two variables point to the same object, what happens when you modify the object through one variable?

What does string immutability mean in languages like Java or Python?

What is the time complexity of deleting the first element in an array of size N?

Which of the following describes the task of removing a specific value from an array in-place?

Why is string concatenation inside a loop using the '+' operator inefficient in immutable string languages?

How can you check if one string is an anagram of another in O(N) time?

In a singly linked list, what does a node contain?

When deleting a node from a singly linked list (given only a reference to that node, not the head), how can we delete it in O(1) time?

In backtracking, when do we need to pass additional states (like visited set or index)?

In backtracking, when should we use memoization?

What is the standard template of a backtracking function?

When generating subsets or combinations from an input array containing duplicate elements, how do we efficiently prevent duplicate combinations from being generated?

What order does BFS traverse nodes in a binary tree?

Which condition must be met before applying binary search?

When binary searching on an array that rises to a single peak value and then falls, what property allows us to discard half of the search space?

In binary search on a sorted array, how do we find the first element not smaller than a target?

When serializing and deserializing a binary tree using DFS, how do we represent empty child nodes (null pointers) to ensure the reconstruction is unique?

Which data structure is implicitly used by the call stack when executing a recursive DFS traversal on a tree?

Which property defines a Binary Search Tree (BST)?

In DFS on Tree, what does a Post-Order traversal do?

In graph algorithms, what is the key difference between topological sort and a standard DFS traversal?

What is the defining characteristic of an implicit graph in graph search algorithms?

When treating a 2D grid matrix as a graph, how are neighbors defined for a cell (r, c)?

Which of the following traversal algorithms is most suitable for finding the shortest path between two nodes in an unweighted graph?

What does topological sort require the graph to be?

What are the three steps of the Divide and Conquer paradigm?

What is the core principle of a greedy algorithm?

In interval problems, why do we typically sort the intervals by their start times first?

What is the defining property of a monotonic stack?

When rearranging characters in a string such that no two adjacent characters are identical, how can we use a heap to decide the character placement order?

When finding the Kth largest element, why is a min-heap of size K better than sorting?

When using a sliding window to find the shortest substring that contains all characters of a target string, which auxiliary data structure is typically used to verify if the current window is valid?

What is a loop invariant in a two-pointer algorithm?

In Floyd's Cycle Detection (fast/slow pointers), if a cycle exists in the linked list, what is guaranteed to happen?

Which problem is typically solved using opposite-direction two pointers?

If a prefix sum array `prefix` is defined as `prefix[i] = sum(arr[0..i-1])`, how do we calculate the sum of subarray `arr[L..R]`?

Which of the following operations is typically implemented in-place using two pointers moving in the same direction at different speeds?

When using a sliding window of dynamic size, when do we typically increment the left pointer?

Why is a two-pointer approach typically preferred over a naive nested loop search when finding if a sorted array contains two numbers that sum to a target?

Build your personalized roadmap