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

Mastering critical SKILLS for Coding Interviews C++: Part 1, available at $79.99, has an average rating of 4.45, with 145 lectures, based on 273 reviews, and has 2528 subscribers.

You will learn about Sharpen your problem-solving skills More than 70 MEDIUM level FREQUENT interview problems Increase the chance of seeing the same problems in the interview Several hints NOT just the whole solution After the course: Other ~100 problems are provided to solve on your own Well-written compact codes 2 training styles: the classical topics-based style and a blind-based style (sprints of 10 problems) This course is ideal for individuals who are Sharpen algorithmic skills to ace the interviews from FAANG It is particularly useful for Sharpen algorithmic skills to ace the interviews from FAANG.

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

Summary

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

Price: $79.99

Average Rating: 4.45

Number of Lectures: 145

Number of Published Lectures: 145

Number of Curriculum Items: 145

Number of Published Curriculum Objects: 145

Original Price: $199.99

Quality Status: approved

Status: Live

What You Will Learn

Sharpen your problem-solving skills

More than 70 MEDIUM level FREQUENT interview problems

Increase the chance of seeing the same problems in the interview

Several hints NOT just the whole solution

After the course: Other ~100 problems are provided to solve on your own

Well-written compact codes

2 training styles: the classical topics-based style and a blind-based style (sprints of 10 problems)

Who Should Attend

Sharpen algorithmic skills to ace the interviews from FAANG

Target Audiences

Sharpen algorithmic skills to ace the interviews from FAANG

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.

Although the focus of this part is Data Structures, but still your background in Algorithms is needed.

Major: Complexity, Recursion and Sorting

Minor: A few times I refer to: Binary Search, Divide and Conquer and Dynamic Programming

Generally, most of the problems require serious algorithmic skills

The course level:

Most of the problems in this course are Leetcode MEDIUM level, which represent 85-90% of real interview questions.

To be more effective, the questions are mainly the most frequentinterview questions according to the LeetCode website.

This means; in addition to gaining problem-solving skills, you increase the chance of meeting problems you already solved in the interviews!

Without proper background & skills ? the course will be hard to learn

Prerequisites:

Strong programming skills & DSA knowledge/skills (from 3 courses)

A high-quality programming course consisting of:

Good coverage for programming + many exercises on learned topics

Proper understanding/using for built-in algorithms/DS (e.g. C++ STL / Java Collections)

Optional: Several projects to be comfortable with long coding

A high-Quality Data Structure course: good coverage + many exercises

A high-Quality Algorithms course: good coverage + many exercises

This implies: you already solved and coded a lot. It is time to move to medium challenges.

Don’t join this course if you lack basic problem-solving skills

The course programming language

All slides codes are based on C++

Mainly C++11. I intend to not use the very modern C++

Many people don’t study after C++11

It will be easier for other programming languages to understand the code

C++ code is very similar to Java and C#. To a good extent, similar to JavaScript.

The LeetCode discussion tab has solutions for many other languages

80% of the problems: I will download solutions for some other languages (Python, Java) .

No promise, but some downloads for JavaScript and a few C#

As the code is downloaded, expect differences in the code structure. You must understand fully the lecture first.

The course natural language:

The course is only in English with an Egyptian accent

English subtitles are provided to make it easy in case. it is easy to adapt the Egyptian accent

Videos problem-solving cycle:

Presenting a problem

Verifying assumptions and test cases

Trying to brute-force the problem

Optimizing the brute force if possible

Or analyzing the problem and test cases

Several iterative hints are provided; a missing educational key in other resources

Well-written codes.

2 training styles are possible with the materials.

A topics-based style where you focus on a specific topic and solving many of its problems. This style has a great disadvantage; you know the solution category (e.g. a stack problem), which is a big hint.

A blind-based style where sprints of problems are provided. Each sprint is 10 problems to solve.

You don’t know the category of the problem.

This is a more matching experience to the real interviews experience.

This style is the recommended one.

After the course, you will be provided with more problems to solve on your own to keep enhancing your skills.

You must solve a lot to increase your chance of passing the interviews.

A problem name starts with

E for easy-level from 1 to 3

M for medium-level from 4 to 7

H for hard-level from 8 to 10

Acknowledgement: “I’d like to extend my gratitude towards Robert Bogan for his help with proofreading the slides for this course”

Course Curriculum

Chapter 1: Getting Started

Lecture 1: Prerequisites

Lecture 2: Effective usage of the course 1

Lecture 3: Effective usage of the course 2

Lecture 4: Online Judge – LeetCode

Lecture 5: Supported Languages and Languages Conversions

Lecture 6: Resources and Students Community

Lecture 7: Important Note

Chapter 2: Problem-Solving Cycle

Lecture 1: Problem Understanding

Lecture 2: Test Cases

Lecture 3: Brute-force it

Lecture 4: Toward Intended Solution

Lecture 5: Code & Test

Lecture 6: Analyze Complexity

Lecture 7: Lets tackle a problem – Two Sum

Chapter 3: Course Problem-Solving Sprints

Lecture 1: What and Why Sprints

Lecture 2: Sprint 1

Lecture 3: Sprint 2

Lecture 4: Sprint 3

Lecture 5: Sprint 4

Lecture 6: Sprint 5

Lecture 7: Sprint 6

Lecture 8: Sprint 7

Lecture 9: Sprint 8

Chapter 4: Arrays: Prefix Sum

Lecture 1: Tutorial – Array Problems

Lecture 2: Tutorial – Prefix Sum

Lecture 3: E3 Problem #1

Lecture 4: M5 Problem #2 A

Lecture 5: M5 Problem #2 B

Lecture 6: M5 Problem #2 C

Chapter 5: Arrays: Sliding Window

Lecture 1: Tutorial – Fixed-size Sliding Window

Lecture 2: E3 Problem #1

Lecture 3: Tutorial – Variable-size Sliding Window 1

Lecture 4: Tutorial – Variable-size Sliding Window 2

Lecture 5: Tutorial – Variable-size Sliding Window 3

Lecture 6: M4 Problem #2 A

Lecture 7: M4 Problem #2 B

Lecture 8: M6 Problem #3 A

Lecture 9: M6 Problem #3 B

Lecture 10: M6 Problem #3 C

Chapter 6: Arrays: 2-Pointers

Lecture 1: Tutorial – 2-Pointers

Lecture 2: E2 Problem #1

Lecture 3: M4 Problem #2

Lecture 4: M5 Problem #3

Lecture 5: M6 Problem #4

Lecture 6: M7 Problem #5

Lecture 7: M7 Problem #5 – Update

Lecture 8: M5 Problem #6

Lecture 9: M5 Problem #6 B

Lecture 10: M6 Problem #7

Chapter 7: Arrays: Ad-hoc

Lecture 1: E3 Problem #1

Lecture 2: M5 Problem #2

Lecture 3: Tutorial – Permutations 1

Lecture 4: Tutorial – Permutations 2

Lecture 5: H8 Problem #3 A

Lecture 6: H8 Problem #3 B

Chapter 8: String

Lecture 1: E2 Problem #1

Lecture 2: E2 Problem #2

Lecture 3: M4 Problem #3

Lecture 4: M4 Problem #4

Lecture 5: M4 Problem #5

Lecture 6: M5 Problem #6

Lecture 7: M6 Problem #7

Chapter 9: Matrix

Lecture 1: M5 Problem #1

Lecture 2: M6 Problem #2 A

Lecture 3: M6 Problem #2 B

Lecture 4: M6 Problem #3 A

Lecture 5: M6 Problem #3 B

Lecture 6: M5 Problem #4

Lecture 7: M4 Problem #5

Lecture 8: M5 Problem #6 A

Lecture 9: M5 Problem #6 B

Chapter 10: Stack

Lecture 1: E3 Problem #1

Lecture 2: E3 Problem #2

Lecture 3: M5 Problem #3

Lecture 4: M6 Problem #4

Lecture 5: M6 Problem #5

Lecture 6: M6 Problem #6

Lecture 7: M6 Problem #7 A

Lecture 8: M6 Problem #7 B

Lecture 9: M7 Problem #8 A

Lecture 10: M7 Problem #8 B

Chapter 11: Priority Queue

Lecture 1: M5 Problem #1

Lecture 2: M6 Problem #2 A

Lecture 3: M6 Problem #2 B

Lecture 4: M7 Problem #3

Lecture 5: M6 Problem #4 A

Lecture 6: M6 Problem #4 B

Lecture 7: M5 Problem #5 A

Lecture 8: M5 Problem #5 B

Instructors

Dr. Moustafa Saad Ibrahim
Educator, Software Engineer, Scientist, Competitive Coach

CSkilled Academy
High Quality With Intensive Practice CS Courses

Rating Distribution

1 stars: 3 votes

2 stars: 2 votes

3 stars: 5 votes

4 stars: 30 votes

5 stars: 233 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!