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 61–80 of 2015 results

1 2 3 4 5…101

Algorithms · Hotspot
Difficulty: Medium
Click the intermediate node on the cheaper route from T to Q in the image.
Weighted graphsShortest routes
Answer →
Algorithms · Hotspot
Difficulty: Easy
For the pictured array [65, 10, 14, 46, 53], click the cell containing the largest value.

ArraysOrder statistics

Algorithms · Hotspot

Difficulty: Medium

Click the intermediate node on the cheaper route from R to M in the image.

Weighted graphsShortest routes

Algorithms · Hotspot

Difficulty: Medium

For the pictured array [57, 44, 61, 87, 55], click the cell containing the median value.

ArraysOrder statistics

Algorithms · Hotspot

Difficulty: Medium

Click the intermediate node on the cheaper route from C to X in the image.

Weighted graphsShortest routes

Algorithms · Hotspot

Difficulty: Easy

For the pictured array [66, 35, 70, 15, 63], click the cell containing the smallest value.

ArraysOrder statistics

Algorithms · Hotspot

Difficulty: Medium

Click the intermediate node on the cheaper route from L to J in the image.

Weighted graphsShortest routes

Algorithms · Hotspot

Difficulty: Easy

For the pictured array [56, 14, 8, 44, 20], click the cell containing the largest value.

ArraysOrder statistics

Algorithms · Hotspot

Difficulty: Medium

Click the intermediate node on the cheaper route from V to N in the image.

Weighted graphsShortest routes

Algorithms · Hotspot

Difficulty: Medium

For the pictured array [8, 86, 3, 80, 88], click the cell containing the median value.

ArraysOrder statistics

Algorithms · Hotspot

Difficulty: Medium

Click the intermediate node on the cheaper route from H to G in the image.

Weighted graphsShortest routes

Algorithms · Hotspot

Difficulty: Easy

For the pictured array [52, 53, 26, 44, 31], click the cell containing the smallest value.

ArraysOrder statistics

Algorithms · Hotspot

Difficulty: Medium

Click the intermediate node on the cheaper route from F to G in the image.

Weighted graphsShortest routes

Algorithms · Hotspot

Difficulty: Easy

For the pictured array [73, 29, 84, 59, 56], click the cell containing the largest value.

ArraysOrder statistics

Algorithms · Hotspot

Difficulty: Medium

Click the intermediate node on the cheaper route from Q to S in the image.

Weighted graphsShortest routes

Algorithms · Hotspot

Difficulty: Medium

For the pictured array [38, 51, 76, 70, 27], click the cell containing the median value.

ArraysOrder statistics

Algorithms · Hotspot

Difficulty: Medium

Click the intermediate node on the cheaper route from X to Q in the image.

Weighted graphsShortest routes

Algorithms · Hotspot

Difficulty: Easy

For the pictured array [85, 41, 56, 64, 11], click the cell containing the smallest value.

ArraysOrder statistics

Algorithms · Hotspot

Difficulty: Medium

Click the intermediate node on the cheaper route from F to W in the image.

Weighted graphsShortest routes

Algorithms · Image-Based Question

Difficulty: Easy

Using the pictured array for sample 1, what is the sum of the values at zero-based indices 1 and 3?

ArraysIndexed computation

Showing 61–80 of 2015 results

1 2 3 4 5…101