DSA Solutions - Page 2

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

1368.Minimum Cost to Make at Least One Valid Path in a Grid

1377.Frog Position After T Seconds

1462.Course Schedule IV

1466.Reorder Routes to Make All Paths Lead to the City Zero

1489.Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree

1494.Parallel Courses II

1514.Path with Maximum Probability

1548.The Most Similar Path in a Graph

1557.Minimum Number of Vertices to Reach All Nodes

1579.Remove Max Number of Edges to Keep Graph Fully Traversable

1584.Min Cost to Connect All Points

1591.Strange Printer II

1615.Maximal Network Rank

1632.Rank Transform of a Matrix

1697.Checking Existence of Edge Length Limited Paths

1719.Number Of Ways To Reconstruct A Tree

1724.Checking Existence of Edge Length Limited Paths II

1728.Cat and Mouse II

1761.Minimum Degree of a Connected Trio in a Graph

1778.Shortest Path in a Hidden Grid

1782.Count Pairs Of Nodes

1786.Number of Restricted Paths From First to Last Node

1791.Find Center of Star Graph

1810.Minimum Path Cost in a Hidden Grid

1820.Maximum Number of Accepted Invitations

1857.Largest Color Value in a Directed Graph

1916.Count Ways to Build Rooms in an Ant Colony

1928.Minimum Cost to Reach Destination in Time

1971.Find if Path Exists in Graph

1976.Number of Ways to Arrive at Destination

2039.The Time When the Network Becomes Idle

2045.Second Minimum Time to Reach Destination

2050.Parallel Courses III

2065.Maximum Path Quality of a Graph

2076.Process Restricted Friend Requests

2077.Paths in Maze That Lead to Same Room

2092.Find All People With Secret

2093.Minimum Cost to Reach City With Discounts

2101.Detonate the Maximum Bombs

2115.Find All Possible Recipes from Given Supplies

2123.Minimum Operations to Remove Adjacent Ones in Matrix

2127.Maximum Employees to Be Invited to a Meeting

2192.All Ancestors of a Node in a Directed Acyclic Graph

2203.Minimum Weighted Subgraph With the Required Paths

2204.Distance to a Cycle in Undirected Graph

2242.Maximum Score of a Node Sequence

2246.Longest Path With Different Adjacent Characters

2285.Maximum Total Importance of Roads

2290.Minimum Obstacle Removal to Reach Corner

2297.Jump Game VIII

How to use these solutions