LEET CODE

Hello Everyone,

I am a beginner in coding and currently learning Data Structures and Algorithms. Above are the LeetCode problems I have solved so far. I plan to keep adding more as I progress. I primarily use C++ for solving problems, though at times I may use other languages as well.

The solutions shared in this repository are my own, so they might not be the most efficient or optimal. I welcome any feedback or suggestions to help me improve my coding skills. If you have any questions or problems you'd like me to solve, feel free to ask—I will do my best to tackle them!

I’m not a professional coder, but I am eager to learn and improve.

Please note that some solutions might be incomplete. I apologize for that and will work on completing them as soon as I can.

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

LEET CODE

About

Uh oh!

Releases

Packages

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 14 Commits
1.Two Sum		1.Two Sum
1011. Capacity To Ship Packages Within D Days		1011. Capacity To Ship Packages Within D Days
1015. Smallest Integer Divisible by K		1015. Smallest Integer Divisible by K
1018. Binary Prefix Divisible By 5		1018. Binary Prefix Divisible By 5
102. Binary Tree Level Order Traversal		102. Binary Tree Level Order Traversal
1028. Recover a Tree From Preorder Traversal		1028. Recover a Tree From Preorder Traversal
104. Maximum Depth of Binary Tree		104. Maximum Depth of Binary Tree
108. Convert Sorted Array to Binary Search Tree		108. Convert Sorted Array to Binary Search Tree
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
118. Pascal's Triangle		118. Pascal's Triangle
119. Pascal's Triangle II		119. Pascal's Triangle II
12. Integer to Roman		12. Integer to Roman
121. Best Time to Buy and Sell Stock		121. Best Time to Buy and Sell Stock
122. Best Time to Buy and Sell Stock II		122. Best Time to Buy and Sell Stock II
1233. Remove Sub-Folders from the Filesystem		1233. Remove Sub-Folders from the Filesystem
1249. Good String		1249. Good String
125. Valid Palindrome		125. Valid Palindrome
1255. Maximum Score Words Formed by Letters		1255. Maximum Score Words Formed by Letters
1262. Greatest Sum Divisible by Three		1262. Greatest Sum Divisible by Three
1277. Count Square Submatrices with All Ones		1277. Count Square Submatrices with All Ones
128. Longest Consecutive Sequence		128. Longest Consecutive Sequence
13. Roman to Integer		13. Roman to Integer
130. Surrounded Regions		130. Surrounded Regions
133. Clone Graph		133. Clone Graph
134. Gas Station		134. Gas Station
135. Candy		135. Candy
1351. Count Negative Numbers in a Sorted Matrix		1351. Count Negative Numbers in a Sorted Matrix
1352. Product of the Last K Numbers		1352. Product of the Last K Numbers
1353. Maximum Number of Events That Can Be Attended		1353. Maximum Number of Events That Can Be Attended
136. Single Number		136. Single Number
1376. Time Needed to Inform All Employees		1376. Time Needed to Inform All Employees
1380. Lucky Numbers in a Matrix		1380. Lucky Numbers in a Matrix
1382. Balance a Binary Search Tree		1382. Balance a Binary Search Tree
14. Longest Common Prefix		14. Longest Common Prefix
1405. Longest Happy String		1405. Longest Happy String
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
15. 3Sum		15. 3Sum
151. Reverse Words in a String		151. Reverse Words in a String
1523. Count Odd Numbers in an Interval Range		1523. Count Odd Numbers in an Interval Range
153. Find Minimum in Rotated Sorted Array		153. Find Minimum in Rotated Sorted Array
1544.MakeStringsGood		1544.MakeStringsGood
1545. Find Kth Bit in Nth Binary String		1545. Find Kth Bit in Nth Binary String
1574. Shortest Subarray to be Removed to Make Array Sorted		1574. Shortest Subarray to be Removed to Make Array Sorted
1593. Split a String Into the Max Number of Unique Substrings		1593. Split a String Into the Max Number of Unique Substrings
162. Find Peak Element		162. Find Peak Element
1652. Defuse the Bomb		1652. Defuse the Bomb
167. Two Sum II - Input Array Is Sorted		167. Two Sum II - Input Array Is Sorted
1671. Minimum Number of Removals to Make Mountain Array		1671. Minimum Number of Removals to Make Mountain Array
169. Majority Element		169. Majority Element
1700.Number Of Students Unable to Eat		1700.Number Of Students Unable to Eat
1760. Minimum Limit of Balls in a Bag		1760. Minimum Limit of Balls in a Bag
1813. Sentence similarity III		1813. Sentence similarity III
1829. Maximum XOR for Each Query		1829. Maximum XOR for Each Query
1837. Sum of Digits in Base K		1837. Sum of Digits in Base K
189. Rotate Array		189. Rotate Array
1914. Cyclically Rotating a Grid		1914. Cyclically Rotating a Grid
1925. Count Square Sum Triples		1925. Count Square Sum Triples
1930. Unique Length-3 Palindromic Subsequences		1930. Unique Length-3 Palindromic Subsequences
1942. The_Number of the Smallest Unoccupied Chair		1942. The_Number of the Smallest Unoccupied Chair
1957. Delete Characters to Make Fancy String		1957. Delete Characters to Make Fancy String
1963. Minimum Number of Swaps to Make the String Balanced		1963. Minimum Number of Swaps to Make the String Balanced
2. Add Two Numbers		2. Add Two Numbers
20.Valid paranthesis		20.Valid paranthesis
200. Number of Islands		200. Number of Islands
2009. Minimum Number of Operations to Make Array Continuous		2009. Minimum Number of Operations to Make Array Continuous
203. Remove Linked List Elements		203. Remove Linked List Elements
2033. Minimum Operations to Make a Uni-Value Grid		2033. Minimum Operations to Make a Uni-Value Grid
2035. Partition Array Into Two Arrays to Minimize Sum Difference		2035. Partition Array Into Two Arrays to Minimize Sum Difference
2044. Count Number of Maximum Bitwise-OR Subsets		2044. Count Number of Maximum Bitwise-OR Subsets
205. Isomorphic Strings		205. Isomorphic Strings
2054. Two Best Non-Overlapping Events		2054. Two Best Non-Overlapping Events
2064. Minimized Maximum of Products Distributed to Any Store		2064. Minimized Maximum of Products Distributed to Any Store
207. Course Schedule		207. Course Schedule
2070. Most Beautiful Item for Each Query		2070. Most Beautiful Item for Each Query
2073.Time needed to buy tickets		2073.Time needed to buy tickets
209. Minimum Size Subarray Sum		209. Minimum Size Subarray Sum
2109. Adding Spaces to a String		2109. Adding Spaces to a String
2110. Number of Smooth Descent Periods of a Stock		2110. Number of Smooth Descent Periods of a Stock
2154. Keep Multiplying Found Values by Two		2154. Keep Multiplying Found Values by Two
2169. Count Operations to Obtain Zero		2169. Count Operations to Obtain Zero
2181. Merge Nodes in Between Zeros		2181. Merge Nodes in Between Zeros
222. Count Complete Tree Nodes		222. Count Complete Tree Nodes
2222. Number of Ways to Select Buildings		2222. Number of Ways to Select Buildings
223. Rectangle Area		223. Rectangle Area
2257. Count Unguarded Cells in the Grid		2257. Count Unguarded Cells in the Grid
2273. Find Resultant Array After Removing Anagrams		2273. Find Resultant Array After Removing Anagrams
2275. Largest Combination With Bitwise AND Greater Than Zero		2275. Largest Combination With Bitwise AND Greater Than Zero
2337. Move Pieces to Obtain a String		2337. Move Pieces to Obtain a String
238. Product of Array Except Self		238. Product of Array Except Self
239. Sliding Window Maximum		239. Sliding Window Maximum
240. Search a 2D Matrix II		240. Search a 2D Matrix II
2406. Divide Intervals Into Minimum Number of Groups		2406. Divide Intervals Into Minimum Number of Groups
2419. Longest Subarray With Maximum Bitwise AND		2419. Longest Subarray With Maximum Bitwise AND
242. Valid Anagram		242. Valid Anagram
2458. Height of Binary Tree After Subtree Removal Queries		2458. Height of Binary Tree After Subtree Removal Queries
2461. Maximum Sum of Distinct Subarrays With Length K		2461. Maximum Sum of Distinct Subarrays With Length K
2463. Minimum Total Distance Traveled		2463. Minimum Total Distance Traveled

Rajdip-Pal/LeetCode

Folders and files

Latest commit

History

Repository files navigation

LEET CODE

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages