Skip to content

preettrank53/LeetCode53

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

836 Commits
1-two-sum
1-two-sum
 
 
100-same-tree
100-same-tree
 
 
1005-univalued-binary-tree
1005-univalued-binary-tree
 
 
101-symmetric-tree
101-symmetric-tree
 
 
1016-subarray-sums-divisible-by-k
1016-subarray-sums-divisible-by-k
 
 
1022-unique-paths-iii
1022-unique-paths-iii
 
 
1032-satisfiability-of-equality-equations
1032-satisfiability-of-equality-equations
 
 
1033-broken-calculator
1033-broken-calculator
 
 
1034-subarrays-with-k-different-integers
1034-subarrays-with-k-different-integers
 
 
1035-cousins-in-binary-tree
1035-cousins-in-binary-tree
 
 
104-maximum-depth-of-binary-tree
104-maximum-depth-of-binary-tree
 
 
1040-maximum-binary-tree-ii
1040-maximum-binary-tree-ii
 
 
1046-max-consecutive-ones-iii
1046-max-consecutive-ones-iii
 
 
105-construct-binary-tree-from-preorder-and-inorder-traversal
105-construct-binary-tree-from-preorder-and-inorder-traversal
 
 
1056-capacity-to-ship-packages-within-d-days
1056-capacity-to-ship-packages-within-d-days
 
 
1073-number-of-enclaves
1073-number-of-enclaves
 
 
1079-sum-of-root-to-leaf-binary-numbers
1079-sum-of-root-to-leaf-binary-numbers
 
 
109-convert-sorted-list-to-binary-search-tree
109-convert-sorted-list-to-binary-search-tree
 
 
1092-maximum-difference-between-node-and-ancestor
1092-maximum-difference-between-node-and-ancestor
 
 
110-balanced-binary-tree
110-balanced-binary-tree
 
 
111-minimum-depth-of-binary-tree
111-minimum-depth-of-binary-tree
 
 
1114-binary-search-tree-to-greater-sum-tree
1114-binary-search-tree-to-greater-sum-tree
 
 
1116-maximum-level-sum-of-a-binary-tree
1116-maximum-level-sum-of-a-binary-tree
 
 
112-path-sum
112-path-sum
 
 
1121-partition-array-for-maximum-sum
1121-partition-array-for-maximum-sum
 
 
113-path-sum-ii
113-path-sum-ii
 
 
115-distinct-subsequences
115-distinct-subsequences
 
 
1171-shortest-path-in-binary-matrix
1171-shortest-path-in-binary-matrix
 
 
12-integer-to-roman
12-integer-to-roman
 
 
120-triangle
120-triangle
 
 
1207-delete-nodes-and-return-forest
1207-delete-nodes-and-return-forest
 
 
121-best-time-to-buy-and-sell-stock
121-best-time-to-buy-and-sell-stock
 
 
1218-lowest-common-ancestor-of-deepest-leaves
1218-lowest-common-ancestor-of-deepest-leaves
 
 
122-best-time-to-buy-and-sell-stock-ii
122-best-time-to-buy-and-sell-stock-ii
 
 
123-best-time-to-buy-and-sell-stock-iii
123-best-time-to-buy-and-sell-stock-iii
 
 
1231-replace-elements-with-greatest-element-on-right-side
1231-replace-elements-with-greatest-element-on-right-side
 
 
124-binary-tree-maximum-path-sum
124-binary-tree-maximum-path-sum
 
 
1242-matrix-block-sum
1242-matrix-block-sum
 
 
1243-sum-of-nodes-with-even-valued-grandparent
1243-sum-of-nodes-with-even-valued-grandparent
 
 
1250-longest-common-subsequence
1250-longest-common-subsequence
 
 
1252-break-a-palindrome
1252-break-a-palindrome
 
 
1254-deepest-leaves-sum
1254-deepest-leaves-sum
 
 
127-word-ladder
127-word-ladder
 
 
129-sum-root-to-leaf-numbers
129-sum-root-to-leaf-numbers
 
 
1298-reverse-substrings-between-each-pair-of-parentheses
1298-reverse-substrings-between-each-pair-of-parentheses
 
 
1299-k-concatenation-maximum-sum
1299-k-concatenation-maximum-sum
 
 
13-roman-to-integer
13-roman-to-integer
 
 
130-surrounded-regions
130-surrounded-regions
 
 
131-palindrome-partitioning
131-palindrome-partitioning
 
 
1319-unique-number-of-occurrences
1319-unique-number-of-occurrences
 
 
132-palindrome-partitioning-ii
132-palindrome-partitioning-ii
 
 
1321-get-equal-substrings-within-budget
1321-get-equal-substrings-within-budget
 
 
1335-maximum-candies-allocated-to-k-children
1335-maximum-candies-allocated-to-k-children
 
 
134-gas-station
134-gas-station
 
 
135-candy
135-candy
 
 
1354-find-players-with-zero-or-one-losses
1354-find-players-with-zero-or-one-losses
 
 
136-single-number
136-single-number
 
 
137-single-number-ii
137-single-number-ii
 
 
1370-count-number-of-nice-subarrays
1370-count-number-of-nice-subarrays
 
 
1387-find-elements-in-a-contaminated-binary-tree
1387-find-elements-in-a-contaminated-binary-tree
 
 
14-longest-common-prefix
14-longest-common-prefix
 
 
1408-find-the-smallest-divisor-given-a-threshold
1408-find-the-smallest-divisor-given-a-threshold
 
 
141-linked-list-cycle
141-linked-list-cycle
 
 
1418-fair-distribution-of-cookies
1418-fair-distribution-of-cookies
 
 
142-linked-list-cycle-ii
142-linked-list-cycle-ii
 
 
1422-divide-array-in-sets-of-k-consecutive-numbers
1422-divide-array-in-sets-of-k-consecutive-numbers
 
 
1427-all-elements-in-two-binary-search-trees
1427-all-elements-in-two-binary-search-trees
 
 
143-reorder-list
143-reorder-list
 
 
1435-xor-queries-of-a-subarray
1435-xor-queries-of-a-subarray
 
 
144-binary-tree-preorder-traversal
144-binary-tree-preorder-traversal
 
 
1441-minimum-flips-to-make-a-or-b-equal-to-c
1441-minimum-flips-to-make-a-or-b-equal-to-c
 
 
1442-number-of-operations-to-make-network-connected
1442-number-of-operations-to-make-network-connected
 
 
1448-maximum-69-number
1448-maximum-69-number
 
 
145-binary-tree-postorder-traversal
145-binary-tree-postorder-traversal
 
 
1450-delete-leaves-with-a-given-value
1450-delete-leaves-with-a-given-value
 
 
1451-minimum-number-of-taps-to-open-to-water-a-garden
1451-minimum-number-of-taps-to-open-to-water-a-garden
 
 
1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
 
 
1458-sort-integers-by-the-number-of-1-bits
1458-sort-integers-by-the-number-of-1-bits
 
 
1460-number-of-substrings-containing-all-three-characters
1460-number-of-substrings-containing-all-three-characters
 
 
1465-maximum-product-of-splitted-binary-tree
1465-maximum-product-of-splitted-binary-tree
 
 
1498-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
1498-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
 
 
153-find-minimum-in-rotated-sorted-array
153-find-minimum-in-rotated-sorted-array
 
 
1538-maximum-points-you-can-obtain-from-cards
1538-maximum-points-you-can-obtain-from-cards
 
 
1544-count-good-nodes-in-binary-tree
1544-count-good-nodes-in-binary-tree
 
 
1553-count-triplets-that-can-form-two-arrays-of-equal-xor
1553-count-triplets-that-can-form-two-arrays-of-equal-xor
 
 
1567-maximum-number-of-vowels-in-a-substring-of-given-length
1567-maximum-number-of-vowels-in-a-substring-of-given-length
 
 
1568-pseudo-palindromic-paths-in-a-binary-tree
1568-pseudo-palindromic-paths-in-a-binary-tree
 
 
1586-longest-subarray-of-1s-after-deleting-one-element
1586-longest-subarray-of-1s-after-deleting-one-element
 
 
160-intersection-of-two-linked-lists
160-intersection-of-two-linked-lists
 
 
1604-least-number-of-unique-integers-after-k-removals
1604-least-number-of-unique-integers-after-k-removals
 
 
1605-minimum-number-of-days-to-make-m-bouquets
1605-minimum-number-of-days-to-make-m-bouquets
 
 
162-find-peak-element
162-find-peak-element
 
 
1635-number-of-good-pairs
1635-number-of-good-pairs
 
 
1646-kth-missing-positive-number
1646-kth-missing-positive-number
 
 
165-compare-version-numbers
165-compare-version-numbers
 
 
1667-find-kth-bit-in-nth-binary-string
1667-find-kth-bit-in-nth-binary-string
 
 
1669-minimum-cost-to-cut-a-stick
1669-minimum-cost-to-cut-a-stick
 
 
1675-magnetic-force-between-two-balls
1675-magnetic-force-between-two-balls
 
 
1677-matrix-diagonal-sum
1677-matrix-diagonal-sum
 
 
1683-maximum-number-of-coins-you-can-get
1683-maximum-number-of-coins-you-can-get
 
 

