// the find
campusx-official/dsa-using-python
codes related to my dsa course on python
A collection of Jupyter notebooks from a DSA course taught in Python. Covers the standard undergraduate CS data structures: linked lists, stacks, queues, hashing, and sorting. This is course material, not a library — it exists to follow along with lectures, not to be imported or deployed.
Notebooks are implementation-focused rather than just theory, so you can run and modify the code directly. Covers both array-backed and linked-list-backed implementations of the same structures (stacks, queues), which is useful for understanding the tradeoffs. Hashing section includes both chaining and linear probing, which most intro courses skip one of.
Abandoned since January 2023 with no updates. README is literally one line — no course link, no prerequisites, no explanation of what order to read the notebooks. No tests or assertions anywhere, so if your implementation is wrong you won't know it. Covers only the basics; nothing on trees, graphs, heaps, or dynamic programming, which makes this incomplete even as an intro reference.