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 121–140 of 2015 results

1…6 7 8…101

Algorithms · Multiple Select
Difficulty: Easy
Consider [10; 13; 8; 3; 15; 5]. Select all entries that are prime integers.
Prime numbersSet membership
Answer →
Algorithms · Multiple Select
Difficulty: Easy
Consider [3; 9; 15; 6; 13; 12]. Select all entries that are prime integers.

Prime numbersSet membership

Algorithms · Multiple Select

Difficulty: Easy

Consider [11; 17; 2; 8; 6; 12]. Select all entries that are prime integers.

Prime numbersSet membership

Algorithms · Multiple Select

Difficulty: Easy

Consider [8; 10; 11; 6; 5; 4]. Select all entries that are prime integers.

Prime numbersSet membership

Algorithms · Numerical Answer

Difficulty: Medium

How many edges are in a simple complete undirected graph on 5 vertices? No self-loops are allowed.

GraphsEdge counting

Algorithms · Numerical Answer

Difficulty: Medium

How many edges are in a simple complete undirected graph on 6 vertices? No self-loops are allowed.

GraphsEdge counting

Algorithms · Numerical Answer

Difficulty: Medium

How many edges are in a simple complete undirected graph on 7 vertices? No self-loops are allowed.

GraphsEdge counting

Algorithms · Numerical Answer

Difficulty: Medium

How many edges are in a simple complete undirected graph on 8 vertices? No self-loops are allowed.

GraphsEdge counting

Algorithms · Numerical Answer

Difficulty: Medium

How many edges are in a simple complete undirected graph on 9 vertices? No self-loops are allowed.

GraphsEdge counting

Algorithms · Numerical Answer

Difficulty: Medium

How many edges are in a simple complete undirected graph on 10 vertices? No self-loops are allowed.

GraphsEdge counting

Algorithms · Numerical Answer

Difficulty: Medium

How many edges are in a simple complete undirected graph on 11 vertices? No self-loops are allowed.

GraphsEdge counting

Algorithms · Numerical Answer

Difficulty: Medium

How many edges are in a simple complete undirected graph on 12 vertices? No self-loops are allowed.

GraphsEdge counting

Algorithms · Numerical Answer

Difficulty: Medium

How many edges are in a simple complete undirected graph on 13 vertices? No self-loops are allowed.

GraphsEdge counting

Algorithms · Numerical Answer

Difficulty: Medium

How many edges are in a simple complete undirected graph on 14 vertices? No self-loops are allowed.

GraphsEdge counting

Algorithms · Ordering / Sequencing

Difficulty: Easy

Arrange these integer keys in ascending order: [75, 88, 119, 5, 77].

ComparisonAscending order

Algorithms · Ordering / Sequencing

Difficulty: Easy

Arrange these lowercase ASCII identifiers in lexicographic order: olive, amber, delta, fern, birch.

StringsLexicographic order

Algorithms · Ordering / Sequencing

Difficulty: Medium

Insert distinct keys [105, 39, 53, 74, 32] into a binary search tree. Arrange the keys in inorder traversal order.

Binary search treesInorder traversal

Algorithms · Ordering / Sequencing

Difficulty: Hard

Start BFS at R. Adjacency order is R: [N, U]; N: [K, V]; U: [A, T]; 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 U and right M; U has left T and right Q; M has left G and right B. Arrange the visit sequence.

TreesPreorder traversal

Algorithms · Ordering / Sequencing

Difficulty: Easy

Arrange these integer keys in ascending order: [25, 52, 9, 113, 86].

ComparisonAscending order

Showing 121–140 of 2015 results

1…6 7 8…101