How bhavyabhalla-27/dsa-supreme- works
Project Type and Purpose
• This is a repository for learning DSA, where each directory represents a topic (for example, Backtracking, Basic Sorting Algorithms, Dynamic Programming, Graphs, Trees, etc.) and within each topic you have notes (in PDF), code files (mostly in C++), and homework solution subdirectories.
File Structure
• The top-level directories are named by topics or dates (e.g., “Backtracking_22nd March 2023”, “Basic_Sorting_Algorithms_24th February 2023”, “Graphs_ClassIII_21st June 2023”, “Dynamic_Programming_ClassIII_9th June 2023”, etc).
• Many directories further include subdirectories like “Homework Questions” and notes PDFs. Some topics include multiple sessions (like different dates for Backtracking) indicating a chronological progression or different lecture sessions.
• While there is no build or deployment script, the structure itself gives a clear modular organization by subject matter.
Main Components
• Root Node: Label it “DSA-Supreme Repository” (representing the overall project).
• Topic Modules: Create high-level components for each major subject category—for example:
– Backtracking (with sub-nodes for each date/session)
– Sorting Algorithms
– Basic Patterns and Programming Basics
– Binary Search Trees, Linked Lists, Graphs, Trees, etc.
– Dynamic Programming, Greedy Algorithms, Recursion
– Additional topics like Bit Manipulation, Heaps, Stacks, Queues, etc.
• Sub-components within each module:
– “Notes” (PDFs and lecture slides)
– “Homework Questions/Solutions” (containing assignments)
– “Code Samples” (individual .cpp files for specific problems)
Architectural Patterns or Design Principles
• Even though this is not a runtime system, the organization pattern is modular and hierarchical. It follows principles such as separation of concerns by dedicating a separate directory (component) to each main topic.