Mastering critical SKILLS for Coding Interviews C++: Part 1

Welcome to one of the unique and special Coding Interviews courses.

This course is all about algorithmic problem–solving for problems mainly from the Leetcode website. Specifically, the medium level frequent interview problems. The goal of this course is to sharpen your problem–solving skills to aid you in ACEing Coding Interviews from FAANG companies. During the course, you won’t only be provided with a problem and its solution, but a series of hints and thinking approaches to tackle the problems.

I don’t teach data structures or algorithms in this course. You must study these courses from high–quality sources and solve many problems to gain basic problem–solving skills. The problems in this course are of medium level. Without proper background and skills, the materials will be hard to learn.

Part 1 content

Part one covers the data structures:

Arrays: Prefix Sum, Sliding Window (fixed and variable size) 2 Pointers, and Permutations.

Tutorials are provided for these topics only, as they are not covered in DSA courses.

String

Matrices

Stack and Priority Queue

Linked List and Binary Trees

Hash Tables

The scope of the topics: Interviews coverage.

Note: You are expected to solve the implementation problems over these topics during a data structure course. For example, reversing a linked list is a common interview question. I won’t cover it. It is mainly an implementation task. The same for the basic binary tree DFS problems. I do cover such questions in my data structure and algorithms course. This course is about problem–solving challenges.