Skip to content

anuragtiwari-stacks/Python

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

32 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

JAVA_PW – Java DSA Repository πŸš€

A comprehensive Java Data Structures & Algorithms (DSA) repository, structured topic-wise for learning, practice, revision, and interview preparation.

This repository contains well-organized Java implementations of core DSA concepts, following a clear progression from basics to advanced topics.


πŸ“‚ Repository Structure

src/
β”œβ”€β”€ _1Array                     β†’ Array problems
β”œβ”€β”€ _2String                    β†’ String problems
β”œβ”€β”€ _3LinkedList              β†’ Linked List (Basics, Methods, PW)
β”œβ”€β”€ _4Stack                   β†’ Stack (Basics & Questions)
β”œβ”€β”€ _5Queue                   β†’ Queue & Deque
β”œβ”€β”€ _6Tree                    β†’ Binary Tree & BST
β”œβ”€β”€ _7Hashing                 β†’ HashSet, HashMap, TreeMap
β”œβ”€β”€ _8Heap                    β†’ Heap (Min/Max Heap & Problems)
β”œβ”€β”€ _9Graph                   β†’ Graph (BFS, DFS, Shortest Paths)
β”œβ”€β”€ _10PrefixSum               β†’ Prefix Sum techniques
β”œβ”€β”€ _11BitManipulation         β†’ Bit Manipulation
β”œβ”€β”€ _12SlidingWindow           β†’ Sliding Window problems
β”œβ”€β”€ _13Searching              β†’ Searching algorithms
β”œβ”€β”€ _14Sorting                β†’ Sorting algorithms & questions
β”œβ”€β”€ _15Greedy                 β†’ Greedy algorithms
β”œβ”€β”€ _16Tries                  β†’ Trie data structure
β”œβ”€β”€ _17SegmentTree            β†’ Segment Tree
β”œβ”€β”€ _18Recursion              β†’ Recursion basics
β”œβ”€β”€ _19BackTracking           β†’ Backtracking questions
β”œβ”€β”€ _20DynamicProgramming     β†’ Dynamic Programming (Memoization & Tabulation)
β”œβ”€β”€ COMPARATOR                β†’ Comparator & Lambda examples


🧠 Topics Covered

  • Arrays & Strings
  • Linked List
  • Stack & Queue
  • Trees (Binary Tree & BST)
  • Hashing
  • Heap (Priority Queue)
  • Graphs (BFS, DFS, Dijkstra, MST, etc.)
  • Prefix Sum
  • Sliding Window
  • Searching & Sorting
  • Bit Manipulation
  • Recursion & Backtracking
  • Greedy Algorithms
  • Tries
  • Segment Tree
  • Dynamic Programming

πŸ› οΈ Tech Stack

  • Language: Java
  • IDE: IntelliJ IDEA
  • Version Control: Git & GitHub

🎯 Purpose of This Repository

  • πŸ“Œ Build strong DSA fundamentals in Java
  • πŸ“Œ Prepare for coding interviews (FAANG / Product-based companies)
  • πŸ“Œ Practice problem-solving patterns
  • πŸ“Œ Quick revision before interviews

▢️ How to Use

  1. Clone the repository:

    git clone https://github.com/anuragtiwari-stacks/JAVA_DSA.git
  2. Open in IntelliJ IDEA

  3. Navigate topic-wise inside src/

  4. Run and modify individual Java files


πŸ“ˆ Progress

  • βœ” Core DSA topics implemented
  • βœ” Searching, Sorting, DP, Graphs covered
  • ⏳ Continuous updates with new problems

🀝 Contributing

Contributions are welcome!

  • Improve existing solutions
  • Add optimized approaches
  • Enhance code readability and comments

⭐ Support

If you find this repository helpful:

  • ⭐ Star the repo
  • 🍴 Fork it
  • πŸ“’ Share it

Happy Coding & DSA Practice! πŸ’»πŸ”₯

About

Python programs covering fundamentals, data structures, OOP, and statistics.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors