Blind 75 LeetCode Solutions in Java 🚀

This repository contains clean, optimized, and well-structured Java solutions for the popular Blind 75 coding challenges. The solutions are organized by category to make it easy to study and review core patterns.

📁 Repository Structure

The solutions are located inside the Blind75/src/main/java/Blind75 directory, grouped into classes based on algorithmic topics:

• 🧩 TwoPointersQ.java - Problems involving arrays, sub-arrays, and two-pointer sweeps (e.g., Two Sum, 3Sum, Container With Most Water).
• 🔄 SlidingWindowQ.java - Optimal sliding window techniques (e.g., Longest Substring Without Repeating Characters, Best Time to Buy and Sell Stock).
• 🔗 LinkedListQ.java - Node traversal, pointer manipulation, and cycle detection (e.g., Reverse Linked List, Merge Two Sorted Lists).
• 🌳 TreeQ.java - Binary tree traversals, structural validations, and path calculations (e.g., Maximum Depth of Binary Tree, Same Tree).
• 🌲 TrieQ.java - Trie structure implementation and search algorithms (e.g., Implement Trie, Design Add and Search Words Data Structure).
• 📈 IntervalsQ.java - Overlapping and non-overlapping interval management (e.g., Merge Intervals, Insert Interval).
• 👑 HeapQ.java - Priority queue behaviors (e.g., Top K Frequent Elements).
• ⚡ StackQ.java - LIFO execution structures (e.g., Valid Parentheses).
• 💰 GreedyQ.java - Greedy approximation and optimization patterns (e.g., Jump Game).

🛠️ Technical Setup

This is a standard Maven project.

• Language: Java 11 or higher
• Build System: Maven (using pom.xml)