Skip to content

README.md

Latest commit

 

History

History
50 lines (34 loc) · 1.77 KB

README.md

File metadata and controls

50 lines (34 loc) · 1.77 KB

Java-Course-for-Placement

A collection of Java programs covering DSA, algorithms, and LeetCode solutions for placement preparation.

📂 Topics Covered

  • Arrays & Sorting – Bubble Sort, Insertion Sort, Quick Sort, Counting Sort, Merge Sorted Array, Spiral Matrix, Diagonal Sum, Trapping Rain Water
  • Searching – Binary Search, Linear Search, Search in Sorted Matrix, First & Last Position
  • Recursion – Factorial, Fibonacci, Tower of Hanoi, N-Queens, Maze Paths, Keypad Combinations, Subsets, Subsequences, Unique Subsequences
  • Strings – Palindrome, String Compression, Reverse String, Valid Anagram, Length of String, Number to Words
  • Linked Lists – Remove Nth Node, Swap Nodes in Pairs
  • Bit Manipulation – Single Number II & III, Divide Two Integers, Add Binary, Find the Difference
  • Backtracking – Combination Sum, N-Queens
  • LeetCode Problems – 19, 29, 66, 67, 88, 389, 643, 1689, and more
  • Networking Simulations – ARP/RARP Simulation, Stop-and-Wait ARQ Protocol
  • OOP Concepts – Customer/Product (Association), Student Result

🛠️ Tech Stack

  • Language: Java
  • IDE: Any Java-compatible IDE (IntelliJ IDEA / VS Code / Eclipse)
  • JDK: 8+

🚀 How to Run

# Clone the repo
git clone https://github.com/prashantpiyush1111/Java-Course-for-Placement.git

# Navigate to directory
cd Java-Course-for-Placement

# Compile any file
javac FileName.java

# Run
java FileName

📌 Purpose

This repository documents my Java learning journey — from basics to advanced DSA — focused on placement and interview preparation.

🤝 Contributing

Feel free to open issues or PRs for improvements or additional solutions.

📄 License

This project is open-source and available under the MIT License.