1400 - 1499
Solutions categorised by Problem IDs
1431 - Kids With the Greatest Number of CandiesDetermine which children can have the most candies after receiving the extra candies by comparing against the current maximum.1434 - Number of Ways to Wear Different Hats to Each OtherCount assignments of distinct preferred hats by tracking which people have received a hat during dynamic programming.1443 - Minimum Time to Collect All Apples in a TreeCompute the round-trip time to collect every apple by counting the tree edges needed to reach apple-bearing branches.1448 - Count Good Nodes in Binary TreeCount tree nodes whose value equals or exceeds every earlier value on their root-to-node path.1457 - Pseudo-Palindromic Paths in a Binary TreeCount root-to-leaf paths whose digits can form a palindrome by tracking odd occurrence counts with a bit mask.1460 - Make Two Arrays Equal by Reversing SubarraysDetermine whether two arrays can match after subarray reversals by comparing their sorted elements.1464 - Maximum Product of Two Elements in an ArrayMaximize the product obtained after subtracting one from each of two chosen array values by selecting the largest pair.1470 - Shuffle the ArrayInterleave the two halves of an array by taking one corresponding element from each half at a time.1475 - Final Prices With a Special Discount in a ShopApply the first eligible price discount to each item by resolving waiting prices with a stack.1480 - Running Sum of 1d ArrayCompute running sums by carrying the cumulative total through the array in order.1482 - Minimum Number of Days to Make m BouquetsFind the earliest day enough adjacent flowers bloom for all bouquets by binary searching the day and checking feasibility.1491 - Average Salary Excluding the Minimum and Maximum SalaryCompute the average salary after removing the minimum and maximum by tracking the sum and both extremes in one pass.1494 - Parallel Courses IIMinimize semesters under prerequisite and course-load limits by tracking completed courses with bit-mask dynamic programming.1496 - Path CrossingDetect whether a path crosses itself by tracking the coordinates visited after each directional step.
