Final Remarks
Here's a quick summary of what we learned from the "Coding Interview Patterns" module.
We'll cover the following
Congratulations! You have successfully completed the “Coding Interview Patterns” module.
Summary
In this module, we learned different patterns to approach and solve a problem. We began this module by looking at sliding windows, fast and slow pointers, and merging of interval concepts. We then learned more coding patterns to solve interview problems related to arrays, linked lists, matrices, and trees. In the end, we learned greedy techniques, backtracking, dynamic programming, and sorting. We also solved problems on data structures such as stacks, graphs, trees, and hashmaps.
What's next?
Now that we have enough knowledge of coding interview patterns, it's time to learn low-level design patterns in the next module, "Object Oriented Design."