Leetcode In Python 50 Algorithms Coding Interview Questions

Practice data structure and algorithms questions for interviews at FAANG companies like Google, Facebook, Apple & Amazon

Last updated 2022-01-10 | 4.6

- Solve Easy to Hard Difficulty problems using different data structures and algorithms
- How to solve some of the most popular interview questions asked by major tech companies
- Breaking down the coding interview problems in a step by step
- systematic manner

What you'll learn

Solve Easy to Hard Difficulty problems using different data structures and algorithms
How to solve some of the most popular interview questions asked by major tech companies
Breaking down the coding interview problems in a step by step
systematic manner
Popular problems patterns
Algorithms and data structures
Strengthen your problem solving and programming skills

* Requirements

* Basic Knowledge of fundamental data structures and algorithms is preferred
* Basic Knowledge of python is preferred
* If you want to submit the code yourself
* you should be familiar with leetcode and have an account

Description

  • Getting ready for your software engineering coding interview? This is the place for you.

  • Want to learn about the most popular problem-solving techniques, patterns, data structures, and algorithms used in those difficult interviews? Come on in

  • Want a step by step explanation of 50 of the most popular interview questions in the industry? You got it.

  • Want to get better at competitive programming? Enjoy the ride


Welcome to the course!

In this course, you'll have a detailed, step by step explanation of 50 hand-picked LeetCode questions where you'll learn about the most popular techniques and problems used in the coding interview, This is the course I wish I had when I was doing my interviews. and it comes with a 30-day money-back guarantee


What is LeetCode?

LeetCode is essentially a huge repository of real interview questions asked by the most popular tech companies ( Google, Amazon, Facebook, Microsoft, and more ).

The problem with LeetCode is also its advantage, IT'S HUGE, so huge in fact that interviewers from the most popular companies often directly ask questions they find on LeetCode, So it's hard to navigate through the huge amount of problems to find those that really matter, this is what this course is for.

I spent countless hours on LeetCode and I'm telling you that you don't have to do the same and still be able to get a job at a major tech company.

Course overview :

In this course, I compiled 50 of the most important and the most popular interview questions asked by these major companies and I explain them, in a true STEP BY STEP fashion to help you understand exactly how to solve these types of questions.

The problems are handpicked to ensure complete coverage of the most popular techniques, data structures, and algorithms used in interviews so you can generalize the patterns you learn here on other problems.


Each problem gets 2 videos :

  • Explanation video: we do a detailed explanation of the problems and its solution, this video will be longer because we will do a step by step explanation for the problems.

  • Coding video: where we code the solution discussed in the explanation video together.


We will use basic python for this course to code our solutions, previous knowledge in python is preferred but NOT required for the coding part of the course.


The problems are categorized for easier navigation and will be regularly updated with more popular and interesting problems.


Some of the stuff this course will cover are :


  • Arrays and Strings interview questions.


  • Searching interview questions and algorithms.


  • Dynamic Programming interview questions.


  • Backtracking interview questions (  With step by step visualization ).


  • Trees and Graphs interview questions and algorithms.


  • Data structures Like Stacks, Queues, Maps, Linked Lists, and more.


In other words, this course is your one-stop-shop for your dream job.



Who this course is for:

  • Developers eager to pass the coding interview at huge companies like Google, Facebook, Microsoft, Amazon, etc.
  • People who want to develop their problem solving skills.
  • Developers getting ready for their technical interviews.
  • Students getting ready for their internship coding interviews.
  • People who want to get better at competitive coding

Course content

21 sections • 184 lectures

Introduction Preview 01:35

How to use this course Preview 01:55

What to do if you don't understand an explanation or code video (Important) Preview 00:37

Utilize the video format of online courses Preview 00:11

Big O Introduction Preview 04:23

Big O Exercises Preview 06:16

Formalizing Big O Preview 09:19

Big O Simplification Preview 05:32

Space complexity Preview 04:50

Logarithms Preview 06:29

Explanation - Move Zeroes - Easy #283 Preview 09:08

Code - Move Zeroes - Easy #283 Preview 02:28

[Custom Input - NEW] - Move Zeroes Preview 02:33

Explanation - Boats to Save People - Medium #881 Preview 11:58

Code - Boats to Save People - Medium #881 Preview 03:58

[Custom Input - NEW] - Boats to save people Preview 05:39

Explanation - Valid Mountain Array - Easy #941 Preview 10:20

Code - Valid Mountain Array - Easy #941 Preview 03:49

[Custom Input - NEW] - Valid Mountain Array Preview 02:32

Explanation - Container With Most Water - Medium #11 Preview 11:39

Code - Container With Most Water - Medium #11 Preview 04:59

[Custom Input - NEW] - Container with most water Preview 04:29

Explanation - Longest Substring Without Repeating Characters - Medium #3 Preview 12:00

Code - Longest Substring Without Repeating Characters - Medium #3 Preview 02:50

[Custom Input - NEW] - Longest Substring Without repeating characters Preview 01:38

Explanation - Find First and Last Position of Element in Sorted Array-Medium #34 Preview 17:34

Code - Find First and Last Position of Element in Sorted Array - Medium #34 Preview 09:23

[Custom Input - NEW] - Find first and last position of element in sorted array Preview 03:02

Explanation - First Bad Version - Easy #278 Preview 07:25

Code - First Bad Version - Easy #278 Preview 03:33

[Custom Input - NEW] - First Bad Version - Easy #278 Preview 05:54

Explanation - Missing Number - Easy #268 Preview 08:37

Code - Missing Number - Easy #268 Preview 01:47

[Custom Input - NEW] - Missing Number - Easy #268 Preview 01:33

Explanation - Count Primes - Easy #204 Preview 04:59

Code - Count Primes - Easy #204 Preview 03:43

[Custom Input - NEW] - Count Primes - Easy #204 Preview 01:28

Explanation - Single Number - Easy #136 Preview 05:04

Code - Single Number - Easy #136 Preview 00:54

[Custom Input - NEW] - Single Number - Easy#136 Preview 00:59

Explanation - Robot Return to Origin - Easy #657 Preview 03:07

Code - Robot Return to Origin - Easy #657 Preview 01:53

[Custom Input - NEW] - Robot Return to Origin - Easy #657 Preview 02:02

Explanation - Add Binary - Easy #67 Preview 06:13

Code - Add Binary - Easy #67 Preview 05:18

[Custom Input - NEW] - Add Binary - Easy #67 Preview 02:23

[ IMPORTANT ] - Hash tables section is getting major revampes and updates Preview 00:06

What are hash tables ? Preview 05:32

Collision handling Preview 07:05

Collision handling techniques comparison Preview 03:47

Explanation - Two Sum - Easy #1 Preview 06:50

Code - Two Sum - Easy #1 Preview 02:25

[Custom Input] - Two Sum - Easy #1 Preview 02:12

Explanation - Contains Duplicate - Easy #217 Preview 04:59

Code - Contains Duplicate - Easy #217 Preview 02:05

[Custom Input] - Contains Duplicate - Easy #217 Preview 01:42

Explanation - Majority Element - Easy #169 Preview 03:40

Code - Majority Element - Easy #169 Preview 01:53

[Custom Input] - Majority Element - Easy #169 Preview 03:22

Explanation - Group Anagrams - Medium #49 Preview 06:05

Code - Group Anagrams - Medium #49 Preview 03:43

[Custom Input] - Group Anagrams - Medium #49 Preview 03:15

Explanation - 4Sum II - Medium #454 Preview 09:02

Code - 4Sum II - Medium #454 Preview 04:35

[Custom Input] - 4Sum II - Medium #454 Preview 05:46

Explanation - LRU Cache - Medium #146 Preview 14:34

Code - LRU Cache - Medium #146 Preview 04:48

[Custom Input] - LRU Cache - Medium #146 Preview 04:09

[IMPORTANT] minimum window substring is getting revamped Preview 00:17

Explanation - Minimum Window Substring - Hard #76 Preview 20:08

Code - Minimum Window Substring - Hard #76 Preview 10:19

What are Linked Lists ? Preview 07:29

Singly linked list creation implementation Preview 05:01

Singly linked list insertion implementation Preview 07:31

Singly linked list deletion implementation Preview 04:28

Doubly Linked Lists Preview 02:58

Doubly linked lists creation implementation Preview 08:44

Doubly linked lists insertion implementation Preview 10:22

Doubly linked list deletion implementation Preview 08:46

Explanation - Merge Two Sorted Lists - Easy #21 Preview 07:10

Code - Merge Two Sorted Lists - Easy #21 Preview 05:21

[Custom Input - NEW] - Merge Two Sorted Lists - Easy #21 Preview 06:01

Explanation - Linked List Cycle - Easy #141 Preview 04:50

Code - Linked List Cycle - Easy #141 Preview 01:54

[Custom Input - NEW] - Linked List Cycle - Easy #141 Preview 04:40

Explanation - Reverse Linked List - Easy #206 Preview 08:29

Code - Reverse Linked List - Easy #206 Preview 02:09

[Custom Input - NEW] - Reverse Linked List - Easy #206 Preview 04:11

Explanation - Add Two Numbers - Medium #2 Preview 09:52

Code - Add Two Numbers - Medium #2 Preview 04:48

[Custom Input - NEW] - Add Two Numbers - Medium #2 Preview 06:40

Explanation - Remove Nth Node From End of List - Medium #19 Preview 07:27

Code - Remove Nth Node From End of List - Medium #19 Preview 02:35

[Custom Input - NEW] - Remove Nth Node From End of List - Medium #19 Preview 04:35

Explanation - Odd Even Linked List - Medium #328 Preview 07:37

Code - Odd Even Linked List - Medium #328 Preview 04:03

[Custom Input - NEW] - Odd Even Linked List - Medium #328 Preview 05:32

Explanation - Merge K Sorted Lists - Hard #23 Preview 09:25

Code - Merge K Sorted Lists - Hard #23 Preview 08:01

Explanation - Subsets - Medium #78 Preview 22:24

Code - Subsets - Medium #78 Preview 03:02

Explanation - Letter Combinations of a Phone Number - Medium #17 Preview 20:00

Code - Letter Combinations of a Phone Number - Medium #17 Preview 06:01

Explanation - Word Search - Medium #79 Preview 28:23

Code - Word Search - Medium #79 Preview 09:08

Explanation - Combination Sum - Medium #39 Preview 28:59

Code - Combination Sum - Medium #39 Preview 03:50

[IMPORTANT] palindrome partitioning is getting revamped Preview 00:15

Explanation - Palindrome Partitioning - Medium #131 Preview 11:58

Code - Palindrome Partitioning - Medium #131 Preview 05:28

What are stacks ? Preview 04:02

Stacks Implementation Preview 02:42

What are Queues Preview 03:27

Queues Implementation Preview 02:16

Interview Questions section is section 20 (but still watch in order) Preview 00:10

What are Graphs ? Preview 04:04

Directed Graph Implementation - Adjacency List Preview 07:56

Directed Graph Implementation - Adjacency Matrix Preview 10:13

Undirected Graph Implementation - Adjacency List Preview 07:28

Undirected Graph Implementation - Adjacency Matrix Preview 06:11

Dijkstra's Algorithm Preview 11:12

Explanation - network delay time - Medium #743 Preview 08:12

Code - network delay time - Medium #743 Preview 08:54

What are trees ? Preview 11:39

Trees Implementation Preview 03:32

In-order Traversal Technique Preview 04:22

In-order traversal implementation Preview 04:47

Pre-order Traversal Technique Preview 04:04

Pre-order traversal implementation Preview 03:19

Post-order Traversal Technique Preview 03:53

Post-order traversal implementation Preview 03:19

[ IMPORTANT ] This Binary Search Tree section is getting revamped Preview 00:10

What is a binary search tree (BST) Preview 06:43

Binary Search tree creation and insertion implementation Preview 10:45

Binary search tree searching Implementation Preview 06:30

BInary search tree deletion implementation Preview 07:09

Explanation - Symmetric Trees - Easy #101 Preview 08:29

Code - Symmetric Trees - Easy #101 Preview 02:44

Explanation - Maximum Depth of Binary Tree - Easy #104 Preview 12:03

Code - Maximum Depth of Binary Tree - Easy #104 Preview 02:14

Explanation - Path Sum - Easy #112 Preview 06:30

Code - Path Sum - Easy #112 Preview 02:35

Explanation- Lowest Common Ancestor of a Binary Tree - Medium #236 Preview 14:45

Code- Lowest Common Ancestor of a Binary Tree - Medium #236 Preview 03:04

Explanation - Kth Smallest Element in a BST - Medium #230 Preview 10:29

Code - Kth Smallest Element in a BST - Medium #230 Preview 01:56

Explanation - Serialize and Deserialize Binary Tree - hard #297 Preview 11:00

Code - Serialize and Deserialize Binary Tree - hard #297 Preview 05:19

Explanation - Binary Tree Maximum Path Sum - Hard #124 Preview 23:44

Code - Binary Tree Maximum Path Sum - Hard #124 Preview 03:27

This section previous location in the course Preview 00:22

Explanation - Min Stack - Easy #155 Preview 06:06

Code - Min Stack - Easy #155 Preview 02:27

Explanation - Valid Parenthesis - Easy #20 Preview 09:18

Code - Valid Parenthesis - Easy #20 Preview 04:18

Explanation - Binary Tree Level Order Traversal - Medium #102 Preview 10:53

Code - Binary Tree Level Order Traversal - Medium #102 Preview 03:22

Explanation - Binary Tree Zigzag Level Order Traversal - Medium #103 Preview 14:43

Code - Binary Tree Zigzag Level Order Traversal - Medium #103 Preview 04:05

Explanation - Binary Tree Postorder Traversal - Medium #145 Preview 10:27

Code - Binary Tree Postorder Traversal - Medium #145 Preview 02:13

What is Dynamic Programming ? Preview 06:51

Explanation - House Robber - Easy #198 Preview 06:43

Code - House Robber - Easy #198 Preview 03:56

Explanation - Best Time to Buy and Sell Stock - Easy #121 Preview 08:34

Code - Best Time to Buy and Sell Stock - Easy #121 Preview 02:12

Explanation - Climbing Stairs - Easy #70 Preview 04:51

Code - Climbing Stairs - Easy #70 Preview 03:04

Explanation - Coin Change - Medium #322 Preview 13:03

Code - Coin Change - Medium #322 Preview 04:03

Explanation - Unique Paths - Medium #62 Preview 08:41

Code - Unique Paths - Medium #62 Preview 03:17

Explanation - Longest Palindromic Substring - Medium #5 Preview 22:43

Code - Longest Palindromic Substring - Medium #5 Preview 04:24

Explanation - Trapping Rain Water - Hard #42 Preview 21:54

Code - Trapping Rain Water - Hard #42 Preview 04:21