LeetCode The Hard Way

1300 - 1399

Solutions categorised by Problem IDs

1305 - All Elements in Two Binary Search Trees (Medium)Explore solutions to LeetCode 1305 - All Elements in Two Binary Search Trees (Medium), with explanations and code implementations.1326 - Minimum Number of Taps to Open to Water a Garden (Hard)Explore solutions to LeetCode 1326 - Minimum Number of Taps to Open to Water a Garden (Hard), with explanations and code implementations.1328 - Break a Palindrome (Medium)Explore solutions to LeetCode 1328 - Break a Palindrome (Medium), with explanations and code implementations.1329 - Sort the Matrix Diagonally (Medium)Explore solutions to LeetCode 1329 - Sort the Matrix Diagonally (Medium), with explanations and code implementations.1331 - Rank Transform of an Array (Easy)Explore solutions to LeetCode 1331 - Rank Transform of an Array (Easy), with explanations and code implementations.1334 - Find the City With the Smallest Number of Neighbors at a Threshold Distance (Medium)Explore solutions to LeetCode 1334 - Find the City With the Smallest Number of Neighbors at a Threshold Distance (Medium), with explanations and code implementations.1335 - Minimum Difficulty of a Job Schedule (Hard)Explore solutions to LeetCode 1335 - Minimum Difficulty of a Job Schedule (Hard), with explanations and code implementations.1337 - The K Weakest Rows in a Matrix (Easy)Explore solutions to LeetCode 1337 - The K Weakest Rows in a Matrix (Easy), with explanations and code implementations.1346 - Check If N and Its Double Exist (Easy)Explore solutions to LeetCode 1346 - Check If N and Its Double Exist (Easy), with explanations and code implementations.1347 - Minimum Number of Steps to Make Two Strings Anagram (Easy)Explore solutions to LeetCode 1347 - Minimum Number of Steps to Make Two Strings Anagram (Easy), with explanations and code implementations.1349 - Maximum Students Taking Exam (Hard)Explore solutions to LeetCode 1349 - Maximum Students Taking Exam (Hard), with explanations and code implementations.1356 - Sort Integers by The Number of 1 Bits (Easy)Explore solutions to LeetCode 1356 - Sort Integers by The Number of 1 Bits (Easy), with explanations and code implementations.1359 - Count All Valid Pickup and Delivery Options (Hard)Explore solutions to LeetCode 1359 - Count All Valid Pickup and Delivery Options (Hard), with explanations and code implementations.1365 - How Many Numbers Are Smaller Than the Current Number (Easy)Explore solutions to LeetCode 1365 - How Many Numbers Are Smaller Than the Current Number (Easy), with explanations and code implementations.1371 - Find the Longest Substring Containing Vowels in Even Counts (Medium)Explore solutions to LeetCode 1371 - Find the Longest Substring Containing Vowels in Even Counts (Medium), with explanations and code implementations.1372 - Longest ZigZag Path in a Binary Tree (Medium)Explore solutions to LeetCode 1372 - Longest ZigZag Path in a Binary Tree (Medium), with explanations and code implementations.1383 - Maximum Performance of a Team (Hard)Explore solutions to LeetCode 1383 - Maximum Performance of a Team (Hard), with explanations and code implementations.1386 - Cinema Seat Allocation (Medium)Explore solutions to LeetCode 1386 - Cinema Seat Allocation (Medium), with explanations and code implementations.