GitHub - PrakNew/LeetCode-Solutions: These are the Leetcode solutions which are solved by me

Branches Tags

About

These are the Leetcode solutions which are solved by me

Activity

0 stars

1 watching

0 forks

Report repository

Releases

No releases published

Packages

No packages published

Name		Name	Last commit message	Last commit date
Latest commit History 104 Commits
.vscode		.vscode
0 More Problems		0 More Problems
1. Two Sum		1. Two Sum
100. Same Tree		100. Same Tree
1002. Find Common Characters		1002. Find Common Characters
1007. Minimum Domino Rotations For Equal Row		1007. Minimum Domino Rotations For Equal Row
1008. Construct Binary Search Tree from Preorder Traversal		1008. Construct Binary Search Tree from Preorder Traversal
1009. Complement of Base 10 Integer		1009. Complement of Base 10 Integer
101. Symmetric Tree		101. Symmetric Tree
102. Binary Tree Level Order Traversal		102. Binary Tree Level Order Traversal
1026. Maximum Difference Between Node and Ancestor		1026. Maximum Difference Between Node and Ancestor
1027. Longest Arithmetic Sequence		1027. Longest Arithmetic Sequence
1029. Two City Scheduling		1029. Two City Scheduling
103. Binary Tree Zigzag Level Order Traversal		103. Binary Tree Zigzag Level Order Traversal
1035. Uncrossed Lines		1035. Uncrossed Lines
104. Maximum Depth of Binary Tree		104. Maximum Depth of Binary Tree
1041. Robot Bounded In Circle		1041. Robot Bounded In Circle
1042. Flower Planting With No Adjacent		1042. Flower Planting With No Adjacent
1046. Last Stone Weight		1046. Last Stone Weight
1049. Last Stone Weight II		1049. Last Stone Weight II
105. Construct Binary Tree from Preorder and Inorder Traversal		105. Construct Binary Tree from Preorder and Inorder Traversal
1059. All Paths from Source Lead to Destination		1059. All Paths from Source Lead to Destination
106. Construct Binary Tree from Inorder and Postorder Traversal		106. Construct Binary Tree from Inorder and Postorder Traversal
1060. Missing Element in Sorted Array		1060. Missing Element in Sorted Array
1061. Lexicographically Smallest Equivalent String		1061. Lexicographically Smallest Equivalent String
107. Binary Tree Level Order Traversal II		107. Binary Tree Level Order Traversal II
1074. Number of Submatrices That Sum to Target		1074. Number of Submatrices That Sum to Target
1079. Letter Tile Possibilities		1079. Letter Tile Possibilities
108. Convert Sorted Array to Binary Search Tree		108. Convert Sorted Array to Binary Search Tree
1081. Smallest Subsequence of Distinct Characters		1081. Smallest Subsequence of Distinct Characters
1094. Car Pooling		1094. Car Pooling
1099. Two Sum Less Than K		1099. Two Sum Less Than K
11. Container With Most Water		11. Container With Most Water
1102. Path With Maximum Minimum Value		1102. Path With Maximum Minimum Value
1103. Distribute Candies to People		1103. Distribute Candies to People
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
1123. Lowest Common Ancestor of Deepest Leaves		1123. Lowest Common Ancestor of Deepest Leaves
1129. Shortest Path with Alternating Colors		1129. Shortest Path with Alternating Colors
113. Path Sum II		113. Path Sum II
1136. Parallel Courses		1136. Parallel Courses
114. Flatten Binary Tree to Linked List		114. Flatten Binary Tree to Linked List
1143. Longest Common Subsequence		1143. Longest Common Subsequence
1150. Check If a Number Is Majority Element in a Sorted Array		1150. Check If a Number Is Majority Element in a Sorted Array
1153. String Transforms Into Another String		1153. String Transforms Into Another String
1155. Number of Dice Rolls With Target Sum		1155. Number of Dice Rolls With Target Sum
116. Populating Next Right Pointers in Each Node		116. Populating Next Right Pointers in Each Node
1162. As Far from Land as Possible		1162. As Far from Land as Possible
1189. Maximum Number of Balloons		1189. Maximum Number of Balloons
1192. Critical Connections in a Network		1192. Critical Connections in a Network
1197. Minimum Knight Moves		1197. Minimum Knight Moves
12. Integer to Roman		12. Integer to Roman
120. Triangle		120. Triangle
1201. Ugly Number III		1201. Ugly Number III
1202. Smallest String With Swaps		1202. Smallest String With Swaps
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
1213. Intersection of Three Sorted Arrays		1213. Intersection of Three Sorted Arrays
1214. Two Sum BSTs		1214. Two Sum BSTs
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
1235. Maximum Profit in Job Scheduling		1235. Maximum Profit in Job Scheduling
1239. Maximum Length of a Concatenated String with Unique Characters		1239. Maximum Length of a Concatenated String with Unique Characters
124. Binary Tree Maximum Path Sum		124. Binary Tree Maximum Path Sum
125. Valid Palindrome		125. Valid Palindrome
126. Word Ladder II		126. Word Ladder II
127. Word Ladder		127. Word Ladder
1277. Count Square Submatrices with All Ones		1277. Count Square Submatrices with All Ones
128. Longest Consecutive Sequence		128. Longest Consecutive Sequence
1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix		1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix
1288. Remove Covered Intervals		1288. Remove Covered Intervals
1289. Minimum Falling Path Sum II		1289. Minimum Falling Path Sum II
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
1293. Shortest Path in a Grid with Obstacles Elimination		1293. Shortest Path in a Grid with Obstacles Elimination
1295. Find Numbers with Even Number of Digits		1295. Find Numbers 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
130. Surrounded Regions		130. Surrounded Regions
1310. XOR Queries of a Subarray		1310. XOR Queries of a Subarray
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
1328. Break a Palindrome		1328. Break a Palindrome
1329. Sort the Matrix Diagonally		1329. Sort the Matrix Diagonally
133. Clone Graph		133. Clone Graph
1335. Minimum Difficulty of a Job Schedule		1335. Minimum Difficulty of a Job Schedule
134. Gas Station		134. Gas Station
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
136. Single Number		136. Single Number
137. Single Number II		137. Single Number II
1376. Time Needed to Inform All Employees		1376. Time Needed to Inform All Employees
138. Copy List with Random Pointer		138. Copy List with Random Pointer
1382. Balance a Binary Search Tree		1382. Balance a Binary Search Tree
1385. Find the Distance Value Between Two Arrays		1385. Find the Distance Value Between Two Arrays
1387. Sort Integers by The Power Value		1387. Sort Integers by The Power Value
1388. Pizza with 3n slices		1388. Pizza with 3n slices
1389. Create Target Array in the Given Order		1389. Create Target Array in the Given Order
139. Word Break		139. Word Break

PrakNew/LeetCode-Solutions

Folders and files

Latest commit

History