Interview Problems / Algorithms. Two Pointers
In this video, we'll try solving interview problems (the algorithmic section). We'll solve them correctly, but suboptimally. We'll discuss algorithmic complexity and Big O notation. Then we'll improve the solution to O(n). For this, we'll use the Two Pointers approach. Basically, this is the first video on the channel about algorithms.
Contents:
00:00 Introduction
02:12 Pros and Cons of the Algorithmic Sections
06:04 Problem Statement
08:18 Solving the Problem. A Suboptimal Option
12:59 Discussing the Solution. Algorithmic Complexity
17:14 Big O Notation
19:27 Different Types of Algorithmic Complexity
23:38 Discussing the Algorithmic Complexity of a Suboptimal Solution
26:57 Two Pointers
33:49 A New Solution From O(n * log n) to O(n)
39:21 One more problem. Reinforcing skills
46:52 Preliminary results. What to read, how to prepare
52:49 Conclusion
Useful links:
My blog on Telegram: https://t.me/antonovjs
The map array method — https://developer.mozilla.org/ru/docs...
The Two Pointers approach — https://leetcode.com/articles/two-poi...