Module 1 of Skill Path: Speedrun the Google Coding Interview: Top Problems in Java
This module groups together two of the most common patterns that may be used to solve problems where the input data is linear: Two Pointers and Modified Binary Search. Both the Two Pointers and the Modified Binary Search patterns derive their power from their ability to efficiently reduce the size of the search space, that is, both exemplify the divide and conquer approach to problem-solving. After completing this module, we will have the knowledge of how to use this set of related patterns to solve a diverse range of problems.
Hands-on experience with using the Two Pointers pattern
Hands-on experience with using the Modified Binary Search pattern
The ability to choose the most appropriate of these two patterns to solve a new problem
Lifetime Discount 50% OFF
$25
.50
per mo,
billed annually ($149)
Lifetime Discount 50% OFF
$25
.50
per mo,
billed annually ($149)