LeetCode Solutions

My solutions to the LeetCode problems I've solved while practicing data structures and algorithms.

LeetCode Stats

About

This repository is a running log of my DSA practice. Each problem has its own folder, so a solution is easy to find and the history shows how my problem-solving has progressed over time.

Repository Structure

Every problem lives in a folder named <problem number> <problem title>:

LeetCode_Solutions/
├── 1 Two Sum/
├── 11 Container With Most Water/
├── 15 3Sum/
├── 104 Maximum Depth of Binary Tree/
├── 1143 Longest Common Subsequence/
└── ...

Each folder contains the solution file for that problem.

Topics Covered

The problems span the core areas of interview-style DSA practice:

Arrays & Strings: two pointers, sliding window, prefix sums
Hashing: frequency counting, lookups
Linked Lists: cycle detection, reordering, intersections
Trees: traversals (pre/in/post/level order), BST, path sums, lowest common ancestor
Graphs: DFS/BFS, cloning, connected regions
Dynamic Programming: subsequences, grid DP, 1D/2D DP
Stack & Parentheses problems
Math & Bit Manipulation
Sorting, Intervals & Greedy
Backtracking & Recursion

How to Use

Clone the repository:

git clone https://github.com/VickZeus/LeetCode_Solutions.git
cd LeetCode_Solutions

Open the folder of the problem you're interested in, for example 1 Two Sum.
Read the solution, or copy it into LeetCode's editor to test it.

To find a problem quickly, search the folder names:

ls | grep -i "binary tree"

Goals

Build consistent, daily problem-solving habits
Be able to code solutions independently, without looking up hints
Strengthen fundamentals in data structures, algorithms, and complexity analysis

Notes

These are my own attempts; some may not be the most optimal approach, and I revisit them as I learn better ones.
If you spot a bug or a cleaner solution, feel free to open an issue or a pull request.

Connect

GitHub: @VickZeus

If this repo helps you, consider giving it a ⭐.

Navigation Menu

Repository navigation

About

Repository files navigation

LeetCode Solutions

LeetCode Stats

About

Repository Structure

Topics Covered

How to Use

Goals

Notes

Connect

About

Releases

Packages

Contributors

Languages

