Udemy - LeetCode In Python: 50 Algorithms Coding Interview Questions
Description
Getting ready for your software engineering coding interview? This is the place for you.
Want to learn about the most popular techniques, patterns, data structures and algorithms used in those difficult interviews? This is the place for you.
Want a step by step explanation of 50 of the most popular interview questions in the industry? This is the place for you.
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.
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 :
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.
Searching.
Dynamic Programming.
Backtracking ( With step by step visualization ).
Trees and Graphs.
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 interviews.
- Students getting ready for their internship interviews.
Course content
- Introduction
- Introduction
- How to use this course
- What to do if you don't understand an explanation or code video (Important)
- Utilize the video format of online courses
- Big O Notation (OPTIONAL)
- Big O Introduction
- Big O Exercises
- Formalizing Big O
- Big O Simplification
- Space complexity
- Logarithms
- Binary Search (OPTIONAL)
- Binary Search Algorithm
- Binary Search Implementation
- Sliding Window (OPTIONAL)
- Sliding Window Technique
- Sliding Window Implementation
- Arrays and Strings Interview Questions
- Explanation - Move Zeroes - Easy #283
- Code - Move Zeroes - Easy #283
- Explanation - Boats to Save People - Medium #881
- Code - Boats to Save People - Medium #881
- Explanation - Valid Mountain Array - Easy #941
- Code - Valid Mountain Array - Easy #941
- Explanation - Container With Most Water - Medium #11
- Code - Container With Most Water - Medium #11
- Explanation - First Bad Version - Easy #278
- Code - First Bad Version - Easy #278
- Explanation - Longest Substring Without Repeating Characters - Medium #3
- Code - Longest Substring Without Repeating Characters - Medium #3
- Explanation - Find First and Last Position of Element in Sorted Array-Medium #34
- Code - Find First and Last Position of Element in Sorted Array - Medium #34
- Math Interview Questions
- Explanation - Missing Number - Easy #268
- Code - Missing Number - Easy #268
- Explanation - Count Primes - Easy #204
- Code - Count Primes - Easy #204
- Explanation - Single Number - Easy #136
- Code - Single Number - Easy #136
- Explanation - Robot Return to Origin - Easy #657
- Code - Robot Return to Origin - Easy #657
- Explanation - Add Binary - Easy #67
- Code - Add Binary - Easy #67
- Hash Tables (OPTIONAL)
- What are hash tables ?
- Collision handling
- Collision handling techniques comparison
- Hash Tables/Maps Interview Questions
- Explanation - Two Sum - Easy #1
- Code - Two Sum - Easy #1
- Explanation - Contains Duplicate - Easy #217
- Code - Contains Duplicate - Easy #217
- Explanation - Majority Element - Easy #169
- Code - Majority Element - Easy #169
- Explanation - Group Anagrams - Medium #49
- Code - Group Anagrams - Medium #49
- Explanation - 4Sum II - Medium #454
- Code - 4Sum II - Medium #454
- Explanation - LRU Cache - Medium #146
- Code - LRU Cache - Medium #146
- Explanation - Minimum Window Substring - Hard #76
- Code - Minimum Window Substring - Hard #76
- Stacks and Queues (OPTIONAL)
- What are stacks ?
- Stack Implementation
- What are queues ?
- Queues Implementation
- Stacks and Queues Interview Questions
- Explanation - Min Stack - Easy #155
- Code - Min Stack - Easy #155
- Explanation - Valid Parenthesis - Easy #20
- Code - Valid Parenthesis - Easy #20
- Explanation - Binary Tree Level Order Traversal - Medium #103
- Code - Binary Tree Level Order Traversal - Medium #103
- Explanation - Binary Tree Zigzag Level Order Traversal - Medium #103
- Code - Binary Tree Zigzag Level Order Traversal - Medium #103
- Explanation - Binary Tree Postorder Traversal - Hard #145
- Code - Binary Tree Postorder Traversal - Hard #145
- Linked Lists (OPTIONAL)
- What are Linked Lists ?
- Singly linked list creation implementation
- Singly linked list insertion implementation
- Singly linked list deletion implementation
- Doubly Linked Lists
- Doubly linked lists creation implementation
- Doubly linked lists insertion implementation
- Doubly linked list deletion implementation
- Linked Lists Interview Questions
- Explanation - Merge Two Sorted Lists - Easy #21
- Code - Merge Two Sorted Lists - Easy #21
- Explanation - Linked List Cycle - Easy #141
- Code - Linked List Cycle - Easy #141
- Explanation - Reverse Linked List - Easy #206
- Code - Reverse Linked List - Easy #206
- Explanation - Add Two Numbers - Medium #2
- Code - Add Two Numbers - Medium #2
- Explanation - Remove Nth Node From End of List - Medium #19
- Code - Remove Nth Node From End of List - Medium #19
- Explanation - Odd Even Linked List - Medium #328
- Code - Odd Even Linked List - Medium #328
- Explanation - Merge K Sorted Lists - Hard #23
- Code - Merge K Sorted Lists - Hard #23
- Backtracking / Recursion Interview Questions
- Explanation - Subsets - Medium #78
- Code - Subsets - Medium #78
- Explanation - Word Search - Medium #79
- Code - Word Search - Medium #79
- Explanation - Combination Sum - Medium #39
- Code - Combination Sum - Medium #39
- Explanation - Letter Combinations of a Phone Number - Medium #17
- Code - Letter Combinations of a Phone Number - Medium #17
- Explanation - Palindrome Partitioning - Medium #131
- Code - Palindrome Partitioning - Medium #131
- Graphs Introduction (OPTIONAL)
- What are Graphs ?
- Directed Graph Implementation - Adjacency List
- Directed Graph Implementation - Adjacency Matrix
- Undirected Graph Implementation - Adjacency List
- Undirected Graph Implementation - Adjacency Matrix
- Depth First Search (DFS) - OPTIONAL
- Depth First Search (DFS)
- DFS implementation
- Breadth First Search (BFS) - OPTIONAL
- Breadth First Search (BFS)
- BFS Implementation
- Dijkstra's Algorithm - OPTIONAL
- Dijkstra's Algorithm
- Explanation - network delay time - Medium #743
- Code - network delay time - Medium #743
- Trees (OPTIONAL)
- What are trees ?
- Trees Implementation
- Trees traversal techniques (in-order,pre-order,post-order)
- In-order traversal implementation
- Pre-order traversal implementation
- Post-order traversal implementation
- Binary Search Trees (BST) - OPTIONAL
- What is a binary search tree (BST)
- Binary Search tree creation and insertion implementation
- Binary search tree searching Implementation
- BInary search tree deletion implementation
- Trees and Graphs Interview Questions
- Explanation - Symmetric Trees - Easy #101
- Code - Symmetric Trees - Easy #101
- Explanation - Maximum Depth of Binary Tree - Easy #104
- Code - Maximum Depth of Binary Tree - Easy #104
- Explanation - Path Sum - Easy #112
- Code - Path Sum - Easy #112
- Explanation- Lowest Common Ancestor of a Binary Tree - Medium #236
- Code- Lowest Common Ancestor of a Binary Tree - Medium #236
- Explanation - Kth Smallest Element in a BST - Medium #230
- Code - Kth Smallest Element in a BST - Medium #230
- Explanation - Serialize and Deserialize Binary Tree - hard #297
- Code - Serialize and Deserialize Binary Tree - hard #297
- Explanation - Binary Tree Maximum Path Sum - Hard #124
- Code - Binary Tree Maximum Path Sum - Hard #124
- Dynamic Programming (DP) Interview Questions
- What is Dynamic Programming ?
- Explanation - House Robber - Easy #198
- Code - House Robber - Easy #198
- Explanation - Best Time to Buy and Sell Stock - Easy #121
- Code - Best Time to Buy and Sell Stock - Easy #121
- Explanation - Climbing Stairs - Easy #70
- Code - Climbing Stairs - Easy #70
- Explanation - Coin Change - Medium #322
- Code - Coin Change - Medium #322
- Explanation - Unique Paths - Medium #62
- Code - Unique Paths - Medium #62
- Explanation - Longest Palindromic Substring - Medium #5
- Code - Longest Palindromic Substring - Medium #5
- Explanation - Trapping Rain Water - Hard #42
- Code - Trapping Rain Water - Hard #42
