How kunal-kushwaha/dsa-bootcamp-java works
Purpose and Repository Shape
This is a Java DSA/interview-preparation course repository, not a unified application or library. It combines ordered curriculum material, standalone Java demonstrations, and assignments. The progression is defined by SYLLABUS.md, assignments/, and sequential lectures/ directories.
Entry Points and Execution Model
Each lecture code folder is independently runnable; many contain a Main.java or topic-specific executable such as StackMain.java and QueueMain.java. There is no root build, package, deployment entry point, or shared runtime. Java code is generally organized under com.kunal for IntelliJ-style projects, while later examples are often flat Java source folders.
• lectures/05-first-java-program/first-idea-program/src/com/kunal/Main.java
• lectures/19-stacks-n-queues/code/src/com/kunal/StackMain.java
• lectures/20-trees/code/introduction/Main.java
Curriculum and Assignment Boundary
Lecture directories are the canonical instructional sequence: concepts, PDFs/notes, then illustrative implementations. Assignments are separate Markdown problem sets mapped to early/mid-course topics; solutions are intentionally not integrated into the repository.
• assignments/01-flow-of-program.md
• assignments/14-oop.md
• assignments/18-heaps.md
Foundational Java and Algorithm Stages
The first stages establish Java syntax, console input/output, branching, methods, arrays, then searching and elementary sorting. Examples are small self-contained programs that accept values or initialize in-memory inputs, run an algorithm, and print results.
• lectures/05-first-java-program/first-idea-program/src/com/kunal/Inputs.java
• lectures/09-linear search/code/src/com/kunal/SearchIn2DArray.java
• lectures/10-binary search/code/src/com/kunal/BinarySearch.java
Recursive, Mathematical, and Complexity Techniques
Recursion is the first substantial internal organization: packages separate introductory recursion, arrays, strings, backtracking, and recursive sorting. Later math/bitwise and complexity lessons provide supporting algorithmic techniques rather than reusable shared utilities.
• lectures/14-recursion/code/src/com/kunal/backtracking/SudokuSolver.java
• lectures/14-recursion/code/src/com/kunal/sorting/MergeSort.java
• lectures/16-math/code/src/com/kunal/maths/Seive.java
Object Modeling and Core Data Structures
OOP lessons model language mechanisms—inheritance, polymorphism, interfaces, generics, exceptions—through deliberately local example class graphs. Data-structure lessons implement mutable structures and expose operations through their local drivers; this is the principal code dependency boundary within each topic.
• lectures/17-oop/code/src/com/kunal/properties/inheritance/Box.java
• lectures/18-linkedlist/code/src/com/kunal/LL.java
• lectures/19-stacks-n-queues/code/src/com/kunal/CustomStack.java
Advanced Structures and Algorithms
The later curriculum expands into trees, heaps, hash maps, advanced sorting, compression, and square-root decomposition. Implementations remain independently scoped per lesson; for example, trees include BST, AVL, segment-tree, traversal, and interview-question variants rather than one common tree package.
• lectures/20-trees/code/AVL/AVL.java
• lectures/20-trees/code/Segment trees/SegmentTree.java
• lectures/27-huffman-coding/code/HuffmanCoder.java
Runtime, Infrastructure, and External Services
Material runtime is the Java/JDK standard library, exercised as console programs; IDE metadata indicates IntelliJ modules and some Eclipse/Replit project artifacts. There are no declared third-party dependencies, databases, APIs, CI/CD, cloud infrastructure, or persistent service integrations. The README links externally to YouTube/course content, while repository-local PDFs and notes are the primary learning assets.
• README.md
• lectures/20-trees/code/AVL/.project
• lectures/23-file handling/code/Output.java
Main entry points: introduction/Main.java Trees · kunal/Main.java Java basics · SYLLABUS.md Course syllabus · 01-flow-of-program.md Assignments
Components 22
Curriculum
Ordered learning materials and problem sets.
- Course syllabus · Defines the instructional progression.
SYLLABUS.md - Lecture sequence · Concept notes, PDFs, and runnable demonstrations.
- Assignments · Standalone exercises with no integrated solutions.
assignments/01-flow-of-program.md - OOP assignment
assignments/14-oop.md - Heaps assignment
assignments/18-heaps.md - Repository README · Links to external course content.
README.md
Foundations
Early standalone Java and algorithm examples.
- Java basics · Syntax and input/output foundations.
lectures/05-first-java-program/first-idea-program/src/com/kunal/Main.java - Input examples
lectures/05-first-java-program/first-idea-program/src/com/kunal/Inputs.java - Searching · Linear and binary search programs.
lectures/09-linear search/code/src/com/kunal/SearchIn2DArray.java - Binary search
lectures/10-binary search/code/src/com/kunal/BinarySearch.java - Recursion and backtracking · Includes recursive arrays, strings, sorting, and solvers.
lectures/14-recursion/code/src/com/kunal/backtracking/SudokuSolver.java - Recursive sorting
lectures/14-recursion/code/src/com/kunal/sorting/MergeSort.java - Math and bitwise
lectures/16-math/code/src/com/kunal/maths/Seive.java
Data Structures
Local implementations and topic drivers.
- OOP modeling · Inheritance, polymorphism, interfaces, generics, and exceptions.
lectures/17-oop/code/src/com/kunal/properties/inheritance/Box.java - Linked lists · Lesson-local linked-list implementation.
lectures/18-linkedlist/code/src/com/kunal/LL.java - Stacks and queues · Local stack implementation exercised by a runnable driver.
lectures/19-stacks-n-queues/code/src/com/kunal/CustomStack.java - Stack driver
lectures/19-stacks-n-queues/code/src/com/kunal/StackMain.java
Advanced Topics
Later independently scoped algorithms.
- Trees · Includes BST, AVL, segment trees, traversals, and variants.
lectures/20-trees/code/introduction/Main.java - AVL tree
lectures/20-trees/code/AVL/AVL.java - Segment tree
lectures/20-trees/code/Segment trees/SegmentTree.java - Huffman coding
lectures/27-huffman-coding/code/HuffmanCoder.java
Other components
- Java/JDK runtime · Each example runs independently without shared build or services.
Connections 24
- Repository README → Course syllabus: orients learners
- Course syllabus → Lecture sequence: orders
- Course syllabus → Assignments: maps topics to
- Assignments → OOP assignment: includes
- Assignments → Heaps assignment: includes
- Lecture sequence → Java basics: begins with
- Java basics → Input examples: includes
- Java basics → Searching: progresses to
- Searching → Binary search: includes
- Searching → Recursion and backtracking: precedes
- Recursion and backtracking → Recursive sorting: implements
- Recursion and backtracking → Math and bitwise: precedes
- Math and bitwise → OOP modeling: precedes
- OOP modeling → Linked lists: precedes
- Linked lists → Stacks and queues: precedes
- Stacks and queues → Stack driver: exercised by
- Stacks and queues → Trees: precedes
- Trees → AVL tree: includes
- Trees → Segment tree: includes
- Trees → Huffman coding: leads to
- Java/JDK runtime → Java basics: runs
- Java/JDK runtime → Stack driver: runs
- Java/JDK runtime → Trees: runs
- Java/JDK runtime → Huffman coding: runs