📚 DSA Notes
Struggling to revise everything from lectures? I've compiled handwritten notes from the Supreme 3.0 DSA course.
Basics of Programming
View on Topmate →Patterns
View on Topmate →Arrays, Time and Space Complexity
View on Topmate →Searching and Sorting
View on Topmate →Cpp STL
View on Topmate →Char Arrays and Strings
View on Topmate →Basic Maths and Pointers
View on Topmate →Recursion
View on Topmate →Backtracking and DnC
View on Topmate →OOPS concepts
View on Topmate →Linked List
View on Topmate →Stacks
View on Topmate →Queues
View on Topmate →Generic and Binary Trees
View on Topmate →Binary Search Trees
View on Topmate →Heaps
View on Topmate →Maps and Tries
View on Topmate →Graphs
View on Topmate →Greedy / Sliding Window / Bit Manipulation
View on Topmate →COMPLETE NOTES
View on Topmate →*No pressure — just here if you need them. Happy learning 💙 All notes are optional.