Name		Name	Last commit message	Last commit date
1 Two Sum		1 Two Sum
100 Same Tree		100 Same Tree
1004 Max Consecutive Ones III		1004 Max Consecutive Ones III
101 Symmetric Tree		101 Symmetric Tree
1014 Best Sightseeing Pair		1014 Best Sightseeing Pair
1018 Binary Prefix Divisible By 5		1018 Binary Prefix Divisible By 5
102 Binary Tree Level Order Traversal		102 Binary Tree Level Order Traversal
1021 Remove Outermost Parentheses		1021 Remove Outermost Parentheses
103 Binary Tree Zigzag Level Order Traversal		103 Binary Tree Zigzag Level Order Traversal
104 Maximum Depth of Binary Tree		104 Maximum Depth of Binary Tree
1071 Greatest Common Divisor of Strings		1071 Greatest Common Divisor of Strings
1072 Flip Columns For Maximum Number of Equal Rows		1072 Flip Columns For Maximum Number of Equal Rows
11 Container With Most Water		11 Container With Most Water
110 Balanced Binary Tree		110 Balanced Binary Tree
1106 Parsing A Boolean Expression		1106 Parsing A Boolean Expression
111 Minimum Depth of Binary Tree		111 Minimum Depth of Binary Tree
112 Path Sum		112 Path Sum
1123 Lowest Common Ancestor of Deepest Leaves		1123 Lowest Common Ancestor of Deepest Leaves
113 Path Sum II		113 Path Sum II
1137 N-th Tribonacci Number		1137 N-th Tribonacci Number
114 Flatten Binary Tree to Linked List		114 Flatten Binary Tree to Linked List
1143 Longest Common Subsequence		1143 Longest Common Subsequence
115 Distinct Subsequences		115 Distinct Subsequences
116 Populating Next Right Pointers in Each Node		116 Populating Next Right Pointers in Each Node
1161 Maximum Level Sum of a Binary Tree		1161 Maximum Level Sum of a Binary Tree
117 Populating Next Right Pointers in Each Node II		117 Populating Next Right Pointers in Each Node II
118 Pascal's Triangle		118 Pascal's Triangle
119 Pascal's Triangle II		119 Pascal's Triangle II
1190 Reverse Substrings Between Each Pair of Parentheses		1190 Reverse Substrings Between Each Pair of Parentheses
12 Integer to Roman		12 Integer to Roman
120 Triangle		120 Triangle
1200 Minimum Absolute Difference		1200 Minimum Absolute Difference
1207 Unique Number of Occurrences		1207 Unique Number of Occurrences
121 Best Time to Buy and Sell Stock		121 Best Time to Buy and Sell Stock
1222 Queens That Can Attack the King		1222 Queens That Can Attack the King
1233 Remove Sub-Folders from the Filesystem		1233 Remove Sub-Folders from the Filesystem
124 Binary Tree Maximum Path Sum		124 Binary Tree Maximum Path Sum
125 Valid Palindrome		125 Valid Palindrome
1260 Shift 2D Grid		1260 Shift 2D Grid
1266 Minimum Time Visiting All Points		1266 Minimum Time Visiting All Points
1277 Count Square Submatrices with All Ones		1277 Count Square Submatrices with All Ones
128 Longest Consecutive Sequence		128 Longest Consecutive Sequence
1288 Remove Covered Intervals		1288 Remove Covered Intervals
129 Sum Root to Leaf Numbers		129 Sum Root to Leaf Numbers
1290 Convert Binary Number in a Linked List to Integer		1290 Convert Binary Number in a Linked List to Integer
1292 Maximum Side Length of a Square with Sum Less than or Equal to Threshold		1292 Maximum Side Length of a Square with Sum Less than or Equal to Threshold
1295 Find Numbers with Even Number of Digits		1295 Find Numbers with Even Number of Digits
13 Roman to Integer		13 Roman to Integer
130 Surrounded Regions		130 Surrounded Regions
1301 Number of Paths with Max Score		1301 Number of Paths with Max Score
1304 Find N Unique Integers Sum up to Zero		1304 Find N Unique Integers Sum up to Zero
1306 Jump Game III		1306 Jump Game III
1317 Convert Integer to the Sum of Two No-Zero Integers		1317 Convert Integer to the Sum of Two No-Zero Integers
133 Clone Graph		133 Clone Graph
1331 Rank Transform of an Array		1331 Rank Transform of an Array
1344 Angle Between Hands of a Clock		1344 Angle Between Hands of a Clock
1346 Check If N and Its Double Exist		1346 Check If N and Its Double Exist
1358 Number of Substrings Containing All Three Characters		1358 Number of Substrings Containing All Three Characters
136 Single Number		136 Single Number
1382 Balance a Binary Search Tree		1382 Balance a Binary Search Tree
1386 Cinema Seat Allocation		1386 Cinema Seat Allocation
1387 Sort Integers by The Power Value		1387 Sort Integers by The Power Value
1394 Find Lucky Integer in an Array		1394 Find Lucky Integer in an Array
1399 Count Largest Group		1399 Count Largest Group
14 Longest Common Prefix		14 Longest Common Prefix
1405 Longest Happy String		1405 Longest Happy String
141 Linked List Cycle		141 Linked List Cycle
143 Reorder List		143 Reorder List
1431 Kids With the Greatest Number of Candies		1431 Kids With the Greatest Number of Candies
1432 Max Difference You Can Get From Changing an Integer		1432 Max Difference You Can Get From Changing an Integer
1437 Check If All 1's Are at Least Length K Places Away		1437 Check If All 1's Are at Least Length K Places Away
144 Binary Tree Preorder Traversal		144 Binary Tree Preorder Traversal
145 Binary Tree Postorder Traversal		145 Binary Tree Postorder Traversal
1455 Check If a Word Occurs As a Prefix of Any Word in a Sentence		1455 Check If a Word Occurs As a Prefix of Any Word in a Sentence
1456 Maximum Number of Vowels in a Substring of Given Length		1456 Maximum Number of Vowels in a Substring of Given Length
1464 Maximum Product of Two Elements in an Array		1464 Maximum Product of Two Elements in an Array
1470 Shuffle the Array		1470 Shuffle the Array
1475 Final Prices With a Special Discount in a Shop		1475 Final Prices With a Special Discount in a Shop
1486 XOR Operation in an Array		1486 XOR Operation in an Array
1492 The kth Factor of n		1492 The kth Factor of n
1493 Longest Subarray of 1's After Deleting One Element		1493 Longest Subarray of 1's After Deleting One Element
1497 Check If Array Pairs Are Divisible by k		1497 Check If Array Pairs Are Divisible by k
15 3Sum		15 3Sum
150 Evaluate Reverse Polish Notation		150 Evaluate Reverse Polish Notation
151 Reverse Words in a String		151 Reverse Words in a String
1512 Number of Good Pairs		1512 Number of Good Pairs
1513 Number of Substrings With Only 1s		1513 Number of Substrings With Only 1s
152 Maximum Product Subarray		152 Maximum Product Subarray
1534 Count Good Triplets		1534 Count Good Triplets
1541 Minimum Insertions to Balance a Parentheses String		1541 Minimum Insertions to Balance a Parentheses String
1545 Find Kth Bit in Nth Binary String		1545 Find Kth Bit in Nth Binary String
1550 Three Consecutive Odds		1550 Three Consecutive Odds
1574 Shortest Subarray to be Removed to Make Array Sorted		1574 Shortest Subarray to be Removed to Make Array Sorted
1578 Minimum Time to Make Rope Colorful		1578 Minimum Time to Make Rope Colorful
1590 Make Sum Divisible by P		1590 Make Sum Divisible by P
1592 Rearrange Spaces Between Words		1592 Rearrange Spaces Between Words
1593 Split a String Into the Max Number of Unique Substrings		1593 Split a String Into the Max Number of Unique Substrings
16 3Sum Closest		16 3Sum Closest
160 Intersection of Two Linked Lists		160 Intersection of Two Linked Lists
1614 Maximum Nesting Depth of the Parentheses		1614 Maximum Nesting Depth of the Parentheses

Latest commit

History

Folders and files

Repository files navigation

LeetCode Solutions

LeetCode Stats

About

Repository Structure

Topics Covered

How to Use

Goals

Notes

Connect

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages