1000 - 1099
Solutions categorised by Problem IDs
0997 - Find the Town Judge (Easy)Explore solutions to LeetCode 0997 - Find the Town Judge (Easy), with explanations and code implementations.1000 - Minimum Cost to Merge Stones (Hard)Explore solutions to LeetCode 1000 - Minimum Cost to Merge Stones (Hard), with explanations and code implementations.1004 - Max Consecutive Ones III (Medium)Explore solutions to LeetCode 1004 - Max Consecutive Ones III (Medium), with explanations and code implementations.1011 - Capacity to Ship Packages within d days (Medium)Explore solutions to LeetCode 1011 - Capacity to Ship Packages within d days (Medium), with explanations and code implementations.1019 - Next Greater Node In Linked List (Medium)Explore solutions to LeetCode 1019 - Next Greater Node In Linked List (Medium), with explanations and code implementations.1029 - Two City Scheduling (Medium)Explore solutions to LeetCode 1029 - Two City Scheduling (Medium), with explanations and code implementations.1043 - Partition Array for Maximum Sum (Medium)Explore solutions to LeetCode 1043 - Partition Array for Maximum Sum (Medium), with explanations and code implementations.1046 - Last Stone Weight (Easy)Explore solutions to LeetCode 1046 - Last Stone Weight (Easy), with explanations and code implementations.1047 - Remove All Adjacent Duplicates In String (Easy)Explore solutions to LeetCode 1047 - Remove All Adjacent Duplicates In String (Easy), with explanations and code implementations.1061 - Lexicographically Smallest Equivalent String (Medium)Explore solutions to LeetCode 1061 - Lexicographically Smallest Equivalent String (Medium), with explanations and code implementations.1066 - Campus Bikes II (Medium)Explore solutions to LeetCode 1066 - Campus Bikes II (Medium), with explanations and code implementations.1071 - Greatest Common Divisor of Strings (Easy)Explore solutions to LeetCode 1071 - Greatest Common Divisor of Strings (Easy), with explanations and code implementations.