Skip to content
BranchesTags

Latest commit

 

History

315 Commits

Folders and files

NameName
Last commit message
Last commit date
class Solution { public int search(int[] nums, int target) { int low=0, high=nums.length-1; while(low <= high){ int mid=(low+high)
class Solution { public int search(int[] nums, int target) { int low=0, high=nums.length-1; while(low <= high){ int mid=(low+high)
 
 
10. Regular Expression Matching.java
10. Regular Expression Matching.java
 
 
101. Symmetric Tree.java
101. Symmetric Tree.java
 
 
1015. Smallest Integer Divisible by K.java
1015. Smallest Integer Divisible by K.java
 
 
1018. Binary Prefix Divisible By 5.java
1018. Binary Prefix Divisible By 5.java
 
 
1020. Number of Enclaves.java
1020. Number of Enclaves.java
 
 
1039. Minimum Score Triangulation of Polygon.java
1039. Minimum Score Triangulation of Polygon.java
 
 
1046. Last Stone Weight.java
1046. Last Stone Weight.java
 
 
1079. Letter Tile Possibilities.java
1079. Letter Tile Possibilities.java
 
 
108. Convert Sorted Array to Binary Search Tree.java
108. Convert Sorted Array to Binary Search Tree.java
 
 
1092. Shortest Common Supersequence .java
1092. Shortest Common Supersequence .java
 
 
11. Container With Most Water.java
11. Container With Most Water.java
 
 
111. Minimum Depth of Binary Tree.java
111. Minimum Depth of Binary Tree.java
 
 
112. Path Sum.java
112. Path Sum.java
 
 
1123. Lowest Common Ancestor of Deepest Leaves.java
1123. Lowest Common Ancestor of Deepest Leaves.java
 
 
1128. Number of Equivalent Domino Pairs.java
1128. Number of Equivalent Domino Pairs.java
 
 
1143. Longest Common Subsequence.java
1143. Longest Common Subsequence.java
 
 
118. Pascal's Triangle.java
118. Pascal's Triangle.java
 
 
1192. Critical Connections in a Network.java
1192. Critical Connections in a Network.java
 
 
120. Triangle.java
120. Triangle.java
 
 
1200. Minimum Absolute Difference.java
1200. Minimum Absolute Difference.java
 
 
121. Best Time to Buy and Sell Stock.java
121. Best Time to Buy and Sell Stock.java
 
 
1235. Maximum Profit in Job Scheduling.java
1235. Maximum Profit in Job Scheduling.java
 
 
124. Binary Tree Maximum Path Sum.java
124. Binary Tree Maximum Path Sum.java
 
 
1261. Find Elements in a Contaminated Binary Tree.java
1261. Find Elements in a Contaminated Binary Tree.java
 
 
1262. Greatest Sum Divisible by Three.java
1262. Greatest Sum Divisible by Three.java
 
 
1266. Minimum Time Visiting All Points.java
1266. Minimum Time Visiting All Points.java
 
 
1277. Count Square Submatrices with All Ones.java
1277. Count Square Submatrices with All Ones.java
 
 
1290. Convert Binary Number in a Linked List to Integer.java
1290. Convert Binary Number in a Linked List to Integer.java
 
 
1304. Find N Unique Integers Sum up to Zero.java
1304. Find N Unique Integers Sum up to Zero.java
 
 
1306. Jump Game III.java
1306. Jump Game III.java
 
 
131. Palindrome Partitioning.java
131. Palindrome Partitioning.java
 
 
1312. Minimum Insertion Steps to Make a String Palindrome.java
1312. Minimum Insertion Steps to Make a String Palindrome.java
 
 
1317. Convert Integer to the Sum of Two No-Zero Integers.java
1317. Convert Integer to the Sum of Two No-Zero Integers.java
 
 
1320. Minimum Distance to Type a Word Using Two Fingers.java
1320. Minimum Distance to Type a Word Using Two Fingers.java
 
 
1323. Maximum 69 Number
1323. Maximum 69 Number
 
 
1329. Sort the Matrix Diagonally.java
1329. Sort the Matrix Diagonally.java
 
 
1339. Maximum Product of Splitted Binary Tree.java
1339. Maximum Product of Splitted Binary Tree.java
 
 
1346. Check If N and Its Double Exist.java
1346. Check If N and Its Double Exist.java
 
 
1351. Count Negative Numbers in a Sorted Matrix.java
1351. Count Negative Numbers in a Sorted Matrix.java
 
 
1354. Construct Target Array With Multiple Sums.java
1354. Construct Target Array With Multiple Sums.java
 
 
1358. Number of Substrings Containing All Three Characters.java
1358. Number of Substrings Containing All Three Characters.java
 
 
1365. How Many Numbers Are Smaller Than the Current Number.java
1365. How Many Numbers Are Smaller Than the Current Number.java
 
 
1382. Balance a Binary Search Tree.java
1382. Balance a Binary Search Tree.java
 
 
1394. Find Lucky Integer in an Array.java
1394. Find Lucky Integer in an Array.java
 
 
1399. Count Largest Group.java
1399. Count Largest Group.java
 
 
1400. Construct K Palindrome Strings.java
1400. Construct K Palindrome Strings.java
 
 
1408. String Matching in an Array.java
1408. String Matching in an Array.java
 
 
1415. The k-th Lexicographical String of All Happy Strings of Length n.java
1415. The k-th Lexicographical String of All Happy Strings of Length n.java
 
 
1422. Maximum Score After Splitting a String.java
1422. Maximum Score After Splitting a String.java
 
 
144. Binary Tree Preorder Traversal.java
144. Binary Tree Preorder Traversal.java
 
 
1441. Build an Array With Stack Operations.java
1441. Build an Array With Stack Operations.java
 
 
1462. Course Schedule IV.java
1462. Course Schedule IV.java
 
 
1475. Final Prices With a Special Discount in a Shop.java
1475. Final Prices With a Special Discount in a Shop.java
 
 
1488. Avoid Flood in The City.java
1488. Avoid Flood in The City.java
 
 
1493. Longest Subarray of 1's After Deleting One Element.java
1493. Longest Subarray of 1's After Deleting One Element.java
 
 
150. Evaluate Reverse Polish Notation.java
150. Evaluate Reverse Polish Notation.java
 
 
1504. Count Submatrices With All Ones.java
1504. Count Submatrices With All Ones.java
 
 
1513. Number of Substrings With Only 1s.java
1513. Number of Substrings With Only 1s.java
 
 
1514. Path with Maximum Probability.java
1514. Path with Maximum Probability.java
 
 
1518. Water Bottles.java
1518. Water Bottles.java
 
 
1523. Count Odd Numbers in an Interval Range.java
1523. Count Odd Numbers in an Interval Range.java
 
 
1524. Number of Sub-arrays With Odd Sum.java
1524. Number of Sub-arrays With Odd Sum.java
 
 
1528. Shuffle String.java
1528. Shuffle String.java
 
 
1534. Count Good Triplets.java
1534. Count Good Triplets.java
 
 
1536. Minimum Swaps to Arrange a Binary Grid.java
1536. Minimum Swaps to Arrange a Binary Grid.java
 
 
1545. Find Kth Bit in Nth Binary String.java
1545. Find Kth Bit in Nth Binary String.java
 
 
1558. Minimum Numbers of Function Calls to Make Target Array.java
1558. Minimum Numbers of Function Calls to Make Target Array.java
 
 
1578. Minimum Time to Make Rope Colorful.java
1578. Minimum Time to Make Rope Colorful.java
 
 
1582. Special Positions in a Binary Matrix.java
1582. Special Positions in a Binary Matrix.java
 
 
1590. Make Sum Divisible by P.java
1590. Make Sum Divisible by P.java
 
 
1611. Minimum One Bit Operations to Make Integers Zero.java
1611. Minimum One Bit Operations to Make Integers Zero.java
 
 
1625. Lexicographically Smallest String After Applying Operations.java
1625. Lexicographically Smallest String After Applying Operations.java
 
 
165. Compare Version Numbers.java
165. Compare Version Numbers.java
 
 
1653. Minimum Deletions to Make String Balanced.java
1653. Minimum Deletions to Make String Balanced.java
 
 
1695. Maximum Erasure Value.java
1695. Maximum Erasure Value.java
 
 
1700. Number of Students Unable to Eat Lunch.java
1700. Number of Students Unable to Eat Lunch.java
 
 
1711. Count Good Meals.java
1711. Count Good Meals.java
 
 
1716. Calculate Money in Leetcode Bank.java
1716. Calculate Money in Leetcode Bank.java
 
 
1718. Construct the Lexicographically Largest Valid Sequence.java
1718. Construct the Lexicographically Largest Valid Sequence.java
 
 
172. Factorial Trailing Zeroes.java
172. Factorial Trailing Zeroes.java
 
 
1721. Swapping Nodes in a Linked List.java
1721. Swapping Nodes in a Linked List.java
 
 
1727. Largest Submatrix With Rearrangements.java
1727. Largest Submatrix With Rearrangements.java
 
 
1752. Check if Array Is Sorted and Rotated.java
1752. Check if Array Is Sorted and Rotated.java
 
 
1758. Minimum Changes To Make Alternating Binary String.java
1758. Minimum Changes To Make Alternating Binary String.java
 
 
1760. Minimum Limit of Balls in a Bag
1760. Minimum Limit of Balls in a Bag
 
 
1765. Map of Highest Peak.java
1765. Map of Highest Peak.java
 
 
1769. Minimum Number of Operations to Move All Balls to Each Box.java
1769. Minimum Number of Operations to Move All Balls to Each Box.java
 
 
1780. Check if Number is a Sum of Powers of Three.java
1780. Check if Number is a Sum of Powers of Three.java
 
 
1784. Check if Binary String Has at Most One Segment of Ones.java
1784. Check if Binary String Has at Most One Segment of Ones.java
 
 
1792. Maximum Average Pass Ratio.java
1792. Maximum Average Pass Ratio.java
 
 
1800. Maximum Ascending Subarray Sum.java
1800. Maximum Ascending Subarray Sum.java
 
 
1865. Finding Pairs With a Certain Sum.java
1865. Finding Pairs With a Certain Sum.java
 
 
1866. Number of Ways to Rearrange Sticks With K Sticks Visible.java
1866. Number of Ways to Rearrange Sticks With K Sticks Visible.java
 
 
1877. Minimize Maximum Pair Sum in Array.java
1877. Minimize Maximum Pair Sum in Array.java
 
 
1888. Minimum Number of Flips to Make the Binary String Alternating.java
1888. Minimum Number of Flips to Make the Binary String Alternating.java
 
 
190. Reverse Bits.java
190. Reverse Bits.java
 
 
191. Number of 1 Bits.java
191. Number of 1 Bits.java
 
 
1925. Count Square Sum Triples.java
1925. Count Square Sum Triples.java
 
 
1930. Unique Length-3 Palindromic Subsequences.java
1930. Unique Length-3 Palindromic Subsequences.java
 
 

Repository files navigation

🧠 400+ LeetCode Solutions in Java | DSA Practice Repository

This repository contains a curated collection of my Java solutions to LeetCode and other data structures & algorithms problems. While I've solved over 500+ problems overall, this repo highlights 400+ LeetCode questions, many of which include optimizations, comments, and pattern-based solutions for interview preparation and revision.

📌 Overview

  • ✅ 400+ curated LeetCode problems
  • 🧠 Total of 500+ DSA problems solved
  • 💻 Language: Java
  • 🧪 Core topics covered:
    • Arrays, Strings, HashMaps
    • Trees, Graphs, Linked Lists
    • Recursion, Backtracking
    • Greedy, Sliding Window
    • Dynamic Programming (DP)
    • Bit Manipulation, Math
    • Heap, Stack, Queue, Union-Find
  • ✍️ Some files include:
    • Time and space complexity notes
    • Brute force vs optimized comparison
    • Algorithmic patterns (BFS/DFS, two pointers, etc.)

📁 File Naming Convention

Each file is named using the LeetCode problem format:

<Problem Number>. <Problem Title>.java

About

500+ LeetCode problems solved in Java | Curated DSA repo with patterns, optimizations & notes

leetcode.com/u/yashmaini/

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages