Final Remarks
Here's a quick summary of what we learned from the "Two Pointers & Co." module.
We'll cover the following
Congratulations! You have successfully completed the “Two Pointers & Co.” module.
Summary
In this module, we learned how to solve problems with linear input data. We practiced the use of two related coding patterns: Two Pointers and Modified Binary Search. In problems where we needed to traverse a sorted array, we found that we could significantly improve the efficiency of our solutions by using an additional index in the array. Sharing similarities with the way the Two Pointers pattern is applied to arrays, the Modified Binary Search pattern reduces the size of the search space to reach its target in the least possible time. Therefore, we gained further hands-on experience with the divide and conquer approach to problem-solving.
What’s next?
Now that we have gained hands-on experience with efficient search and traversal techniques, we will cover problem-solving using linked lists, stacks, and matrices in the next module, “Basic Data Structures."