LeetCode

This repository contains the solutions of LeetCode problems that I have solved using C++ language and each solution contain its editorial.

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

LeetCode

About

Uh oh!

Releases

Packages

Uh oh!

Contributors

Uh oh!

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 726 Commits
1. Two Sum.cpp		1. Two Sum.cpp
10. Regular Expression Matching.cpp		10. Regular Expression Matching.cpp
1002. Find Common Characters.cpp		1002. Find Common Characters.cpp
1007. Minimum Domino Rotations For Equal Row.cpp		1007. Minimum Domino Rotations For Equal Row.cpp
101. Symmetric Tree.cpp		101. Symmetric Tree.cpp
1011. Capacity To Ship Packages Within D Days.cpp		1011. Capacity To Ship Packages Within D Days.cpp
1014. Best Sightseeing Pair.cpp		1014. Best Sightseeing Pair.cpp
102. Binary Tree Level Order Traversal.cpp		102. Binary Tree Level Order Traversal.cpp
1020. Number of Enclaves.cpp		1020. Number of Enclaves.cpp
1025. Divisor Game.cpp		1025. Divisor Game.cpp
1029. Two City Scheduling.cpp		1029. Two City Scheduling.cpp
103. Binary Tree Zigzag Level Order Traversal.cpp		103. Binary Tree Zigzag Level Order Traversal.cpp
104. Maximum Depth of Binary Tree.cpp		104. Maximum Depth of Binary Tree.cpp
1046. Last Stone Weight.cpp		1046. Last Stone Weight.cpp
1047. Remove All Adjacent Duplicates In String.cpp		1047. Remove All Adjacent Duplicates In String.cpp
105. Construct Binary Tree from Preorder and Inorder Traversal.cpp		105. Construct Binary Tree from Preorder and Inorder Traversal.cpp
106. Construct Binary Tree from Inorder and Postorder Traversal.cpp		106. Construct Binary Tree from Inorder and Postorder Traversal.cpp
1061. Lexicographically Smallest Equivalent String.cpp		1061. Lexicographically Smallest Equivalent String.cpp
107. Binary Tree Level Order Traversal II.cpp		107. Binary Tree Level Order Traversal II.cpp
1071. Greatest Common Divisor of Strings.cpp		1071. Greatest Common Divisor of Strings.cpp
1074. Number of Submatrices That Sum to Target.cpp		1074. Number of Submatrices That Sum to Target.cpp
108. Convert Sorted Array to Binary Search Tree.cpp		108. Convert Sorted Array to Binary Search Tree.cpp
109. Convert Sorted List to Binary Search Tree.cpp		109. Convert Sorted List to Binary Search Tree.cpp
1091. Shortest Path in Binary Matrix.cpp		1091. Shortest Path in Binary Matrix.cpp
11. Container With Most Water.cpp		11. Container With Most Water.cpp
111. Minimum Depth of Binary Tree.cpp		111. Minimum Depth of Binary Tree.cpp
112. Path Sum.cpp		112. Path Sum.cpp
1129. Shortest Path with Alternating Colors.cpp		1129. Shortest Path with Alternating Colors.cpp
113. Path Sum II.cpp		113. Path Sum II.cpp
1137. N-th Tribonacci Number.cpp		1137. N-th Tribonacci Number.cpp
1138. Alphabet Board Path.cpp		1138. Alphabet Board Path.cpp
114. Flatten Binary Tree to Linked List.cpp		114. Flatten Binary Tree to Linked List.cpp
1143. Longest Common Subsequence.cpp		1143. Longest Common Subsequence.cpp
1146. Snapshot Array.cpp		1146. Snapshot Array.cpp
115. Distinct Subsequences.cpp		115. Distinct Subsequences.cpp
116. Populating Next Right Pointers in Each Node.cpp		116. Populating Next Right Pointers in Each Node.cpp
1162. As Far from Land as Possible.cpp		1162. As Far from Land as Possible.cpp
117. Populating Next Right Pointers in Each Node II.cpp		117. Populating Next Right Pointers in Each Node II.cpp
118. Pascal's Triangle.cpp		118. Pascal's Triangle.cpp
119. Pascal's Triangle II.cpp		119. Pascal's Triangle II.cpp
12. Integer to Roman.cpp		12. Integer to Roman.cpp
120. Triangle.cpp		120. Triangle.cpp
1209. Remove All Adjacent Duplicates in String II.cpp		1209. Remove All Adjacent Duplicates in String II.cpp
121. Best Time to Buy and Sell Stock.cpp		121. Best Time to Buy and Sell Stock.cpp
122. Best Time to Buy and Sell Stock II.cpp		122. Best Time to Buy and Sell Stock II.cpp
1232. Check If It Is a Straight Line.cpp		1232. Check If It Is a Straight Line.cpp
1235. Maximum Profit in Job Scheduling.cpp		1235. Maximum Profit in Job Scheduling.cpp
1239. Maximum Length of a Concatenated String with Unique Characters.cpp		1239. Maximum Length of a Concatenated String with Unique Characters.cpp
1249. Minimum Remove to Make Valid Parentheses.cpp		1249. Minimum Remove to Make Valid Parentheses.cpp
125. Valid Palindrome.cpp		125. Valid Palindrome.cpp
1254. Number of Closed Islands.cpp		1254. Number of Closed Islands.cpp
1268. Search Suggestions System.cpp		1268. Search Suggestions System.cpp
127. Word Ladder.cpp		127. Word Ladder.cpp
128. Longest Consecutive Sequence.cpp		128. Longest Consecutive Sequence.cpp
1281. Subtract the Product and Sum of Digits of an Integer.cpp		1281. Subtract the Product and Sum of Digits of an Integer.cpp
1283. Find the Smallest Divisor Given a Threshold.cpp		1283. Find the Smallest Divisor Given a Threshold.cpp
1288. Remove Covered Intervals.cpp		1288. Remove Covered Intervals.cpp
129. Sum Root to Leaf Numbers.cpp		129. Sum Root to Leaf Numbers.cpp
1290. Convert Binary Number in a Linked List to Integer.cpp		1290. Convert Binary Number in a Linked List to Integer.cpp
13. Roman to Integer.cpp		13. Roman to Integer.cpp
130. Surrounded Regions.cpp		130. Surrounded Regions.cpp
1302. Deepest Leaves Sum.cpp		1302. Deepest Leaves Sum.cpp
1305. All Elements in Two Binary Search Trees.cpp		1305. All Elements in Two Binary Search Trees.cpp
1306. Jump Game III.cpp		1306. Jump Game III.cpp
1309. Decrypt String from Alphabet to Integer Mapping.cpp		1309. Decrypt String from Alphabet to Integer Mapping.cpp
131. Palindrome Partitioning.cpp		131. Palindrome Partitioning.cpp
1314. Matrix Block Sum.cpp		1314. Matrix Block Sum.cpp
1319. Number of Operations to Make Network Connected.cpp		1319. Number of Operations to Make Network Connected.cpp
132. Palindrome Partitioning II.cpp		132. Palindrome Partitioning II.cpp
1323. Maximum 69 Number.cpp		1323. Maximum 69 Number.cpp
1328. Break a Palindrome.cpp		1328. Break a Palindrome.cpp
1329. Sort the Matrix Diagonally.cpp		1329. Sort the Matrix Diagonally.cpp
133. Clone Graph.cpp		133. Clone Graph.cpp
1332. Remove Palindromic Subsequences.cpp		1332. Remove Palindromic Subsequences.cpp
1337. The K Weakest Rows in a Matrix.cpp		1337. The K Weakest Rows in a Matrix.cpp
134. Gas Station.cpp		134. Gas Station.cpp
1342. Number of Steps to Reduce a Number to Zero.cpp		1342. Number of Steps to Reduce a Number to Zero.cpp
1346. Check If N and Its Double Exist.cpp		1346. Check If N and Its Double Exist.cpp
1347. Minimum Number of Steps to Make Two Strings Anagram.cpp		1347. Minimum Number of Steps to Make Two Strings Anagram.cpp
135. Candy.cpp		135. Candy.cpp
1351. Count Negative Numbers in a Sorted Matrix.cpp		1351. Count Negative Numbers in a Sorted Matrix.cpp
1354. Construct Target Array With Multiple Sums.cpp		1354. Construct Target Array With Multiple Sums.cpp
1356. Sort Integers by The Number of 1 Bits.cpp		1356. Sort Integers by The Number of 1 Bits.cpp
1359. Count All Valid Pickup and Delivery Options.cpp		1359. Count All Valid Pickup and Delivery Options.cpp
136. Single Number.cpp		136. Single Number.cpp
137. Single Number II.cpp		137. Single Number II.cpp
1376. Time Needed to Inform All Employees.cpp		1376. Time Needed to Inform All Employees.cpp
1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree.cpp		1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree.cpp
138. Copy List with Random Pointer.cpp		138. Copy List with Random Pointer.cpp
1383. Maximum Performance of a Team.cpp		1383. Maximum Performance of a Team.cpp
1385. Find the Distance Value Between Two Arrays.cpp		1385. Find the Distance Value Between Two Arrays.cpp
139. Word Break.cpp		139. Word Break.cpp
1392. Longest Happy Prefix.cpp		1392. Longest Happy Prefix.cpp
1396. Design Underground System.cpp		1396. Design Underground System.cpp
14. Longest Common Prefix.cpp		14. Longest Common Prefix.cpp
1402. Reducing Dishes.cpp		1402. Reducing Dishes.cpp
141. Linked List Cycle.cpp		141. Linked List Cycle.cpp
1417. Reformat The String.cpp		1417. Reformat The String.cpp
142. Linked List Cycle II.cpp		142. Linked List Cycle II.cpp
1423. Maximum Points You Can Obtain from Cards.cpp		1423. Maximum Points You Can Obtain from Cards.cpp

Folders and files

Latest commit

History

Repository files navigation

LeetCode

About

Topics

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages