Udemy

Platform

English

Language

Other

Category

Master The Coding Interview Questions 2020 in Java & Python

LEETCODE Problems: Two Pointers, Merge Intervals, Sliding Window, Greedy, BFS, DFS, DP... + Algorithms & Data Structures

3.55 (23 reviews)

Students

16 hours

Content

Apr 2020

Last Update
Regular Price

EXCLUSIVE OFFER
Exclusive  Offer
Unlimited access to 30 000 Premium SkillShare courses
30-DAY FREE TRIAL

What you will learn

Learn and master 15 Patterns for coding interviews in JAVA & PYTHON

Learn: Sliding Window Technique, Merge Intervals, Dynamic Programming, Topological Sort, BFS, DFS...

Learn how, when and why we use algorithms and Data Structures in real life

Improve your problem solving skills

Learn tips, tricks, Strategies to solve Coding Interview Problems


Description

Requirements

Some programming language knowledge like Java or Python is recommended, but not essential.

Descriptions

-  This course is for all those people who want to improve their skills on Problem Solving, Algorithms, data structures. From basic to advanced level.

- I expect you to have a basic knowledge on Data Structure, Algorithm, Java or Python language.

Did you spend a lot of time to learn theory, but are still struggling to get an interview or land to your dreaming job?

What if you just focus to learn and master some patterns and applied them to solve many other problems?

This is where this course is coming from. This course will teach you how to solve any interview questions based on the Patterns you will learn.

- In this course I want you to focus on practice because I do believe that it is the better way to master technique for solving coding interview problems. And unlike most courses that just list a ton of problems and give you a solution,

I take you from lessons that teach you the principles and fundamental ideas and problems together.

Step by step coding along so you understand how we do things and most importantly why we do things.

Most of the online tutorial doesn’t do it. They just teach you a lot of theory without practice.

And once you finished you forgot everything you don’t have other choice than buying another online course tutorial and watch it again and over again.

- Here I will teach you step by step theory and practice. Example you learn Stack you will know how and when to use it because we will solve more than 10 coding exercises dedicated to stack you will never forget it.

What will you learn in this course?

You will learn and master 15 Patterns for coding interviews: (More than 150 interview questions + Solutions in Java & Python)

- Pattern 1: Two Pointers Techniques  (7 coding interview questions: 3Sum, Container with most water, Trapping rain water...)

- Pattern 2: Modify In-Place (4 coding interview questions)

- Pattern 3: Sliding Window (10 coding interview questions: Minimum size subarray sum, Longest substring with at most 2 or K distinct chars, Find all Anagrams in a string...)

- Pattern 4: Sorted Array & Binary Search (5 coding interview questions)

- Pattern 6: BFS on Tree & Graph (7 coding interview questions)

- Pattern 7: DFS on Tree & Graph (7 coding interview questions)

- Pattern 8: Heap & Top K elements (5 coding interview questions)

- Pattern 9: Topological Ordering (5 coding interview questions)

- Pattern 5: Merge Intervals (4 coding interview questions)

- Pattern 10: Back-Tracking & Recursion (3 coding interview questions)

- Pattern 11: Greedy (5 interview questions)

- Pattern 12: Dynamic Programming  & Optimization (6 coding interview questions)

- Pattern 13: Connected Component (5 coding interview questions)

- Pattern 14: Math  (4 coding Interview questions)

- Pattern 15: Bitwise: (4 coding Interview questions)

You will improve your problem solving skills

You will learn how, when and why we use algorithms and Data Structures in real life.

You will be able to solve many interview questions for big tech companies: Google, Facebook, Microsoft, Amazon...

You will learn tips, tricks, Strategies to solve interview Problems.

Why enrolling in this course is the best decision you can make.

Other courses focus on theory and give you a very simple examples of interview questions. But, not this course!

This course guides you through the more advanced concept from easy to hard level.

Many hard interview questions most frequently asked by big tech companies are solved in this course.

More than 150 interview Questions solved (Solutions in Java & Python) + Data Structures & Algorithms

Part 1: Basic Algorithms & Data Structures: Array, String, Hash Map, Linked List, Divide & Conquer

- Time complexity & Big O

- 1D ARRAY Manipulations: (4 coding interview questions)

- 2D Array Manipulations: (4 coding interview questions)

- String Manipulation (4 coding interview questions)

- LINKED-LIST: Single and Double Linked List (2 coding interview questions)

- HASHMAP – DICTIONARY – HASH TABLE (5 coding interview questions)

- Divide & Conquer: Searching and Sorting Algorithms (8 coding interview questions)

- Pattern 1: Two Pointers Techniques  (7 coding interview questions)

- Pattern 2: Modify In-Place (4 coding interview questions)

- Pattern 3: Sliding Window (10 coding interview questions)

- Pattern 4: Sorted Array & Binary Search (5 coding interview questions)

- Pattern 5: Merge Intervals (4 coding interview questions)

Part 2: Logical Data Structures: Stack, Queue, Tree, TRIE, Graph, Heaps Data Structures

- STACK: (7 coding interview questions)

- QUEUE and DEQUE: (4 coding interview questions)

- TREE: BINARY TREE (7 coding interview questions)

- TREE: BINARY SEARCH TREE (6 coding interview questions)

- Graph: Graph terminology & Search in graph algorithm (4 coding interview questions)

- TRIE or Prefix Tree: (2 coding interview questions)

- HEAP and PRIORITY QUEUES: (4 coding interview questions)

- Pattern 6: BFS on Tree & Graph (7 coding interview questions)

- Pattern 7: DFS on Tree & Graph (7 coding interview questions)

- Pattern 8: Heap & Top K elements (5 coding interview questions)

- Pattern 9: Topological Ordering (5 coding interview questions)

Part 3: Advanced Algorithms, Data Structures & Analysis Techniques

- Recursion & Backtracking (Base case, complexity, Templates) (4 coding interview questions)

- Advanced Data Structure (3 coding interview questions)

- Pattern 10: Back-Tracking & Recursion (3 coding interview questions)

- Pattern 11: Greedy (5 interview questions)

- Pattern 12: Dynamic Programming  & Optimization (6 coding interview questions)

- Pattern 13: Connected Component (5 coding interview questions)

- Pattern 14: Math  (4 coding Interview questions)

- Pattern 15: Bitwise: (4 coding Interview questions)

Bonus: (20 interview questions)

- Google, Facebook, Amazon, Microsoft: Top 5 most frequently asked questions for each company (Problems + Solutions in Java & Python)

Your instructor, Fred Boundou, Energetic software engineer with 10+ years experience developing robust code for high-volume businesses. Highly familiar with a wide variety of Software Engineering, Database, Web as well as Data Science.

Progressively engage my experience through my passion for creating application using best practice intuitive experience as focus.

Using my diverse skills set in order to provide a super service that will assist a range of clients... I have been working for many Big tech companies include (Microsoft, Boeing...)

This means you are learning from someone who has all the professional training, skills,

and experience you need to teach you how to become master of solving interview questions in the fastest possible way. 

If you are ready to get your first interview with some big tech companies, or to move up to a more senior programming position, then this course is for you!

After completing this course, you will have the necessary skills to be able to apply for software engineer job and you increase career opportunities.

This course will take you from the beginning to advanced level. By the end of this course you will be ready to pass online, or phone interview even in-person interview with the most reputed big tech companies like: Google, Amazon, Facebook, Microsoft.

The sooner you sign up for this course, the sooner you will have the skills and knowledge you need to increase your job or consulting opportunities.

Your new job or consulting opportunity awaits! 

Why are you waiting?  Why not get started today?

Go and take this course right now and be ready for your next phone or in-person interview in 6 weeks.

Click the Signup button to sign up for the course!

Who this course is for:

All levels!


Screenshots

Master The Coding Interview Questions 2020 in Java & Python
Master The Coding Interview Questions 2020 in Java & Python
Master The Coding Interview Questions 2020 in Java & Python
Master The Coding Interview Questions 2020 in Java & Python

Content

Course Outline

Course Outline

Big O Notation

Big O introduction

Arrays

1D Array

2D Array

1D Arrays: Interview Questions & Solutions

Merge Two Sorted Arrays

Remove Element from an Array

Product of Array Except Self

Missing Ranges

2D Array: Interview Questions & Solutions

Transpose Matrix

Toeplitz Matrix

Spiral Matrix

Matrix Layer Rotation

String: Interview Questions & Solutions

Reverse Words in a String

Remove White Space in a String

Convert String to Integer

Linked List

Singly Linked List & Doubly Linked List

Linked List implementation: Basic Operations (Insert, Search, Delete)

Linked List: Interview Questions & Solutions

Remove Duplicates from Sorted Linked List

Swap Nodes in Pairs

Hash Table

Hash Table Introduction

Hash Table: Interview Questions & Solutions

Design Hash Table

First Non Repeating Character in a String

Contains Duplicate Array

Group Anagrams Together

Copy Linked List with Random Pointers

Divide & Conquer

Divide and Conquer Introduction

Binary Search

Binary Search implementation

Merge Sort

Merge Sort implementation

Quick Sort

Quick Sort implementation

Master Theorem

Divide & Conquer: Interview Questions & Solutions

Search Insert Position

Find Peak Element

Merge K Sorted Lists

Sort Linked List (use Merge Sort)

Patterns 1: Two Pointers technique

Two pointers introduction

Move all Zeroes to the beginning

Sort Colors Array (or Dutch National Flag problem)

Two Sum Input Array Sorted

Find Cycle in Linked List

3Sum

Container with most Water

Trapping Rain Water

Pattern 2: Modify In-Place

Reverse String in-place

Reverse Linked List

Reorder Linked List

Rotate Image in-place

Pattern 3: Sliding Window

Sliding Window Introduction

Maximum Subarray of size K

Minimum size Subarray Sum

Fruits into Basket

Longest substring with at most 2 distinct chars

Longest substring with at most K distinct chars

Longest substring without repeating chars

Minimum Window Substring

Find All Anagrams in a String

Permutation String

Pattern 4: Binary Search on sorted Array

Find first and last position of elements in sorted Array

Search in Rotated Sorted Array

Search in Rotated Sorted Array with duplicates

Find Minimum in Rotated Sorted Array

Search a 2D Matrix

Pattern 5: Merge Intervals

Merge Intervals introduction

Merge Intervals

Insert Intervals

Meeting Rooms

Meeting Rooms II

Stack Data Structures

Stack introduction

Stack: Interview Questions & Solutions

Design Stack

Design Min-Stack (in constant time)

Implement Queue using Stack

Evaluate reverse polish notation

Validate Parentheses

Decode String

Basic Calculator

Queue Data Structures

Queue introduction

Queue: Interview Questions & Solutions

Design Queue

Implement Stack using Queue

Design Circular Queue

Design Circular Deque

Binary Tree

Tree introduction

Binary Tree introduction

Binary Tree: Interview Questions & Solutions

Pre-order Traversal (recursive & iterative) implementation

In-order Traversal (recursive & iterative) implementation

Post-order Traversal (recursive & iterative) implementation

Symmetric Tree

Max Depth of Binary Tree

Sub-Tree of another

LCA of BT

Binary Search Tree

Binary Search tree introduction

Binary Search Tree: Interview Questions & Solutions

Insert node in BST

Search node in BST

Delete node in BST

In-order Successor in Binary search tree

Validate Binary Search Tree

Balanced Binary Tree

Graph

Graph Terminology

Breadth First Search or BFS

Depth First Search or DFS

Topological Sort

Graph: Interview Questions & Solutions

BFS Implementation

DFS Implementation

Implement Topological Sort

Clone Graph

Trie (or Prefix Tree)

Trie introduction

Trie: Interview Questions & Solutions

Implement or Design Trie

Word Search II Problem

Heap Data Structures

Heap introduction

Heap: Interview Questions & Solutions

Sort Characters By Frequency

Find Kth Smallest number in Array

K Closest Points to Origin

Pattern 6: BFS on Tree and Graph

Binary Tree Zigzag Level Order Traversal

Populating Next Right Pointers in Each Node II

All Nodes Distance K in Binary Tree

Shortest Distance from All Buildings

Wall and Gates

Pattern 7: DFS on Tree and Graph

Path Sum

Diameter of Binary Tree

Max Area of Island

Word Search

Binary Tree Maximum Path Sum

Pattern 8: Heap & Top K elements

Merge K sorted Linked List

Top K frequent elements in array of numbers

Find Kth largest element in an Array

Pattern 9: Topological Ordering

Topological Sort Template

Course Schedule I

Course Schedule II

Alien Dictionary

Sequence Reconstruction

Recursion & Backtracking: Interview Questions & Solutions

Introduction to Recursion & Backtracking

Reverse String

Generate Parentheses

N-Queens

Pattern 10: Back-Tracking & Recursion

Combination Sum

Subset

Permutation

Pattern 11: Greedy

Greedy introduction

Gas Station problem

Candy

Jump Game

Pattern 12: Union Find

Introduction to Disjoint Set or Union Find Data Structures

Number of connected components in an Undirected Graph

Graph Valid Tree

Detect Cycle

Pattern 13: Maths

Add Digit

Palindrome Number

Plus One

Pattern 14: Bitwise

Single Number

Missing Number

Pattern 12: Dynamic Programming & Optimization

Introduction to Dynamic Programming

Longest Increasing Subsequence

Climbing Stairs

Word Break

Bonus

Google Interview Questions & Solutions

Amazon Interview Questions & Solutions

Facebook Interview Questions & Solutions


Reviews

S
Shayan14 March 2021

The course is awful! Instructor does not bother to explain anything, and even if he does, it's very difficult to understand what he's saying !

A
Abul11 April 2020

This is like the most worst course you can possible get! I wonder how in the world Udemy allows courses like this??? This guy reads code like he is reading eulogy at the funeral of programming world! I mean come on Udemy!!!

P
Piyush27 February 2020

Video keeps breaking in between due to adobe flash errors, not sure this is udemy problem, or course problem. Also the voice is not clear and explanations of the code are poor, none of the code is actually run, the guy just reads the code as we see it.

K
Kevin22 January 2020

Great Course! Very concise with detailed explanations and helpful interview questions example. The Course is Neat and Ordered with a real world examples. And explains it very well. All the concepts are clearly explained, deep knowledge of author is well appreciated. I have recommended to few my friends and most of them likes it as well. It's been a very great experience.

M
Martin21 January 2020

Excellent course, Clear and concise. Explained properly and examples are very good. Put very good examples to explain those topics. The pacing is great, and the methodical way the content is delivered gives you lots of opportunity to benefit from repetition of key concepts without going overboard and feeling competitive. Thanks for the effort. Highly recommend!


2743488

Udemy ID

1/7/2020

Course created date

2/8/2020

Course Indexed date
Bot
Course Submitted by

Twitter
Telegram