Finding subarrays or substrings (e.g., "Longest substring without repeating characters").
Finding the shortest path in an unweighted graph or tree level-order traversal. Problem Solving in Data Structures & Algorithms...
Don't jump straight into your IDE. Professional problem solving follows a structured sequence: Finding subarrays or substrings (e
Get it working first, then make it fast, then make it clean. Finding subarrays or substrings (e.g.