Questions Quizzes Daily challenge System design My attempts

Loading questions…

Practice / Questions

Question bank.

Explore 2,015 questions across 22 categories. Choose a subject, format, and difficulty, then learn from each explanation.

Prefer a full quiz? Browse quizzes →

Find a question

Search questions

Category

Topic

Question format

Difficulty

2,015 questions to explore

Showing 41–60 of 2015 results

1 2 3 4 5…101

Algorithms · Multiple Choice
Difficulty: Extra Hard
Which strongly-connected-component algorithm uses two depth-first passes and the transposed graph?
Graph structure algorithmsConnectivity
Answer →
Algorithms · Multiple Choice
Difficulty: Medium
Which technique caches a function's result for an input and reuses it on a later identical call?

Reusable techniquesAlgorithm implementation

Algorithms · Multiple Choice

Difficulty: Medium

Which dynamic-programming approach fills a table of smaller subproblem results before larger ones?

Reusable techniquesAlgorithm implementation

Algorithms · Multiple Choice

Difficulty: Hard

Which optimization technique searches an ordered answer range using a monotonic feasibility predicate?

Reusable techniquesAlgorithm implementation

Algorithms · Multiple Choice

Difficulty: Hard

Which technique selects a fixed-size random sample from a stream without knowing its final length beforehand?

Reusable techniquesAlgorithm implementation

Algorithms · Multiple Choice

Difficulty: Medium

Which shuffle repeatedly swaps a position with a uniformly chosen position from the remaining range?

Reusable techniquesAlgorithm implementation

Algorithms · Multiple Choice

Difficulty: Medium

What property is proved before a loop and preserved by every iteration to support its correctness?

Algorithm propertiesCorrectness

Algorithms · Multiple Choice

Difficulty: Medium

What quantity decreases toward a lower bound to help prove an algorithm eventually stops?

Algorithm propertiesCorrectness

Algorithms · Multiple Choice

Difficulty: Medium

What sorting property preserves the original relative order of records with equal sort keys?

Algorithm propertiesCorrectness

Algorithms · Multiple Choice

Difficulty: Medium

What describes an algorithm that operates mainly within its input storage using a small auxiliary space budget?

Algorithm propertiesCorrectness

Algorithms · Multiple Choice

Difficulty: Medium

What describes an algorithm whose execution choices are fixed by its input and defined environment?

Algorithm propertiesCorrectness

Algorithms · Multiple Choice

Difficulty: Easy

What must be true before using binary search on an array?

Search algorithmsSorted data

Algorithms · Multiple Choice

Difficulty: Medium

In an unweighted graph, which traversal finds a path with the fewest edges?

GraphsSearch algorithms

Algorithms · Multiple Choice

Difficulty: Easy

For a typical hash map, what is the average lookup time by key?

Hash mapsComplexity

Algorithms · Fill in the Blank

Difficulty: Easy

Fill in the missing exponent for two independent n-iteration nested loops: O(n^____).

ComplexityCode completion

Algorithms · Fill in the Blank

Difficulty: Easy

Fill in the traversal order name for left subtree, node, right subtree: ____.

TreesCode completion

Algorithms · Fill in the Blank

Difficulty: Easy

Fill in the term for the directly handled case that stops recursive expansion: ____ case.

RecursionCode completion

Algorithms · Fill in the Blank

Difficulty: Easy

Fill in the sorting algorithm based on recursively sorted halves and an ordered merge: ____ sort.

SortingCode completion

Algorithms · Fill in the Blank

Difficulty: Easy

Fill in the traversal family that uses a FIFO frontier to visit increasing edge distances: ____-first search.

GraphsCode completion

Algorithms · Hotspot

Difficulty: Easy

For the pictured array [83, 7, 34, 21, 17], click the cell containing the smallest value.

ArraysOrder statistics

Showing 41–60 of 2015 results

1 2 3 4 5…101