Leet Code

Here, I will be updating the Leet Code Questions I Solved. The answers will be correct but it may not always have the best runtime and memory usage. Bear with me.

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Leet Code

🧑‍💻 Leetcode Stats

About

Releases

Packages

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 663 Commits
1. Two Sum		1. Two Sum
100. Same Tree		100. Same Tree
1002. Find Common Characters		1002. Find Common Characters
1003. Check If Word Is Valid After Substitutions		1003. Check If Word Is Valid After Substitutions
1008. Construct Binary Search Tree from Preorder Traversal		1008. Construct Binary Search Tree from Preorder Traversal
101. Symmetric Tree		101. Symmetric Tree
1016. Binary String With Substrings Representing 1 To N		1016. Binary String With Substrings Representing 1 To N
102. Binary Tree Level Order Traversal		102. Binary Tree Level Order Traversal
1021. Remove Outermost Parentheses		1021. Remove Outermost Parentheses
1022. Sum of Root To Leaf Binary Numbers		1022. Sum of Root To Leaf Binary Numbers
1025. Divisor Game		1025. Divisor Game
1026. Maximum Difference Between Node and Ancestor		1026. Maximum Difference Between Node and Ancestor
1028. Recover a Tree From Preorder Traversal		1028. Recover a Tree From Preorder Traversal
103. Binary Tree Zigzag Level Order Traversal		103. Binary Tree Zigzag Level Order Traversal
1038. Binary Search Tree to Greater Sum Tree		1038. Binary Search Tree to Greater Sum Tree
104. Maximum Depth of Binary Tree		104. Maximum Depth of Binary Tree
1047. Remove All Adjacent Duplicates In String		1047. Remove All Adjacent Duplicates In String
1051. Height Checker		1051. Height Checker
106. Construct Binary Tree from Inorder and Postorder Traversal		106. Construct Binary Tree from Inorder and Postorder Traversal
107. Binary Tree Level Order Traversal II		107. Binary Tree Level Order Traversal II
1078. Occurrences After Bigram		1078. Occurrences After Bigram
1079. Letter Tile Possibilities		1079. Letter Tile Possibilities
1089. Duplicate Zeros		1089. Duplicate Zeros
110. Balanced Binary Tree		110. Balanced Binary Tree
1103. Distribute Candies to People		1103. Distribute Candies to People
1108. Defanging an IP Address		1108. Defanging an IP Address
111. Minimum Depth of Binary Tree		111. Minimum Depth of Binary Tree
1110. Delete Nodes And Return Forest		1110. Delete Nodes And Return Forest
112. Path Sum		112. Path Sum
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
116. Populating Next Right Pointers in Each Node		116. Populating Next Right Pointers in Each Node
1160. Find Words That Can Be Formed by Characters		1160. Find Words That Can Be Formed by Characters
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
1170. Compare Strings by Frequency of the Smallest Character		1170. Compare Strings by Frequency of the Smallest Character
118. Pascal's Triangle		118. Pascal's Triangle
1189. Maximum Number of Balloons		1189. Maximum Number of Balloons
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
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
1221. Split a String in Balanced Strings		1221. Split a String in Balanced Strings
1232. Check If It Is a Straight Line		1232. Check If It Is a Straight Line
1233. Remove Sub-Folders from the Filesystem		1233. Remove Sub-Folders from the Filesystem
1249. Minimum Remove to Make Valid Parentheses		1249. Minimum Remove to Make Valid Parentheses
125. Valid Palindrome		125. Valid Palindrome
1261. Find Elements in a Contaminated Binary Tree		1261. Find Elements in a Contaminated Binary Tree
1281. Subtract the Product and Sum of Digits of an Integer		1281. Subtract the Product and Sum of Digits of an Integer
1282. Group the People Given the Group Size They Belong To		1282. Group the People Given the Group Size They Belong To
1287. Element Appearing More Than 25% In Sorted Array		1287. Element Appearing More Than 25% In Sorted Array
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
1291. Sequential Digits		1291. Sequential Digits
1295. Find Number with Even Number of DIgits		1295. Find Number with Even Number of DIgits
1296. Divide Array in Sets of K Consecutive Numbers		1296. Divide Array in Sets of K Consecutive Numbers
1299. Replace Elements with Greatest Element on Right Side		1299. Replace Elements with Greatest Element on Right Side
13. Roman to Integer		13. Roman to Integer
1302. Deepest Leaves Sum		1302. Deepest Leaves Sum
1304. Find N Unique Integers Sum up to Zero		1304. Find N Unique Integers Sum up to Zero
1305. All Elements in Two Binary Search Trees		1305. All Elements in Two Binary Search Trees
1309. Decrypt String from Alphabet to Integer Mapping		1309. Decrypt String from Alphabet to Integer Mapping
1313. Decompress Run-Length Encoded List		1313. Decompress Run-Length Encoded List
1315. Sum of Nodes with Even-Valued Grandparent		1315. Sum of Nodes with Even-Valued Grandparent
1318. Minimum Flips to Make a OR b Equal to c		1318. Minimum Flips to Make a OR b Equal to c
1323. Maximum 69 Number		1323. Maximum 69 Number
1324. Print Words Vertically		1324. Print Words Vertically
1325. Delete Leaves With a Given Value		1325. Delete Leaves With a Given Value
1328. Break a Palindrome		1328. Break a Palindrome
1329. Sort the Matrix Diagonally		1329. Sort the Matrix Diagonally
133. Clone Graph		133. Clone Graph
1331. Rank Transform of an Array		1331. Rank Transform of an Array
1338. Reduce Array Size to The Half		1338. Reduce Array Size to The Half
1342. Number of Steps to Reduce a Number to Zero		1342. Number of Steps to Reduce a Number to Zero
1347. Minimum Number of Steps to Make Two Strings Anagram		1347. Minimum Number of Steps to Make Two Strings Anagram
1351. Count Negative Numbers in a Sorted Matrix		1351. Count Negative Numbers in a Sorted Matrix
1356. Sort Integers by The Number of 1 Bits		1356. Sort Integers by The Number of 1 Bits
1357. Apply Discount Every n Orders		1357. Apply Discount Every n Orders
136. Single Number		136. Single Number
1365. How Many Numbers Are Smaller Than the Current Number		1365. How Many Numbers Are Smaller Than the Current Number
137. Single Number II		137. Single Number II
1370. Increasing Decreasing String		1370. Increasing Decreasing String
1374. Generate a String With Characters That Have Odd Counts		1374. Generate a String With Characters That Have Odd Counts
1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree		1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree
1381. Design a Stack With Increment Operation		1381. Design a Stack With Increment Operation
1389. Create Target Array in the Given Order		1389. Create Target Array in the Given Order
1394. Find Lucky Integer in an Array		1394. Find Lucky Integer in an Array
14. Longest Common Prefix		14. Longest Common Prefix
1404. Number of Steps to Reduce a Number in Binary Representation to One		1404. Number of Steps to Reduce a Number in Binary Representation to One
1408. String Matching in an Array		1408. String Matching in an Array
141. Linked List Cycle		141. Linked List Cycle
1413. Minimum Value to Get Positive Step by Step Sum		1413. Minimum Value to Get Positive Step by Step Sum
1415. The k-th Lexicographical String of All Happy Strings of Length n		1415. The k-th Lexicographical String of All Happy Strings of Length n
142. Linked List Cycle II		142. Linked List Cycle II
1422. Maximum Score After Splitting a String		1422. Maximum Score After Splitting a String
1424. Diagonal Traverse II		1424. Diagonal Traverse II
143. Reorder List		143. Reorder List

License

VishalTheHuman/Leet-Code

Folders and files

Latest commit

History

Repository files navigation

Leet Code

🧑‍💻 Leetcode Stats

About

Topics

Resources

License

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages