Skip to content

AnkitDimri4/LeetCode2024-25DCC

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

591 Commits
1140. Stone Game II
1140. Stone Game II
 
 
1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold
1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold
 
 
1877. Minimize Maximum Pair Sum in Array
1877. Minimize Maximum Pair Sum in Array
 
 
1937. Maximum Number of Points with Cost
1937. Maximum Number of Points with Cost
 
 
1984. Minimum Difference Between Highest and Lowest of K Scores
1984. Minimum Difference Between Highest and Lowest of K Scores
 
 
264. Ugly Number II
264. Ugly Number II
 
 
3507. Minimum Pair Removal to Sort Array I
3507. Minimum Pair Removal to Sort Array I
 
 
3510. Minimum Pair Removal to Sort Array II
3510. Minimum Pair Removal to Sort Array II
 
 
476. Number Complement & 1009. Complement of Base 10 Integer
476. Number Complement & 1009. Complement of Base 10 Integer
 
 
592. Fraction Addition and Subtraction
592. Fraction Addition and Subtraction
 
 
624. Maximum Distance in Arrays
624. Maximum Distance in Arrays
 
 
650. 2 Keys Keyboard
650. 2 Keys Keyboard
 
 
664. Strange Printer
664. Strange Printer
 
 
719. Find K-th Smallest Pair Distance
719. Find K-th Smallest Pair Distance
 
 
860. Lemonade Change
860. Lemonade Change
 
 
E 1331. Rank Transform of an Array
E 1331. Rank Transform of an Array
 
 
E 145. Binary Tree Postorder Traversal
E 145. Binary Tree Postorder Traversal
 
 
E 1684. Count the Number of Consistent Strings
E 1684. Count the Number of Consistent Strings
 
 
E 2022. Convert 1D Array Into 2D Array
E 2022. Convert 1D Array Into 2D Array
 
 
E 2185. Counting Words With a Given Prefix
E 2185. Counting Words With a Given Prefix
 
 
E 2220. Minimum Bit Flips to Convert Number
E 2220. Minimum Bit Flips to Convert Number
 
 
E 2696 Minimum String Length After Removing Substrings
E 2696 Minimum String Length After Removing Substrings
 
 
E 590. N-ary Tree Postorder Traversal
E 590. N-ary Tree Postorder Traversal
 
 
E 884. Uncommon Words from Two Sentences
E 884. Uncommon Words from Two Sentences
 
 
E x1945. Sum of Digits of String After Convert
E x1945. Sum of Digits of String After Convert
 
 
H 1106. Parsing A Boolean Expression
H 1106. Parsing A Boolean Expression
 
 
H 2127. Maximum Employees to Be Invited to a Meeting
H 2127. Maximum Employees to Be Invited to a Meeting
 
 
H 214. Shortest Palindrome
H 214. Shortest Palindrome
 
 
H 2290. Minimum Obstacle Removal to Reach Corner
H 2290. Minimum Obstacle Removal to Reach Corner
 
 
H 2416. Sum of Prefix Scores of Strings
H 2416. Sum of Prefix Scores of Strings
 
 
H 2493. Divide Nodes Into the Maximum Number of Groups
H 2493. Divide Nodes Into the Maximum Number of Groups
 
 
H 2699. Modify Graph Edge Weights
H 2699. Modify Graph Edge Weights
 
 
H 432. All O`one Data Structure
H 432. All O`one Data Structure
 
 
H 440. K-th Smallest in Lexicographical Order
H 440. K-th Smallest in Lexicographical Order
 
 
H 564. Find the Closest Palindrome
H 564. Find the Closest Palindrome
 
 
H 862. Shortest Subarray with Sum at Least K
H 862. Shortest Subarray with Sum at Least K
 
 
M 1310. XOR Queries of a Subarray
M 1310. XOR Queries of a Subarray
 
 
M 1367. Linked List in Binary Tree
M 1367. Linked List in Binary Tree
 
 
M 1371. Find the Longest Substring Containing Vowels in Even Counts
M 1371. Find the Longest Substring Containing Vowels in Even Counts
 
 
M 1381. Design a Stack With Increment Operation
M 1381. Design a Stack With Increment Operation
 
 
M 1497. Check If Array Pairs Are Divisible by k
M 1497. Check If Array Pairs Are Divisible by k
 
 
M 1514. Path with Maximum Probability
M 1514. Path with Maximum Probability
 
 
M 1545. Find Kth Bit in Nth Binary String
M 1545. Find Kth Bit in Nth Binary String
 
 
M 1574. Shortest Subarray to be Removed to Make Array Sorted
M 1574. Shortest Subarray to be Removed to Make Array Sorted
 
 
M 1590. Make Sum Divisible by P
M 1590. Make Sum Divisible by P
 
 
M 179. Largest Number
M 179. Largest Number
 
 
M 1813. Sentence Similarity III
M 1813. Sentence Similarity III
 
 
M 1894. Find the Student that Will Replace the Chalk
M 1894. Find the Student that Will Replace the Chalk
 
 
M 1905. Count Sub Islands
M 1905. Count Sub Islands
 
 
M 1963. Minimum Number of Swaps to Make the String Balanced
M 1963. Minimum Number of Swaps to Make the String Balanced
 
 
M 2028. Find Missing Observations
M 2028. Find Missing Observations
 
 
M 2044. Count Number of Maximum Bitwise-OR Subsets
M 2044. Count Number of Maximum Bitwise-OR Subsets
 
 
M 2064. Minimized Maximum of Products Distributed to Any Store
M 2064. Minimized Maximum of Products Distributed to Any Store
 
 
M 2326. Spiral Matrix IV
M 2326. Spiral Matrix IV
 
 
M 233. Remove Sub-Folders from the Filesystem
M 233. Remove Sub-Folders from the Filesystem
 
 
M 2406. Divide Intervals Into Minimum Number of Groups
M 2406. Divide Intervals Into Minimum Number of Groups
 
 
M 241. Different Ways to Add Parentheses
M 241. Different Ways to Add Parentheses
 
 
M 2419. Longest Subarray With Maximum Bitwise AND
M 2419. Longest Subarray With Maximum Bitwise AND
 
 
M 2491. Divide Players Into Teams of Equal Skill
M 2491. Divide Players Into Teams of Equal Skill
 
 
M 2530. Maximal Score After Applying K Operations
M 2530. Maximal Score After Applying K Operations
 
 
M 2657. Find the Prefix Common Array of Two Arrays
M 2657. Find the Prefix Common Array of Two Arrays
 
 
M 2707. Extra Characters in a String
M 2707. Extra Characters in a String
 
 
M 2807. Insert Greatest Common Divisors in Linked List
M 2807. Insert Greatest Common Divisors in Linked List
 
 
M 2948. Make Lexicographically Smallest Array by Swapping Elements
M 2948. Make Lexicographically Smallest Array by Swapping Elements
 
 
M 3043. Find the Length of the Longest Common Prefix
M 3043. Find the Length of the Longest Common Prefix
 
 
M 3217. Delete Nodes From Linked List Present in Array
M 3217. Delete Nodes From Linked List Present in Array
 
 
M 3254. Find the Power of K-Size Subarrays I
M 3254. Find the Power of K-Size Subarrays I
 
 
M 386. Lexicographical Numbers
M 386. Lexicographical Numbers
 
 
M 539. Minimum Time Difference
M 539. Minimum Time Difference
 
 
M 567. Permutation in String
M 567. Permutation in String
 
 
M 641. Design Circular Deque
M 641. Design Circular Deque
 
 
M 670. Maximum Swap
M 670. Maximum Swap
 
 
M 684. Redundant Connection
M 684. Redundant Connection
 
 
M 725. Split Linked List in Parts
M 725. Split Linked List in Parts
 
 
M 729. My Calendar I
M 729. My Calendar I
 
 
M 731. My Calendar II
M 731. My Calendar II
 
 
M 874. Walking Robot Simulation
M 874. Walking Robot Simulation
 
 
M 921. Minimum Add to Make Parentheses Valid
M 921. Minimum Add to Make Parentheses Valid
 
 
M 947. Most Stones Removed with Same Row or Column
M 947. Most Stones Removed with Same Row or Column
 
 
M 951. Flip Equivalent Binary Trees
M 951. Flip Equivalent Binary Trees
 
 
README.md
README.md
 
 

Repository files navigation

LeetCode2024DCC

Solutions and explanations for LeetCode's Daily Coding Challenges in 2024.

About

Solutions and clear explanations for LeetCode Daily Coding Challenges (2024–2026), focusing on efficient algorithms, optimal time–space complexity, and well-structured implementations to help strengthen problem-solving skills and interview readiness.

leetcode.com/u/user4612MW/

Topics

python java cpp python3 dsa javasc dsa-questions

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages