GitHub - Yashmenaria1/Leetcode_daily_solutions: LeetCode Daily Questions Solution

Branches Tags

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

About

Releases

Packages

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 412 Commits
1. Two Sum.cpp		1. Two Sum.cpp
100. Same Tree.cpp		100. Same Tree.cpp
1002. Find Common Characters.cpp		1002. Find Common Characters.cpp
1026. Maximum Difference Between Node and Ancestor.cpp		1026. Maximum Difference Between Node and Ancestor.cpp
1027. Longest Arithmetic Subsequence.cpp		1027. Longest Arithmetic Subsequence.cpp
1035. Uncrossed Lines.cpp		1035. Uncrossed Lines.cpp
1043. Partition Array for Maximum Sum.cpp		1043. Partition Array for Maximum Sum.cpp
1048. Longest String Chain.cpp		1048. Longest String Chain.cpp
1051. Height Checker.cpp		1051. Height Checker.cpp
1074. Number of Submatrices That Sum to Target.cpp		1074. Number of Submatrices That Sum to Target.cpp
1081. Smallest Subsequence of Distinct Characters.cpp		1081. Smallest Subsequence of Distinct Characters.cpp
1091. Shortest Path in Binary Matrix.cpp		1091. Shortest Path in Binary Matrix.cpp
1095. Find in Mountain Array.cpp		1095. Find in Mountain Array.cpp
111. Minimum Depth of Binary Tree.cpp		111. Minimum Depth of Binary Tree.cpp
112. Path Sum.cpp		112. Path Sum.cpp
1122. Relative Sort Array.cpp		1122. Relative Sort Array.cpp
1125. Smallest Sufficient Team.cpp		1125. Smallest Sufficient Team.cpp
1137. N-th Tribonacci Number.cpp		1137. N-th Tribonacci Number.cpp
1140. Stone Game II.cpp		1140. Stone Game II.cpp
1143. Longest Common Subsequence.cpp		1143. Longest Common Subsequence.cpp
1146. Snapshot Array.cpp		1146. Snapshot Array.cpp
1155. Number of Dice Rolls With Target Sum.cpp		1155. Number of Dice Rolls With Target Sum.cpp
1160. Find Words That Can Be Formed by Characters.cpp		1160. Find Words That Can Be Formed by Characters.cpp
1161. Maximum Level Sum of a Binary Tree.cpp		1161. Maximum Level Sum of a Binary Tree.cpp
1171. Remove Zero Sum Consecutive Nodes from Linked List.cpp		1171. Remove Zero Sum Consecutive Nodes from Linked List.cpp
118. Pascal's Triangle.cpp		118. Pascal's Triangle.cpp
1187. Make Array Strictly Increasing.cpp		1187. Make Array Strictly Increasing.cpp
119. Pascal's Triangle II.cpp		119. Pascal's Triangle II.cpp
1203. Sort Items by Groups Respecting Dependencies.cpp		1203. Sort Items by Groups Respecting Dependencies.cpp
1207. Unique Number of Occurrences.cpp		1207. Unique Number of Occurrences.cpp
1208. Get Equal Substrings Within Budget.cpp		1208. Get Equal Substrings Within Budget.cpp
1219. Path with Maximum Gold.cpp		1219. Path with Maximum Gold.cpp
1220. Count Vowels Permutation.cpp		1220. Count Vowels Permutation.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
1255. Maximum Score Words Formed by Letters.cpp		1255. Maximum Score Words Formed by Letters.cpp
1266. Minimum Time Visiting All Points.cpp		1266. Minimum Time Visiting All Points.cpp
1269. Number of Ways to Stay in the Same Place After Some Steps.cpp		1269. Number of Ways to Stay in the Same Place After Some Steps.cpp
1282. Group the People Given the Group Size They Belong To.cpp		1282. Group the People Given the Group Size They Belong To.cpp
1287. Element Appearing More Than 25% In Sorted Array.cpp		1287. Element Appearing More Than 25% In Sorted Array.cpp
1289. Minimum Falling Path Sum II.cpp		1289. Minimum Falling Path Sum II.cpp
129. Sum Root to Leaf Numbers.cpp		129. Sum Root to Leaf Numbers.cpp
1291. Sequential Digits.cpp		1291. Sequential Digits.cpp
131. Palindrome Partitioning.cpp		131. Palindrome Partitioning.cpp
1318. Minimum Flips to Make a OR b Equal to c.cpp		1318. Minimum Flips to Make a OR b Equal to c.cpp
1325. Delete Leaves With a Given Value.cpp		1325. Delete Leaves With a Given Value.cpp
1326. Minimum Number of Taps to Open to Water a Garden.cpp		1326. Minimum Number of Taps to Open to Water a Garden.cpp
1335. Minimum Difficulty of a Job Schedule.cpp		1335. Minimum Difficulty of a Job Schedule.cpp
1337. The K Weakest Rows in a Matrix.cpp		1337. The K Weakest Rows in a Matrix.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
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
1361. Validate Binary Tree Nodes.cpp		1361. Validate Binary Tree Nodes.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
138. Copy List with Random Pointer.cpp		138. Copy List with Random Pointer.cpp
139. Word Break.cpp		139. Word Break.cpp
1396. Design Underground System.cpp		1396. Design Underground System.cpp
140. Word Break II.cpp		140. Word Break II.cpp
1404. Number of Steps to Reduce a Number in Binary Representation to One.cpp		1404. Number of Steps to Reduce a Number in Binary Representation to One.cpp
1406. Stone Game III.cpp		1406. Stone Game III.cpp
141. Linked List Cycle.cpp		141. Linked List Cycle.cpp
141. Linked List Cycle1.cpp		141. Linked List Cycle1.cpp
1420. Build Array Where You Can Find The Maximum Exactly K Comparisons.cpp		1420. Build Array Where You Can Find The Maximum Exactly K Comparisons.cpp
1422. Maximum Score After Splitting a String.cpp		1422. Maximum Score After Splitting a String.cpp
1424. Diagonal Traverse II.cpp		1424. Diagonal Traverse II.cpp
1425. Constrained Subsequence Sum.cpp		1425. Constrained Subsequence Sum.cpp
143. Reorder List.cpp		143. Reorder List.cpp
1436. Destination City.cpp		1436. Destination City.cpp
1441. Build an Array With Stack Operations.cpp		1441. Build an Array With Stack Operations.cpp
1442. Count Triplets That Can Form Two Arrays of Equal XOR.cpp		1442. Count Triplets That Can Form Two Arrays of Equal XOR.cpp
1457. Pseudo-Palindromic Paths in a Binary Tree.cpp		1457. Pseudo-Palindromic Paths in a Binary Tree.cpp
1458. Max Dot Product of Two Subsequences.cpp		1458. Max Dot Product of Two Subsequences.cpp
146. LRU Cache.cpp		146. LRU Cache.cpp
1463. Cherry Pickup II.cpp		1463. Cherry Pickup II.cpp
1464. Maximum Product of Two Elements in an Array.cpp		1464. Maximum Product of Two Elements in an Array.cpp
1481. Least Number of Unique Integers after K Removals.cpp		1481. Least Number of Unique Integers after K Removals.cpp
1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree.cpp		1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree.cpp
1493. Longest Subarray of 1's After Deleting One Element.cpp		1493. Longest Subarray of 1's After Deleting One Element.cpp
1496. Path Crossing.cpp		1496. Path Crossing.cpp
150. Evaluate Reverse Polish Notation.cpp		150. Evaluate Reverse Polish Notation.cpp
1502. Can Make Arithmetic Progression From Sequence.cpp		1502. Can Make Arithmetic Progression From Sequence.cpp
1503. Last Moment Before All Ants Fall Out of a Plank.cpp		1503. Last Moment Before All Ants Fall Out of a Plank.cpp
1512. Number of Good Pairs.cpp		1512. Number of Good Pairs.cpp
1514. Path with Maximum Probability.cpp		1514. Path with Maximum Probability.cpp
1531. String Compression II.cpp		1531. String Compression II.cpp
1535. Find the Winner of an Array Game.cpp		1535. Find the Winner of an Array Game.cpp
1544. Make The String Great.cpp		1544. Make The String Great.cpp
1547. Minimum Cost to Cut a Stick.cpp		1547. Minimum Cost to Cut a Stick.cpp
1557. Minimum Number of Vertices to Reach All Nodes.cpp		1557. Minimum Number of Vertices to Reach All Nodes.cpp
1561. Maximum Number of Coins You Can Get.cpp		1561. Maximum Number of Coins You Can Get.cpp
1569. Number of Ways to Reorder Array to Get Same BST.cpp		1569. Number of Ways to Reorder Array to Get Same BST.cpp
1575. Count All Possible Routes.cpp		1575. Count All Possible Routes.cpp
1578. Minimum Time to Make Rope Colorful.cpp		1578. Minimum Time to Make Rope Colorful.cpp
1582. Special Positions in a Binary Matrix.cpp		1582. Special Positions in a Binary Matrix.cpp
1584. Min Cost to Connect All Points.cpp		1584. Min Cost to Connect All Points.cpp

Yashmenaria1/Leetcode_daily_solutions

Folders and files

Latest commit

History

About

Topics

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages