</>
Skip to content

DSA Tutorial

Learn DSA

Data structures & algorithms

Start learning →54 / 54 lessons ready

Full curriculum — in order

  1. Introduction
  2. Algorithms
  3. Complexity
  4. Big O Notation
  5. Recursion
  6. Arrays
  7. Strings
  8. Linked Lists
  9. Doubly Linked Lists
  10. Circular Linked Lists
  11. Stacks
  12. Queues
  13. Deques
  14. Hash Tables
  15. HashMap
  16. Sets
  17. Trees
  18. Binary Trees
  19. Binary Search Trees
  20. AVL Trees
  21. Heaps
  22. Priority Queues
  23. Graphs
  24. Graph Traversal
  25. BFS
  26. DFS
  27. Linear Search
  28. Binary Search
  29. Bubble Sort
  30. Selection Sort
  31. Insertion Sort
  32. Merge Sort
  33. Quick Sort
  34. Heap Sort
  35. Counting Sort
  36. Radix Sort
  37. Bucket Sort
  38. Depth First Search
  39. Breadth First Search
  40. Dijkstra's Algorithm
  41. Floyd-Warshall Algorithm
  42. Kruskal's Algorithm
  43. Prim's Algorithm
  44. Topological Sort
  45. Dynamic Programming
  46. Greedy Algorithms
  47. Backtracking
  48. Divide and Conquer
  49. Sliding Window
  50. Two Pointers
  51. Bit Manipulation
  52. Trie
  53. Segment Tree
  54. Fenwick Tree