Skip to content
/ LeetCode-POTD Public

Here I'll be providing the solution of LeetCode POTD along with it I also provide the video solution of the problem on Youtube whose link will be there in the code file. By clicking on the website link you'll be directed to my LeetCode POTD Youtube playlist.

www.youtube.com/playlist?list=PLDvvnZJ6HagstUFdfY1B1iOnbRkKkQvoV
0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

KumarDev2003/LeetCode-POTD

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

77 Commits
1007. Minimum Domino Rotations For Equal Row
1007. Minimum Domino Rotations For Equal Row
 
 
1123. Lowest Common Ancestor of Deepest Leaves
1123. Lowest Common Ancestor of Deepest Leaves
 
 
1128. Number of Equivalent Domino Pairs
1128. Number of Equivalent Domino Pairs
 
 
1358. Number of Substrings Containing All Three Characters
1358. Number of Substrings Containing All Three Characters
 
 
1780. Check if Number is a Sum of Powers of Three
1780. Check if Number is a Sum of Powers of Three
 
 
1863. Sum of All Subset XOR Totals
1863. Sum of All Subset XOR Totals
 
 
1920. Build Array from Permutation
1920. Build Array from Permutation
 
 
1976. Number of Ways to Arrive at Destination
1976. Number of Ways to Arrive at Destination
 
 
2033. Minimum Operations to Make a Uni-Value Grid
2033. Minimum Operations to Make a Uni-Value Grid
 
 
2115. Find All Possible Recipes from Given Supplies
2115. Find All Possible Recipes from Given Supplies
 
 
2140. Solving Questions With Brainpower
2140. Solving Questions With Brainpower
 
 
2145. Count the Hidden Sequences
2145. Count the Hidden Sequences
 
 
2161. Partition Array According to Given Pivot
2161. Partition Array According to Given Pivot
 
 
2206. Divide Array Into Equal Pairs
2206. Divide Array Into Equal Pairs
 
 
2226. Maximum Candies Allocated to K Children
2226. Maximum Candies Allocated to K Children
 
 
2379. Minimum Recolors to Get K Consecutive Black Blocks
2379. Minimum Recolors to Get K Consecutive Black Blocks
 
 
2401. Longest Nice Subarray
2401. Longest Nice Subarray
 
 
2460. Apply Operations to an Array
2460. Apply Operations to an Array
 
 
2503. Maximum Number of Points From Grid Queries
2503. Maximum Number of Points From Grid Queries
 
 
2523. Closest Prime Numbers in Range
2523. Closest Prime Numbers in Range
 
 
2529. Maximum Count of Positive Integer and Negative Integer
2529. Maximum Count of Positive Integer and Negative Integer
 
 
2551. Put Marbles in Bags
2551. Put Marbles in Bags
 
 
2560. House Robber IV
2560. House Robber IV
 
 
2563. Count the Number of Fair Pairs
2563. Count the Number of Fair Pairs
 
 
2570. Merge Two 2D Arrays by Summing Values
2570. Merge Two 2D Arrays by Summing Values
 
 
2579. Count Total Number of Colored Cells
2579. Count Total Number of Colored Cells
 
 
2594. Minimum Time to Repair Cars
2594. Minimum Time to Repair Cars
 
 
2685. Count the Number of Complete Components
2685. Count the Number of Complete Components
 
 
2780. Minimum Index of a Valid Split
2780. Minimum Index of a Valid Split
 
 
2818. Apply Operations to Maximize Score
2818. Apply Operations to Maximize Score
 
 
2873. Maximum Value of an Ordered Triplet I
2873. Maximum Value of an Ordered Triplet I
 
 
2874. Maximum Value of an Ordered Triplet II
2874. Maximum Value of an Ordered Triplet II
 
 
2965. Find Missing and Repeated Values
2965. Find Missing and Repeated Values
 
 
3108. Minimum Cost Walk in Weighted Graph
3108. Minimum Cost Walk in Weighted Graph
 
 
3169. Count Days Without Meetings
3169. Count Days Without Meetings
 
 
3191. Minimum Operations to Make Binary Array Elements Equal to One I
3191. Minimum Operations to Make Binary Array Elements Equal to One I
 
 
3208. Alternating Groups II
3208. Alternating Groups II
 
 
3306. Count of Substrings Containing Every Vowel and K Consonants II
3306. Count of Substrings Containing Every Vowel and K Consonants II
 
 
3356. Zero Array Transformation II
3356. Zero Array Transformation II
 
 
3375. Minimum Operations to Make Array Values Equal to K
3375. Minimum Operations to Make Array Values Equal to K
 
 
3394. Check if Grid can be Cut into Sections
3394. Check if Grid can be Cut into Sections
 
 
763. Partition Labels
763. Partition Labels
 
 
781. Rabbits in Forest
781. Rabbits in Forest
 
 
838. Push Dominoes
838. Push Dominoes
 
 

About

Here I'll be providing the solution of LeetCode POTD along with it I also provide the video solution of the problem on Youtube whose link will be there in the code file. By clicking on the website link you'll be directed to my LeetCode POTD Youtube playlist.

www.youtube.com/playlist?list=PLDvvnZJ6HagstUFdfY1B1iOnbRkKkQvoV
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published