Ep.1 – Arrays & Hashing | Data Structures and Algorithms | DSA in Python

Welcome to the first video in our Data Structures and Algorithms (DSA) series! In this series, we will be going through different data structures and algorithms by diving into leetcode problems and understanding the core concepts. Problems are selected from @NeetCode ‘s Roadmap which includes the famous 75 Blind questions along with 75 of his own selected questions. In this video, we will briefly go through the data structures we will be using for this topic, followed by solving 4 leetcode problems – 3 Easy, 1 Medium.

Check out Eraser here – https://www.eraser.io/
📌 Discord Server – https://discord.gg/Q8Rx8YWFVF

Resources:
Neetcode roadmap – https://neetcode.io/roadmap
Neetcode YouTube – @NeetCode
Neetcodeio YouTube – @NeetCodeIO
Learn About Time & Space Complexity – https://quanticdev.com/algorithms/primitives/big-o-time-space-complexity-types-explained/
Arrays in detail: https://www.freecodecamp.org/news/data-structures-101-arrays-a-visual-introduction-for-beginners-7f013bcc355a/
Hashmaps in detail: https://www.masaischool.com/blog/understanding-hashmap-data-structure-with-examples/

Timestamps:
(00:00:00) Introduction
(00:03:03) Contains Duplicate Solution | Leetcode 217
(00:14:31) Valid Anagram Solution | Leetcode 242
(00:34:18) Two Sum Solution | Leetcode 1
(00:45:31) Group Anagrams Solution | Leetcode 49
(01:06:04) Conclusion

Connect With Me Here:
GitHub: https://github.com/rivaanranawat
Linkedin: https://www.linkedin.com/in/rivaan-ranawat
Medium: https://namanrivaan.medium.com
X: https://x.com/RanawatRivaan
Instagram: https://instagram.com/optimalcoding