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

200 questions found

Showing 141–160 of 200 results

1…6 7 8 9 10

Algorithms · Ordering / Sequencing
Difficulty: Easy
Arrange these lowercase ASCII identifiers in lexicographic order: juniper, maple, hazel, fern, larch.
StringsLexicographic order
Answer →
Algorithms · Ordering / Sequencing
Difficulty: Medium
Insert distinct keys [119, 15, 89, 79, 28] into a binary search tree. Arrange the keys in inorder traversal order.

Binary search treesInorder traversal

Algorithms · Ordering / Sequencing

Difficulty: Hard

Start BFS at V. Adjacency order is V: [L, D]; L: [M, K]; D: [U, E]; 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: L has left T and right G; T has left Y and right F; G has left X and right R. Arrange the visit sequence.

TreesPreorder traversal

Algorithms · Ordering / Sequencing

Difficulty: Easy

Arrange these integer keys in ascending order: [33, 117, 119, 97, 54].

ComparisonAscending order

Algorithms · Ordering / Sequencing

Difficulty: Easy

Arrange these lowercase ASCII identifiers in lexicographic order: birch, elm, larch, fern, hazel.

StringsLexicographic order

Algorithms · Ordering / Sequencing

Difficulty: Medium

Insert distinct keys [72, 26, 88, 125, 129] into a binary search tree. Arrange the keys in inorder traversal order.

Binary search treesInorder traversal

Algorithms · Ordering / Sequencing

Difficulty: Hard

Start BFS at H. Adjacency order is H: [F, V]; F: [N, J]; V: [L, P]; 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 U and right G; U has left H and right Q; G has left X and right M. Arrange the visit sequence.

TreesPreorder traversal

Algorithms · Ordering / Sequencing

Difficulty: Easy

Arrange these integer keys in ascending order: [39, 26, 46, 81, 76].

ComparisonAscending order

Algorithms · Ordering / Sequencing

Difficulty: Easy

Arrange these lowercase ASCII identifiers in lexicographic order: amber, olive, fern, cedar, iris.

StringsLexicographic order

Algorithms · Ordering / Sequencing

Difficulty: Medium

Insert distinct keys [104, 69, 122, 154, 140] into a binary search tree. Arrange the keys in inorder traversal order.

Binary search treesInorder traversal

Algorithms · Ordering / Sequencing

Difficulty: Hard

Start BFS at J. Adjacency order is J: [V, D]; V: [W, X]; D: [P, Z]; 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: W has left B and right Z; B has left R and right F; Z has left S and right L. Arrange the visit sequence.

TreesPreorder traversal

Algorithms · Ordering / Sequencing

Difficulty: Easy

Arrange these integer keys in ascending order: [29, 33, 37, 41, 93].

ComparisonAscending order

Algorithms · Ordering / Sequencing

Difficulty: Easy

Arrange these lowercase ASCII identifiers in lexicographic order: kelp, iris, larch, maple, nutmeg.

StringsLexicographic order

Algorithms · Ordering / Sequencing

Difficulty: Medium

Insert distinct keys [88, 115, 69, 51, 46] into a binary search tree. Arrange the keys in inorder traversal order.

Binary search treesInorder traversal

Algorithms · Ordering / Sequencing

Difficulty: Hard

Start BFS at U. Adjacency order is U: [R, E]; R: [Z, S]; E: [Q, L]; 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: A has left X and right K; X has left U and right S; K has left R and right Z. Arrange the visit sequence.

TreesPreorder traversal

Algorithms · Ordering / Sequencing

Difficulty: Easy

Arrange these integer keys in ascending order: [4, 30, 110, 29, 90].

ComparisonAscending order

Showing 141–160 of 200 results

1…6 7 8 9 10