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 181–200 of 2015 results

1…9 10 11…101

Algorithms · Ordering / Sequencing
Difficulty: Easy
Arrange these lowercase ASCII identifiers in lexicographic order: kelp, glade, hazel, iris, amber.
StringsLexicographic order
Answer →
Algorithms · Ordering / Sequencing
Difficulty: Medium
Insert distinct keys [139, 154, 148, 142, 24] into a binary search tree. Arrange the keys in inorder traversal order.

Binary search treesInorder traversal

Algorithms · Ordering / Sequencing

Difficulty: Hard

Start BFS at F. Adjacency order is F: [C, L]; C: [P, B]; L: [V, Y]; all other lists are empty. Arrange vertices by first visit.

GraphsBreadth-first search

Algorithms · Ordering / Sequencing

Difficulty: Hard

Use node-left-right preorder. The binary tree is: N has left L and right R; L has left B and right A; R has left Q and right J. Arrange the visit sequence.

TreesPreorder traversal

Algorithms · Ranking

Difficulty: Hard

Rank these items with fewest calculated operations first at n = 12; evaluate these formulas rather than comparing Big-O classes: Plan A: 4n operations; Plan B: n squared operations; Plan C: 100 operations; Plan D: n log2(n) operations.

Concrete operation costsObjective ranking

Algorithms · Ranking

Difficulty: Hard

Rank these items with fewest calculated operations first at n = 20; evaluate these formulas rather than comparing Big-O classes: Plan A: 4n operations; Plan B: n squared operations; Plan C: 100 operations; Plan D: n log2(n) operations.

Concrete operation costsObjective ranking

Algorithms · Ranking

Difficulty: Hard

Rank these items with fewest calculated operations first at n = 28; evaluate these formulas rather than comparing Big-O classes: Plan A: 4n operations; Plan B: n squared operations; Plan C: 100 operations; Plan D: n log2(n) operations.

Concrete operation costsObjective ranking

Algorithms · Ranking

Difficulty: Hard

Rank these items with fewest calculated operations first at n = 36; evaluate these formulas rather than comparing Big-O classes: Plan A: 4n operations; Plan B: n squared operations; Plan C: 100 operations; Plan D: n log2(n) operations.

Concrete operation costsObjective ranking

Algorithms · Ranking

Difficulty: Hard

Rank these items with fewest calculated operations first at n = 44; evaluate these formulas rather than comparing Big-O classes: Plan A: 4n operations; Plan B: n squared operations; Plan C: 100 operations; Plan D: n log2(n) operations.

Concrete operation costsObjective ranking

Algorithms · Ranking

Difficulty: Hard

Rank these items with fewest calculated operations first at n = 52; evaluate these formulas rather than comparing Big-O classes: Plan A: 4n operations; Plan B: n squared operations; Plan C: 100 operations; Plan D: n log2(n) operations.

Concrete operation costsObjective ranking

Algorithms · Ranking

Difficulty: Hard

Rank these items with fewest calculated operations first at n = 60; evaluate these formulas rather than comparing Big-O classes: Plan A: 4n operations; Plan B: n squared operations; Plan C: 100 operations; Plan D: n log2(n) operations.

Concrete operation costsObjective ranking

Algorithms · Ranking

Difficulty: Hard

Rank these items with fewest calculated operations first at n = 68; evaluate these formulas rather than comparing Big-O classes: Plan A: 4n operations; Plan B: n squared operations; Plan C: 100 operations; Plan D: n log2(n) operations.

Concrete operation costsObjective ranking

Algorithms · Ranking

Difficulty: Hard

Rank these items with fewest calculated operations first at n = 76; evaluate these formulas rather than comparing Big-O classes: Plan A: 4n operations; Plan B: n squared operations; Plan C: 100 operations; Plan D: n log2(n) operations.

Concrete operation costsObjective ranking

Algorithms · Ranking

Difficulty: Hard

Rank these items with fewest calculated operations first at n = 84; evaluate these formulas rather than comparing Big-O classes: Plan A: 4n operations; Plan B: n squared operations; Plan C: 100 operations; Plan D: n log2(n) operations.

Concrete operation costsObjective ranking

Algorithms · True or False

Difficulty: Medium

True or false: Binary search needs an ordering compatible with the comparison used to discard candidates.

SearchingConcept checks

Algorithms · True or False

Difficulty: Medium

True or false: Two consecutive linear scans of n items necessarily take quadratic time.

ComplexityConcept checks

Algorithms · True or False

Difficulty: Medium

True or false: A stable sort retains the original relative order of records with equal sort keys.

SortingConcept checks

Algorithms · True or False

Difficulty: Hard

True or false: Dijkstra's usual settled-vertex argument remains valid for arbitrary negative-weight edges.

GraphsConcept checks

Algorithms · True or False

Difficulty: Medium

True or false: Memoization can avoid recomputing a previously solved subproblem with the same relevant inputs.

Dynamic programmingConcept checks

Algorithms · Multiple Choice

Difficulty: Easy

Which order does a queue follow?

QueuesData structures

Showing 181–200 of 2015 results

1…9 10 11…101