DSA Solutions - Page 18

Each solution breaks the problem into approaches, usually from brute force to the best one, and explains why each works. Code comes in Python, Java, C++ and other languages. Knowing why an approach works matters more in an interview than remembering the code.

Try the problem first. Give it at least 20 minutes before you open the solution.
Read every approach. The brute force shows you the problem; the faster ones show the pattern.
Check the complexity. Note the time and space of each approach and what makes the difference.
Write it yourself. Close the solution and code it from memory in the editor.
Come back in a week. Solving it again later is what makes the pattern stick.

All problems Topics Company questions Sheets

Solutions, explained

1564.Put Boxes Into the Warehouse I

1567.Maximum Length of Subarray With Positive Product

1570.Dot Product of Two Sparse Vectors

1573.Number of Ways to Split a String

1574.Shortest Subarray to be Removed to Make Array Sorted

1577.Number of Ways Where Square of Number Is Equal to Product of Two Numbers

1578.Minimum Time to Make Rope Colorful

1580.Put Boxes Into the Warehouse II

1583.Count Unhappy Friends

1584.Min Cost to Connect All Points

1586.Binary Search Tree Iterator II

1589.Maximum Sum Obtained of Any Permutation

1590.Make Sum Divisible by P

1593.Split a String Into the Max Number of Unique Substrings

1594.Maximum Non Negative Product in a Matrix

1596.The Most Frequently Ordered Products for Each Customer

1599.Maximum Profit of Operating a Centennial Wheel

1600.Throne Inheritance

1602.Find Nearest Right Node in Binary Tree

1604.Alert Using Same Key-Card Three or More Times in a One Hour Period

1605.Find Valid Matrix Given Row and Column Sums

1609.Even Odd Tree

1612.Check If Two Expression Trees are Equivalent

1613.Find the Missing IDs

1615.Maximal Network Rank

1616.Split Two Strings to Make Palindrome

1618.Maximum Font to Fit a Sentence in a Screen

1620.Coordinate With Maximum Network Quality

1621.Number of Sets of K Non-Overlapping Line Segments

1625.Lexicographically Smallest String After Applying Operations

1626.Best Team With No Conflicts

1628.Design an Expression Tree With Evaluate Function

1630.Arithmetic Subarrays

1631.Path With Minimum Effort

1634.Add Two Polynomials Represented as Linked Lists

1638.Count Substrings That Differ by One Character

1641.Count Sorted Vowel Strings

1642.Furthest Building You Can Reach

1644.Lowest Common Ancestor of a Binary Tree II

1647.Minimum Deletions to Make Character Frequencies Unique

1648.Sell Diminishing-Valued Colored Balls

1650.Lowest Common Ancestor of a Binary Tree III

1653.Minimum Deletions to Make String Balanced

1654.Minimum Jumps to Reach Home

1657.Determine if Two Strings Are Close

1658.Minimum Operations to Reduce X to Zero

1660.Correct a Binary Tree

1663.Smallest String With A Given Numeric Value

1664.Ways to Make a Fair Array

1666.Change the Root of a Binary Tree

How to use these solutions