Skip to content

balwierz/LeetCode

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

760 Commits
1 two sum.cpp
1 two sum.cpp
 
 
100 Same Tree.py
100 Same Tree.py
 
 
100 same tree.py
100 same tree.py
 
 
101 Symmetric Tree.py
101 Symmetric Tree.py
 
 
1011 Capacity To Ship Packages Within D Days.py
1011 Capacity To Ship Packages Within D Days.py
 
 
102 binary tree level order traversal.cpp
102 binary tree level order traversal.cpp
 
 
1020 Number of Enclaves.py
1020 Number of Enclaves.py
 
 
1026 Maximum Difference Between Node and Ancestor.py
1026 Maximum Difference Between Node and Ancestor.py
 
 
1027 Longest Arithmetic Subsequence.py
1027 Longest Arithmetic Subsequence.py
 
 
1028 Recover a Tree From Preorder Traversal.py
1028 Recover a Tree From Preorder Traversal.py
 
 
103 binary tree zigzag level order traversal.cpp
103 binary tree zigzag level order traversal.cpp
 
 
1035 Uncrossed Lines.py
1035 Uncrossed Lines.py
 
 
1037 Valid Boomerang. sinuspy
1037 Valid Boomerang. sinuspy
 
 
1038 Binary Search Tree to Greater Sum Tree.py
1038 Binary Search Tree to Greater Sum Tree.py
 
 
104 Maximum Depth of Binary Tree.py
104 Maximum Depth of Binary Tree.py
 
 
1043 Partition Array for Maximum Sum.py
1043 Partition Array for Maximum Sum.py
 
 
1046 Last Stone Weight (maxheap implementation).py
1046 Last Stone Weight (maxheap implementation).py
 
 
1047 Remove All Adjacent Duplicates In String.py
1047 Remove All Adjacent Duplicates In String.py
 
 
1048 Longest String Chain.py
1048 Longest String Chain.py
 
 
105 create tree from preorder and inorder traversal.cpp
105 create tree from preorder and inorder traversal.cpp
 
 
1052 Grumpy Bookstore Owner.py
1052 Grumpy Bookstore Owner.py
 
 
106 Construct Binary Tree from Inorder and Postorder Traversal.py
106 Construct Binary Tree from Inorder and Postorder Traversal.py
 
 
1061 Lexicographically Smallest Equivalent String.py
1061 Lexicographically Smallest Equivalent String.py
 
 
107 binary tree level order traversal 2.cpp
107 binary tree level order traversal 2.cpp
 
 
1070 Product Sales Analysis III.py
1070 Product Sales Analysis III.py
 
 
1074 number of submatrices that sum to target.cpp
1074 number of submatrices that sum to target.cpp
 
 
1075 Project Employees I.py
1075 Project Employees I.py
 
 
108 convert sorted array to BST.cpp
108 convert sorted array to BST.cpp
 
 
109 Convert Sorted List to Binary Search Tree.py
109 Convert Sorted List to Binary Search Tree.py
 
 
1091 shortest path in binary matrix.cpp
1091 shortest path in binary matrix.cpp
 
 
1095 Find in Mountain Array.py
1095 Find in Mountain Array.py
 
 
11 container with most water.cpp
11 container with most water.cpp
 
 
1110 delete nodes and return forest.py
1110 delete nodes and return forest.py
 
 
112 path sum.py
112 path sum.py
 
 
1129 Shortest Path with Alternating Colors.py
1129 Shortest Path with Alternating Colors.py
 
 
113 path sum 2.py
113 path sum 2.py
 
 
114 flatten binary tree to linked list.cpp
114 flatten binary tree to linked list.cpp
 
 
1140 Stone Game II.py
1140 Stone Game II.py
 
 
1143 Longest Common Subsequence.py
1143 Longest Common Subsequence.py
 
 
1146 Snapshot Array.py
1146 Snapshot Array.py
 
 
1155 number of dice rolls with target sum.py
1155 number of dice rolls with target sum.py
 
 
116 populating next right pointers in each node.cpp
116 populating next right pointers in each node.cpp
 
 
1160 Find Words That Can Be Formed by Characters.py
1160 Find Words That Can Be Formed by Characters.py
 
 
1161 Maximum Level Sum of a Binary Tree.py
1161 Maximum Level Sum of a Binary Tree.py
 
 
1162 As Far from Land as Possible.cpp
1162 As Far from Land as Possible.cpp
 
 
1171 Remove Zero Sum Consecutive Nodes from Linked List.py
1171 Remove Zero Sum Consecutive Nodes from Linked List.py
 
 
118 pascals triangle.cpp
118 pascals triangle.cpp
 
 
1207 Unique Number of Occurrences.py
1207 Unique Number of Occurrences.py
 
 
1208 Get Equal Substrings Within Budget.py
1208 Get Equal Substrings Within Budget.py
 
 
121 Best Time to Buy and Sell Stock.py
121 Best Time to Buy and Sell Stock.py
 
 
1218 Longest Arithmetic Subsequence of Given Difference.py
1218 Longest Arithmetic Subsequence of Given Difference.py
 
 
1220 count vowel permutations.cpp
1220 count vowel permutations.cpp
 
 
1232 Check If It Is a Straight Line.py
1232 Check If It Is a Straight Line.py
 
 
1235 Maximum Profit in Job Scheduling.cpp
1235 Maximum Profit in Job Scheduling.cpp
 
 
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.py
124 Binary Tree Maximum Path Sum.py
 
 
1248 Count Number of Nice Subarrays.py
1248 Count Number of Nice Subarrays.py
 
 
1249 Minimum Remove to Make Valid Parentheses.py
1249 Minimum Remove to Make Valid Parentheses.py
 
 
1254 Number of Closed Islands.py
1254 Number of Closed Islands.py
 
 
126 word ladder 2.cpp
126 word ladder 2.cpp
 
 
1266 Minimum Time Visiting All Points.py
1266 Minimum Time Visiting All Points.py
 
 
1269 Number of Ways to Stay in the Same Place After Some Steps.py
1269 Number of Ways to Stay in the Same Place After Some Steps.py
 
 
1282 Group the People Given the Group Size They Belong To.py
1282 Group the People Given the Group Size They Belong To.py
 
 
1289 Minimum Falling Path Sum II.py
1289 Minimum Falling Path Sum II.py
 
 
129 Sum Root to Leaf Numbers.py
129 Sum Root to Leaf Numbers.py
 
 
1291 Sequential Digits.py
1291 Sequential Digits.py
 
 
1293 Shortest Path in a Grid with Obstacles Elimination.cpp
1293 Shortest Path in a Grid with Obstacles Elimination.cpp
 
 
13 roman to integer.py
13 roman to integer.py
 
 
130 surrounded regions.py
130 surrounded regions.py
 
 
131 Palindrome Partitioning.py
131 Palindrome Partitioning.py
 
 
1318 Minimum Flips to Make a OR b Equal to c.py
1318 Minimum Flips to Make a OR b Equal to c.py
 
 
1319 Number of Operations to Make Network Connected.py
1319 Number of Operations to Make Network Connected.py
 
 
1323 Maximum 69 Number.py
1323 Maximum 69 Number.py
 
 
1328 break a palindrome.py
1328 break a palindrome.py
 
 
1329 sort the matrix diagonally.cpp
1329 sort the matrix diagonally.cpp
 
 
1331 rank transform of an array.cpp
1331 rank transform of an array.cpp
 
 
1338 reduce aray size to the half.py
1338 reduce aray size to the half.py
 
 
1339 Maximum Product of Splitted Binary Tree.py
1339 Maximum Product of Splitted Binary Tree.py
 
 
1345 Jump Game IV.py
1345 Jump Game IV.py
 
 
1347 Minimum Number of Steps to Make Two Strings Anagram.py
1347 Minimum Number of Steps to Make Two Strings Anagram.py
 
 
1358 number of substrings containing all 3 letters.cpp
1358 number of substrings containing all 3 letters.cpp
 
 
1359 Count All Valid Pickup and Delivery Options.py
1359 Count All Valid Pickup and Delivery Options.py
 
 
1361 Validate Binary Tree Nodes.py
1361 Validate Binary Tree Nodes.py
 
 
1372 Longest ZigZag Path in a Binary Tree.py
1372 Longest ZigZag Path in a Binary Tree.py
 
 
1376 Time Needed to Inform All Employees.py
1376 Time Needed to Inform All Employees.py
 
 
1383 maximum performance of a team.cpp
1383 maximum performance of a team.cpp
 
 
139 Word Break.py
139 Word Break.py
 
 
1396 Design Underground System.py
1396 Design Underground System.py
 
 
14 Longest Common Prefix.py
14 Longest Common Prefix.py
 
 
1402 Reducing Dishes.py
1402 Reducing Dishes.py
 
 
1406 Stone Game III.py
1406 Stone Game III.py
 
 
1416 Restore The Array.py
1416 Restore The Array.py
 
 
142 Linked List Cycle II (floyd algorithm for loop detection).py
142 Linked List Cycle II (floyd algorithm for loop detection).py
 
 
1420 Build Array Where You Can Find The Maximum Exactly K Comparisons.py
1420 Build Array Where You Can Find The Maximum Exactly K Comparisons.py
 
 
1424 Diagonal Traverse II.py
1424 Diagonal Traverse II.py
 
 
1425 Constrained Subsequence Sum.py
1425 Constrained Subsequence Sum.py
 
 
143 Reorder List.py
143 Reorder List.py
 
 
1431 Kids With the Greatest Number of Candies.py
1431 Kids With the Greatest Number of Candies.py
 
 
144 Binary Tree Preorder Traversal.py
144 Binary Tree Preorder Traversal.py
 
 
1442 Count Triplets That Can Form Two Arrays of Equal XOR.py
1442 Count Triplets That Can Form Two Arrays of Equal XOR.py
 
 

Repository files navigation

My solutions to LeetCode.com algorithmic riddles

About

My solutions to LeetCode algorithmic riddles

Resources

Readme

License

CC0-1.0 license
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages