Data Structures and Algorithms Series

Get ready for Placements with the DSA Series.

🦄 What will I learn?

The goal of this series is to provide you with a basic understanding ofData structures and Algorithms. Here’s a quick summary of what you can expect to learn…

  1. DSA series announcement

  2. What is an algorithm?

  3. What are Data structures?

  4. Why DSA?

  5. Space complexity?

  6. Time complexity?

  7. Big O Notation

  8. Examples of Time Complexities

  9. Euclidian Algorithm

  10. Primality Test

  11. Sorting Algorithms

  12. Bubble Sort

  13. Selection Sort

  14. Insertion Sort

  15. Heap Sort

  16. Merge Sort

  17. Quick Sort

  18. Linear Search

  19. Binary Search

  20. Recursion

  21. Backtracking

  22. Arrays

  23. Sliding Window

  24. Two Pointer

  25. Linked lists

  26. Stacks

  27. Queues

  28. Set

  29. Map

  30. Trees

  31. Binary Search Trees

  32. Heaps

  33. Graphs

  34. Dynamic Programming

  35. Memoisation

  36. Tabulation

  37. Bellman Ford

  38. Dijkstra’s

  39. Run-Length Encoding

  40. Huffman Coding

  41. Tower of Hanoi

  42. End of Series

Remaining 7 topics will be inserted based on the knowledge gaps.

Stay tuned for daily DSA content updates!

🤔 Is this series Right for Me?

This course is beginner level and expects knowledge on basic programming for you to be able to answer questions yourself. If you are a fresher, and looking for an entry to corporate world, this course is a must. It is fast-paced, but far more in-depth and with a variety of interview questions.

When was the series last updated?

Updated Jan 26th, 2024

Chapters