" + html; } html = html.replace("",""); html = html.replace("",""); html = html.replace("",""); html = html.trim(); doc.innerHTML = html; return ( doc.innerHTML.toLowerCase() === html.toLowerCase() ); } function codeCheckWarningClose() { document.getElementById("codeCheckWarning").style.display = "none"; } function codeCheckCorrectClose() { document.getElementById("codeCheckCorrect").style.display = "none"; }

×

×

Correct!

Exercise:

Not Correct

Click here to try again.

Correct!

Next ❯

DSA Get started

Exercise 1 Exercise 2 Exercise 3 Go to DSA Get started Tutorial

DSA Arrays

Exercise 1 Go to DSA Arrays Tutorial

DSA Bubble Sort

Exercise 1 Go to DSA Bubble Sort Tutorial

DSA Selection Sort

Exercise 1 Go to DSA Selection Sort Tutorial

DSA Quick Sort

Exercise 1 Go to DSA Quick Sort Tutorial

DSA Counting Sort

Exercise 1 Go to DSA Counting Sort Tutorial

DSA Radix Sort

Exercise 1 Go to DSA Radix Sort Tutorial

DSA Linear Search

Exercise 1 Exercise 2 Go to DSA Linear Search Tutorial

DSA Binary Search

Exercise 1 Go to DSA Binary Search Tutorial

DSA Linked Lists

Exercise 1 Exercise 2 Exercise 3 Exercise 4 Exercise 5 Exercise 6 Exercise 7 Go to DSA Linked Lists Tutorial

DSA Stacks

Exercise 1 Exercise 2 Exercise 3 Go to DSA Stacks Tutorial

DSA Queues

Exercise 1 Exercise 2 Go to DSA Queues Tutorial

DSA Trees

Exercise 1 Go to DSA Trees Tutorial

DSA Binary Trees

Exercise 1 Exercise 2 Go to DSA Binary Trees Tutorial

DSA Binary Search Trees

Exercise 1 Exercise 2 Exercise 3 Go to DSA Binary Search Trees Tutorial

DSA AVL Trees

Exercise 1 Go to DSA AVL Trees Tutorial

DSA Graphs

Exercise 1 Exercise 2 Exercise 3 Go to DSA Graphs Tutorial

DSA Cycle Detection

Exercise 1 Exercise 2 Exercise 3 Go to DSA Cycle Detection Tutorial

DSA Dijkstra

Exercise 1 Go to DSA Dijkstra Tutorial

DSA Bellman-Ford

Exercise 1 Exercise 2 Exercise 3 Exercise 4 Exercise 5 Go to DSA Bellman-Ford Tutorial