Skip to content

Anicodeth/Code-challenge-solutions

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

794 Commits
class Solution: def closestPrimes(self, left: int, right: int) -> List[int]: def seive(l, r): primes = [True] * (r + 1) primes[0] = primes[1] = False for i in range(2,int(r
class Solution: def closestPrimes(self, left: int, right: int) -> List[int]: def seive(l, r): primes = [True] * (r + 1) primes[0] = primes[1] = False for i in range(2,int(r
 
 
100. Same Tree .py
100. Same Tree .py
 
 
1005. Maximize Sum Of Array After K Negations.py
1005. Maximize Sum Of Array After K Negations.py
 
 
1006. Clumsy Factorial.py
1006. Clumsy Factorial.py
 
 
1008. Construct Binary Search Tree from Preorder Traversal.py
1008. Construct Binary Search Tree from Preorder Traversal.py
 
 
101. Symmetric Tree n.py
101. Symmetric Tree n.py
 
 
1014. Best Sightseeing Pair New.py
1014. Best Sightseeing Pair New.py
 
 
1014. Best Sightseeing Pair.py
1014. Best Sightseeing Pair.py
 
 
1019. Next Greater Node In Linked List.py
1019. Next Greater Node In Linked List.py
 
 
102. Binary Tree Level Order Traversal.py
102. Binary Tree Level Order Traversal.py
 
 
1020. Number of Enclaves Google.py
1020. Number of Enclaves Google.py
 
 
1021. Remove Outermost Parentheses.py
1021. Remove Outermost Parentheses.py
 
 
1023. Camelcase Matching.py
1023. Camelcase Matching.py
 
 
1027. Longest Arithmetic Subsequence.py
1027. Longest Arithmetic Subsequence.py
 
 
1029. Two City Scheduling.py
1029. Two City Scheduling.py
 
 
104. Maximum Depth of Binary Tree 2nd.py
104. Maximum Depth of Binary Tree 2nd.py
 
 
104. Maximum Depth of Binary Tree Databricks.py
104. Maximum Depth of Binary Tree Databricks.py
 
 
104. Maximum Depth of Binary Tree.py
104. Maximum Depth of Binary Tree.py
 
 
1041. Robot Bounded In Circle.py
1041. Robot Bounded In Circle.py
 
 
1042. Flower Planting With No Adjacent.py
1042. Flower Planting With No Adjacent.py
 
 
1046. Last Stone Weight.py
1046. Last Stone Weight.py
 
 
1047. Remove All Adjacent Duplicates In String Google.py
1047. Remove All Adjacent Duplicates In String Google.py
 
 
1051. Height Checker.py
1051. Height Checker.py
 
 
107. Binary Tree Level Order Traversal II.py
107. Binary Tree Level Order Traversal II.py
 
 
108. Convert Sorted Array to Binary Search Tree.py
108. Convert Sorted Array to Binary Search Tree.py
 
 
1091. Shortest Path in Binary Matrix.py
1091. Shortest Path in Binary Matrix.py
 
 
1095. Find in Mountain Array.py
1095. Find in Mountain Array.py
 
 
110. Balanced Binary Tree Google 2.py
110. Balanced Binary Tree Google 2.py
 
 
110. Balanced Binary Tree Google.py
110. Balanced Binary Tree Google.py
 
 
111. Minimum Depth of Binary Tree.py
111. Minimum Depth of Binary Tree.py
 
 
1110. Delete Nodes And Return Forest.py
1110. Delete Nodes And Return Forest.py
 
 
1122. Relative Sort Array.py
1122. Relative Sort Array.py
 
 
1123. Lowest Common Ancestor of Deepest Leaves Google.py
1123. Lowest Common Ancestor of Deepest Leaves Google.py
 
 
1128. Number of Equivalent Domino Pairs.py
1128. Number of Equivalent Domino Pairs.py
 
 
113. Path Sum II.py
113. Path Sum II.py
 
 
1136. Parallel Courses.py
1136. Parallel Courses.py
 
 
1137. N-th Tribonacci Number.py
1137. N-th Tribonacci Number.py
 
 
1146. Snapshot Array.py
1146. Snapshot Array.py
 
 
1147. Longest Chunked Palindrome Decomposition.py
1147. Longest Chunked Palindrome Decomposition.py
 
 
1160. Find Words That Can Be Formed by Characters.py
1160. Find Words That Can Be Formed by Characters.py
 
 
1169. Invalid Transactions.py
1169. Invalid Transactions.py
 
 
118. Pascal's Triangle.py
118. Pascal's Triangle.py
 
 
119. Pascal's Triangle II.py
119. Pascal's Triangle II.py
 
 
12. Integer to Roman.py
12. Integer to Roman.py
 
 
120. Triangle.py
120. Triangle.py
 
 
1200. Minimum Absolute Difference.py
1200. Minimum Absolute Difference.py
 
 
1207. Unique Number of Occurrences.py
1207. Unique Number of Occurrences.py
 
 
1209. Remove All Adjacent Duplicates in String II.py
1209. Remove All Adjacent Duplicates in String II.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
 
 
1219. Path with Maximum Gold.py
1219. Path with Maximum Gold.py
 
 
122. Best Time to Buy and Sell Stock II Databricks.py
122. Best Time to Buy and Sell Stock II Databricks.py
 
 
1233. Remove Sub-Folders from the Filesystem.py
1233. Remove Sub-Folders from the Filesystem.py
 
 
1239. Maximum Length of a Concatenated String with Unique Characters.py
1239. Maximum Length of a Concatenated String with Unique Characters.py
 
 
124. Binary Tree Maximum Path Sum.py
124. Binary Tree Maximum Path Sum.py
 
 
1266. Minimum Time Visiting All Points.py
1266. Minimum Time Visiting All Points.py
 
 
128. Longest Consecutive Sequence.py
128. Longest Consecutive Sequence.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
 
 
1287. Element Appearing More Than 25% In Sorted Array.py
1287. Element Appearing More Than 25% In Sorted Array.py
 
 
129. Sum Root to Leaf Numbers Databricks.py
129. Sum Root to Leaf Numbers Databricks.py
 
 
129. Sum Root to Leaf Numbers.py
129. Sum Root to Leaf Numbers.py
 
 
1290. Convert Binary Number in a Linked List to Integer.py
1290. Convert Binary Number in a Linked List to Integer.py
 
 
1295. Find Numbers with Even Number of Digits .py
1295. Find Numbers with Even Number of Digits .py
 
 
13. Roman to Integer.py
13. Roman to Integer.py
 
 
130. Surrounded Regions.py
130. Surrounded Regions.py
 
 
1302. Deepest Leaves Sum Google.py
1302. Deepest Leaves Sum Google.py
 
 
1305. All Elements in Two Binary Search Trees Google.py
1305. All Elements in Two Binary Search Trees Google.py
 
 
131. Palindrome Partitioning Google.py
131. Palindrome Partitioning Google.py
 
 
1315. Sum of Nodes with Even-Valued Grandparent.py
1315. Sum of Nodes with Even-Valued Grandparent.py
 
 
133. Clone Graph Google.py
133. Clone Graph Google.py
 
 
134. Gas Station.py
134. Gas Station.py
 
 
1342. Number of Steps to Reduce a Number to Zero.py
1342. Number of Steps to Reduce a Number to Zero.py
 
 
1346. Check If N and Its Double Exist.py
1346. Check If N and Its Double Exist.py
 
 
135. Candy.py
135. Candy.py
 
 
1351. Count Negative Numbers in a Sorted Matrix.py
1351. Count Negative Numbers in a Sorted Matrix.py
 
 
1352. Product of the Last K Numbers.py
1352. Product of the Last K Numbers.py
 
 
1356. Sort Integers by The Number of 1 Bits.py
1356. Sort Integers by The Number of 1 Bits.py
 
 
136. Single Number.py
136. Single Number.py
 
 
1366. Rank Teams by Votes Google.py
1366. Rank Teams by Votes Google.py
 
 
137. Single Number II .py
137. Single Number II .py
 
 
1387. Sort Integers by The Power Value.py
1387. Sort Integers by The Power Value.py
 
 
1391. Check if There is a Valid Path in a Grid r .py
1391. Check if There is a Valid Path in a Grid r .py
 
 
1394. Find Lucky Integer in an Array.py
1394. Find Lucky Integer in an Array.py
 
 
1395. Count Number of Teams.py
1395. Count Number of Teams.py
 
 
1396. Design Underground System Google.py
1396. Design Underground System Google.py
 
 
1399. Count Largest Group.py
1399. Count Largest Group.py
 
 
140. Word Break II.py
140. Word Break II.py
 
 
1402. Reducing Dishes.py
1402. Reducing Dishes.py
 
 
1408. String Matching in an Array.py
1408. String Matching in an Array.py
 
 
141. Linked List Cycle.py
141. Linked List Cycle.py
 
 
142. Linked List Cycle II.py
142. Linked List Cycle II.py
 
 
1422. Maximum Score After Splitting a String.py
1422. Maximum Score After Splitting a String.py
 
 
1425. Constrained Subsequence Sum.py
1425. Constrained Subsequence Sum.py
 
 
1431. Kids With the Greatest Number of Candies.py
1431. Kids With the Greatest Number of Candies.py
 
 
1433. Check If a String Can Break Another String Google.py
1433. Check If a String Can Break Another String Google.py
 
 
144. Binary Tree Preorder Traversal.py
144. Binary Tree Preorder Traversal.py
 
 
1441. Build an Array With Stack Operations.py
1441. Build an Array With Stack Operations.py
 
 
1443. Minimum Time to Collect All Apples in a Tree r.py
1443. Minimum Time to Collect All Apples in a Tree r.py
 
 
1448. Count Good Nodes in Binary Tree.py
1448. Count Good Nodes in Binary Tree.py
 
 
145. Binary Tree Postorder Traversal,py
145. Binary Tree Postorder Traversal,py
 
 

Repository files navigation

Code-challenge-solutions

Solutions for multiple Leetcode, Codeforce, Hackerrank and other platform programming challenges.

About

Solutions for multiple leetcode and other platform code challenges.

Resources

Readme
Activity

Stars

2 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages