Skip to content

durjaysamrat/leetcode

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

167 Commits
0001-two-sum
0001-two-sum
 
 
0004-median-of-two-sorted-arrays
0004-median-of-two-sorted-arrays
 
 
0036-valid-sudoku
0036-valid-sudoku
 
 
0038-count-and-say
0038-count-and-say
 
 
0049-group-anagrams
0049-group-anagrams
 
 
0075-sort-colors
0075-sort-colors
 
 
0094-binary-tree-inorder-traversal
0094-binary-tree-inorder-traversal
 
 
0125-valid-palindrome
0125-valid-palindrome
 
 
0135-candy
0135-candy
 
 
0217-contains-duplicate
0217-contains-duplicate
 
 
0238-product-of-array-except-self
0238-product-of-array-except-self
 
 
0242-valid-anagram
0242-valid-anagram
 
 
0345-reverse-vowels-of-a-string
0345-reverse-vowels-of-a-string
 
 
0347-top-k-frequent-elements
0347-top-k-frequent-elements
 
 
0386-lexicographical-numbers
0386-lexicographical-numbers
 
 
0440-k-th-smallest-in-lexicographical-order
0440-k-th-smallest-in-lexicographical-order
 
 
0474-ones-and-zeroes
0474-ones-and-zeroes
 
 
0812-largest-triangle-area
0812-largest-triangle-area
 
 
0830-largest-triangle-area
0830-largest-triangle-area
 
 
0909-snakes-and-ladders
0909-snakes-and-ladders
 
 
1061-lexicographically-smallest-equivalent-string
1061-lexicographically-smallest-equivalent-string
 
 
1154-day-of-the-year
1154-day-of-the-year
 
 
1290-convert-binary-number-in-a-linked-list-to-integer
1290-convert-binary-number-in-a-linked-list-to-integer
 
 
1295-find-numbers-with-even-number-of-digits
1295-find-numbers-with-even-number-of-digits
 
 
1298-maximum-candies-you-can-get-from-boxes
1298-maximum-candies-you-can-get-from-boxes
 
 
1346-check-if-n-and-its-double-exist
1346-check-if-n-and-its-double-exist
 
 
1353-maximum-number-of-events-that-can-be-attended
1353-maximum-number-of-events-that-can-be-attended
 
 
1394-find-lucky-integer-in-an-array
1394-find-lucky-integer-in-an-array
 
 
1432-max-difference-you-can-get-from-changing-an-integer
1432-max-difference-you-can-get-from-changing-an-integer
 
 
1448-maximum-69-number
1448-maximum-69-number
 
 
1498-number-of-subsequences-that-satisfy-the-given-sum-condition
1498-number-of-subsequences-that-satisfy-the-given-sum-condition
 
 
1751-maximum-number-of-events-that-can-be-attended-ii
1751-maximum-number-of-events-that-can-be-attended-ii
 
 
1768-merge-strings-alternately
1768-merge-strings-alternately
 
 
1857-largest-color-value-in-a-directed-graph
1857-largest-color-value-in-a-directed-graph
 
 
1865-finding-pairs-with-a-certain-sum
1865-finding-pairs-with-a-certain-sum
 
 
1900-the-earliest-and-latest-rounds-where-players-compete
1900-the-earliest-and-latest-rounds-where-players-compete
 
 
2014-longest-subsequence-repeated-k-times
2014-longest-subsequence-repeated-k-times
 
 
2016-maximum-difference-between-increasing-elements
2016-maximum-difference-between-increasing-elements
 
 
2040-kth-smallest-product-of-two-sorted-arrays
2040-kth-smallest-product-of-two-sorted-arrays
 
 
2081-sum-of-k-mirror-numbers
2081-sum-of-k-mirror-numbers
 
 
2099-find-subsequence-of-length-k-with-the-largest-sum
2099-find-subsequence-of-length-k-with-the-largest-sum
 
 
2138-divide-a-string-into-groups-of-size-k
2138-divide-a-string-into-groups-of-size-k
 
 
2200-find-all-k-distant-indices-in-an-array
2200-find-all-k-distant-indices-in-an-array
 
 
2294-partition-array-such-that-maximum-difference-is-k
2294-partition-array-such-that-maximum-difference-is-k
 
 
2311-longest-binary-subsequence-less-than-or-equal-to-k
2311-longest-binary-subsequence-less-than-or-equal-to-k
 
 
2359-find-closest-node-to-given-two-nodes
2359-find-closest-node-to-given-two-nodes
 
 
2394-count-subarrays-with-score-less-than-k
2394-count-subarrays-with-score-less-than-k
 
 
2410-maximum-matching-of-players-with-trainers
2410-maximum-matching-of-players-with-trainers
 
 
2434-using-a-robot-to-print-the-lexicographically-smallest-string
2434-using-a-robot-to-print-the-lexicographically-smallest-string
 
 
2566-maximum-difference-by-remapping-a-digit
2566-maximum-difference-by-remapping-a-digit
 
 
2616-minimize-the-maximum-difference-of-pairs
2616-minimize-the-maximum-difference-of-pairs
 
 
2894-divisible-and-non-divisible-sums-difference
2894-divisible-and-non-divisible-sums-difference
 
 
2929-distribute-candies-among-children-ii
2929-distribute-candies-among-children-ii
 
 
2942-find-words-containing-character
2942-find-words-containing-character
 
 
3024-type-of-triangle
3024-type-of-triangle
 
 
3085-minimum-deletions-to-make-string-k-special
3085-minimum-deletions-to-make-string-k-special
 
 
3136-valid-word
3136-valid-word
 
 
3170-lexicographically-minimum-string-after-removing-stars
3170-lexicographically-minimum-string-after-removing-stars
 
 
3201-find-the-maximum-length-of-valid-subsequence-i
3201-find-the-maximum-length-of-valid-subsequence-i
 
 
3202-find-the-maximum-length-of-valid-subsequence-ii
3202-find-the-maximum-length-of-valid-subsequence-ii
 
 
3213-count-subarrays-where-max-element-appears-at-least-k-times
3213-count-subarrays-where-max-element-appears-at-least-k-times
 
 
3307-find-the-k-th-character-in-string-game-ii
3307-find-the-k-th-character-in-string-game-ii
 
 
3372-maximize-the-number-of-target-nodes-after-connecting-trees-i
3372-maximize-the-number-of-target-nodes-after-connecting-trees-i
 
 
3373-maximize-the-number-of-target-nodes-after-connecting-trees-ii
3373-maximize-the-number-of-target-nodes-after-connecting-trees-ii
 
 
3403-find-the-lexicographically-largest-string-from-the-box-i
3403-find-the-lexicographically-largest-string-from-the-box-i
 
 
3405-count-the-number-of-arrays-with-k-matching-adjacent-elements
3405-count-the-number-of-arrays-with-k-matching-adjacent-elements
 
 
3423-maximum-difference-between-adjacent-elements-in-a-circular-array
3423-maximum-difference-between-adjacent-elements-in-a-circular-array
 
 
3439-reschedule-meetings-for-maximum-free-time-i
3439-reschedule-meetings-for-maximum-free-time-i
 
 
3440-reschedule-meetings-for-maximum-free-time-ii
3440-reschedule-meetings-for-maximum-free-time-ii
 
 
3442-maximum-difference-between-even-and-odd-frequency-i
3442-maximum-difference-between-even-and-odd-frequency-i
 
 
3443-maximum-manhattan-distance-after-k-changes
3443-maximum-manhattan-distance-after-k-changes
 
 
3445-maximum-difference-between-even-and-odd-frequency-ii
3445-maximum-difference-between-even-and-odd-frequency-ii
 
 
3566-partition-array-into-two-equal-product-subsets
3566-partition-array-into-two-equal-product-subsets
 
 
3567-minimum-absolute-difference-in-sliding-submatrix
3567-minimum-absolute-difference-in-sliding-submatrix
 
 
3568-minimum-moves-to-clean-the-classroom
3568-minimum-moves-to-clean-the-classroom
 
 
3569-maximize-count-of-distinct-primes-after-split
3569-maximize-count-of-distinct-primes-after-split
 
 
README.md
README.md
 
 

Repository files navigation

🧠 LeetCode Java Solutions – NeetCode 150 Roadmap

Welcome to my curated repository of Java-based solutions to LeetCode problems!
I'm actively solving challenges based on the NeetCode 150 Roadmap to master Data Structures and Algorithms for technical interviews. 📈

✅ Goal: Strengthen problem-solving for roles in SDE, Backend, and Full Stack Development.

📌 What's Inside?

  • ✅ 100+ Java Solutions
  • 📚 NeetCode 150 DSA Roadmap Progress
    • 🔥 Daily LeetCode Streak Maintenance
  • 🧩 Clean, readable, and efficient code
  • 🔍 Categorized by key data structures and algorithms:
    • Arrays & Hashing
    • Two Pointers
    • Sliding Window
    • Stack
    • Binary Search
    • Trees & Graphs
    • Dynamic Programming
    • Tries & Backtracking

🛠 Tech Stack

  • 💻 Language: Java
  • 🛠 Tools: VS Code, Eclipse
  • 🔁 Version Control: Git + GitHub
  • 📝 Tracking Progress: NeetCode 150 + Custom Notes

📅 Daily Problem Solving Streak 🔥

I consistently solve LeetCode Daily Challenges to stay sharp and push my boundaries every day.

🏆 Maintaining a streak of daily DSA problem-solving since May 2025

🔥 Recent Activity Highlights

  • 🧠 2410 - Maximum Matching of Players with Trainers
  • ✅ 0125 - Valid Palindrome
  • ⚡ 0440 - K-th Smallest in Lexicographical Order
  • 💡 Optimized recursion and dynamic programming techniques
  • 🧪 Solved back-to-back binary tree problems

🌱 Why This Repo?

This repository is part of my preparation for top product-based companies and backend-heavy roles.
I use Java to develop a deep understanding of algorithmic patterns, time-space complexity, and clean coding.

🚀 Upcoming Goals

  • Finish full NeetCode 150 by August 2025
  • Practice contest problems weekly
  • Add detailed problem explanations and time complexity notes

📫 Connect With Me

LinkedIn GitHub Portfolio

⭐ If you find this helpful, please star the repo!
Let’s learn, share, and grow together. Happy coding! 🚀

About

Java Solutions for NeetCode 150 + LeetCode Problems

Topics

java leetcode leetcode-solutions leetcode-java interview-preparation dsa neetcode neetcode150

Resources

Readme
Activity

Stars

2 stars

Watchers

1 watching

Forks

0 forks
Report repository

Languages