This part of Algorithms Specialization focuses on essential topics in data structures and graph primitives. You'll study data structures such as heaps, balanced search trees, hash tables, and bloom filters. The course also covers graph primitives, including applications of breadth-first and depth-first search, connectivity, and shortest paths. These concepts are applied to various real-world problems, from data deduplication to social network analysis.
🆓 Free to Audit
🕒 Approx. 15 Hours
✏️Intermediate Level
🧾 Paid Certificate Available Upon Completion
🎓 Offered by Stanford University via Coursera