Repository files navigation

🚀 LeetCode53 – DSA Solutions in Java, C++ & Python

Welcome to my LeetCode solutions repository! 👨‍💻
This repo contains my handpicked solutions to various LeetCode problems solved in Java, C++, and Python — structured for easy understanding, interview prep, and consistent practice.

📌 About

✅ Clean, optimized code for each problem
🧠 Focused on logic, readability, and multiple approaches
📁 Solutions organized by language and topic
🔥 Regularly updated as I solve more problems

📂 Folder Structure

Each folder contains files named by the LeetCode problem title or number.

🧠 Topics Covered

  • Arrays & Strings
  • Linked Lists
  • Trees & Binary Trees
  • Graphs
  • Stack & Queues
  • Dynamic Programming
  • Greedy Algorithms
  • Recursion & Backtracking
  • Sliding Window
  • Hashing and more...

🛠️ Tech Stack

  • Languages: Java, C++, Python
  • Platform: LeetCode
  • IDEs: VS Code, Code::Blocks

✨ How to Use

  1. Browse to the language you're comfortable with.
  2. Open the folder and find the file by problem name or number.
  3. Read the comments (if any) for logic explanation.

⭐️ Star the Repo

If you find this helpful, consider giving it a ⭐ — it motivates me to keep going and help others too!

📬 Connect With Me

Feel free to reach out or connect:
🔗 LinkedIn
📫 Email

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages