Competitive-Programming

Solution for A2SV programming problems and other leetcode, hackerrank and codeforces problems. Solutions and exercises from Neetcode.io.

LeetCode Profile

https://leetcode.com/destifo/

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Competitive-Programming

LeetCode Profile

About

Uh oh!

Releases

Packages

Uh oh!

Contributors

Uh oh!

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 1,233 Commits
1. Two Sum		1. Two Sum
10. Regular Expression Matching		10. Regular Expression Matching
1000. Minimum Cost to Merge Stones		1000. Minimum Cost to Merge Stones
1004. Max Consecutive Ones III		1004. Max Consecutive Ones III
1006. Clumsy Factorial		1006. Clumsy Factorial
1009. Complement of Base 10 Integer		1009. Complement of Base 10 Integer
101. Symmetric Tree		101. Symmetric Tree
1010. Pairs of Songs With Total Durations Divisible by 60		1010. Pairs of Songs With Total Durations Divisible by 60
1011. Capacity To Ship Packages Within D Days		1011. Capacity To Ship Packages Within D Days
1019. Next Greater Node In Linked List		1019. Next Greater Node In Linked List
1020. Number of Enclaves		1020. Number of Enclaves
1024. Video Stitching		1024. Video Stitching
1025. Divisor Game		1025. Divisor Game
1026. Maximum Difference Between Node and Ancestor		1026. Maximum Difference Between Node and Ancestor
1027. Longest Arithmetic Subsequence		1027. Longest Arithmetic Subsequence
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
1031. Maximum Sum of Two Non-Overlapping Subarrays		1031. Maximum Sum of Two Non-Overlapping Subarrays
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
1041. Robot Bounded In Circle		1041. Robot Bounded In Circle
1046. Last Stone Weight		1046. Last Stone Weight
1048. Longest String Chain		1048. Longest String Chain
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
1050. Actors and Directors Who Cooperated At Least Three Times		1050. Actors and Directors Who Cooperated At Least Three Times
106. Construct Binary Tree from Inorder and Postorder Traversal		106. Construct Binary Tree from Inorder and Postorder Traversal
1061. Lexicographically Smallest Equivalent String		1061. Lexicographically Smallest Equivalent String
1071. Greatest Common Divisor of Strings		1071. Greatest Common Divisor of Strings
1074. Number of Submatrices That Sum to Target		1074. Number of Submatrices That Sum to Target
1081. Smallest Subsequence of Distinct Characters		1081. Smallest Subsequence of Distinct Characters
109. Convert Sorted List to Binary Search Tree		109. Convert Sorted List to Binary Search Tree
1090. Largest Values From Labels		1090. Largest Values From Labels
1091. Shortest Path in Binary Matrix		1091. Shortest Path in Binary Matrix
1094. Car Pooling		1094. Car Pooling
11. Container With Most Water		11. Container With Most Water
110. Balanced Binary Tree		110. Balanced Binary Tree
1105. Filling Bookcase Shelves		1105. Filling Bookcase Shelves
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
1137. N-th Tribonacci Number		1137. N-th Tribonacci Number
114. Flatten Binary Tree to Linked List		114. Flatten Binary Tree to Linked List
1140. Stone Game II		1140. Stone Game II
1143. Longest Common Subsequence		1143. Longest Common Subsequence
1145. Binary Tree Coloring Game		1145. Binary Tree Coloring Game
1146. Snapshot Array		1146. Snapshot Array
1148. Article Views I		1148. Article Views I
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
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
1162. As Far from Land as Possible		1162. As Far from Land as Possible
1169. Invalid Transactions		1169. Invalid Transactions
117. Populating Next Right Pointers in Each Node II		117. Populating Next Right Pointers in Each Node II
1171. Remove Zero Sum Consecutive Nodes from Linked List		1171. Remove Zero Sum Consecutive Nodes from Linked List
1172. Dinner Plate Stacks		1172. Dinner Plate Stacks
1173. Immediate Food Delivery I		1173. Immediate Food Delivery I
1177. Can Make Palindrome from Substring		1177. Can Make Palindrome from Substring
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
120. Triangle		120. Triangle
1200. Minimum Absolute Difference		1200. Minimum Absolute Difference
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
1218. Longest Arithmetic Subsequence of Given Difference		1218. Longest Arithmetic Subsequence of Given Difference
122. Best Time to Buy and Sell Stock II		122. Best Time to Buy and Sell Stock II
1220. Count Vowels Permutation		1220. Count Vowels Permutation
1222. Queens That Can Attack the King		1222. Queens That Can Attack the King
123. Best Time to Buy and Sell Stock III		123. Best Time to Buy and Sell Stock III
1232. Check If It Is a Straight Line		1232. Check If It Is a Straight Line
1237. Find Positive Integer Solution for a Given Equation		1237. Find Positive Integer Solution for a Given Equation
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
1247. Minimum Swaps to Make Strings Equal		1247. Minimum Swaps to Make Strings Equal
1248. Count Number of Nice Subarrays		1248. Count Number of Nice Subarrays
1249. Minimum Remove to Make Valid Parentheses		1249. Minimum Remove to Make Valid Parentheses
125. Valid Palindrome		125. Valid Palindrome
1254. Number of Closed Islands		1254. Number of Closed Islands
1255. Maximum Score Words Formed by Letters		1255. Maximum Score Words Formed by Letters
126. Word Ladder II		126. Word Ladder II
1260. Shift 2D Grid		1260. Shift 2D Grid
1266. Minimum Time Visiting All Points		1266. Minimum Time Visiting All Points
127. Word Ladder		127. Word Ladder
1275. Find Winner on a Tic Tac Toe Game		1275. Find Winner on a Tic Tac Toe Game
128. Longest Consecutive Sequence		128. Longest Consecutive Sequence
1280. Students and Examinations		1280. Students and Examinations
1282. Group the People Given the Group Size They Belong To		1282. Group the People Given the Group Size They Belong To
1283. Find the Smallest Divisor Given a Threshold		1283. Find the Smallest Divisor Given a Threshold
1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix		1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix
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

Folders and files

Latest commit

History

Repository files navigation

Competitive-Programming

LeetCode Profile

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages