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

Want to master popular problem-solving techniques, data structures, and algorithms that interviewers love? Dive right in!

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.

Course Content

- Introduction –> 2 lectures • 1min.
- Microsoft Array Question: Container with most water (Medium) –> 6 lectures • 46min.
- Google Array Question: Valid mountain array (Easy) –> 4 lectures • 19min.
- Google Array Question: Boats to save people (Medium) –> 4 lectures • 26min.
- Facebook Array Question: Move Zeroes (Easy) –> 5 lectures • 24min.
- Amazon Array Question: Longest substring without repeating characters (Medium) –> 6 lectures • 57min.
- Arrays Question:Find first and last position of element in sorted Array (Medium) –> 6 lectures • 44min.
- Google Array question: first bad version (Easy) –> 4 lectures • 23min.
- Microsoft Math Question: Missing Number (Easy-ish) –> 7 lectures • 29min.
- Amazon Math Question: Count Primes –> 5 lectures • 33min.
- Airbnb Math Question: Single Number –> 6 lectures • 32min.
- Amazon Math Question: Robot return to origin (Easy) –> 2 lectures • 8min.
- Facebook Math Question: Add Binary (Easy) –> 5 lectures • 26min.
- Google Hash Tables / Dictionaries question: Two Sum (Easy) –> 6 lectures • 34min.
- Google Hash Tables / Dictionaries question: Contains Duplicate –> 3 lectures • 20min.
- Google Hash Tables / Dictionaries question: Majority Element –> 7 lectures • 40min.
- Facebook Hash Tables / Dictionaries question: Group Anagrams (Medium) –> 2 lectures • 20min.
- Hash Tables / Dictionaries question: 4sum 2 (Medium) –> 4 lectures • 29min.
- Microsoft Hash Tables / Dictionaries question: LRU Cache (Medium) –> 5 lectures • 34min.
- Linkedin Hash Tables / Dictionaries question: Minimum Window Substring (Hard) –> 6 lectures • 52min.
- Apple Linked list question: Merge Two Sorted Lists (Easy) –> 4 lectures • 19min.
- Amazon Linked list question: Linked list cycle (Medium) –> 4 lectures • 15min.
- Microsoft Linked list question: Reverse linked list (Easy) –> 4 lectures • 19min.
- Adobe Linked list question: Add two numbers (Medium) –> 5 lectures • 28min.
- Linked list question: Remove Nth node from end of list (Medium) –> 6 lectures • 29min.
- Linked list question: Odd Even linked list (Medium) –> 5 lectures • 26min.
- Google Linked list question: Merge K sorted lists (Hard) –> 2 lectures • 16min.
- Facebook Backtracking question: Subsets (Medium) –> 5 lectures • 27min.
- Amazon Backtracking question: Letter Combination of a Phone Number (Medium) –> 4 lectures • 30min.
- Microsoft Backtracking question: Word Search (Medium) –> 1 lecture • 28min.
- Uber Backtracking question: Combination Sum (Medium) –> 4 lectures • 26min.
- Bloomberg Backtracking question: Palindrome Partitioning (Medium) –> 4 lectures • 31min.
- Microsoft Trees question: Symmetric Trees (Easy) –> 4 lectures • 22min.
- Google Trees question: Maximum Depth of a Binary Tree (Easy) –> 4 lectures • 19min.
- Amazon Trees question: Path Sum (Easy) –> 4 lectures • 21min.
- Facebook Trees question: Lowest Common Ancestor of a Binary Tree (Medium) –> 5 lectures • 23min.
- Google Trees question: Kth Smallest Element In a BST (Medium) –> 3 lectures • 22min.
- Microsoft Trees question: Serialise And Deserialise Binary Tree (Hard) –> 4 lectures • 28min.
- Microsoft Trees question: Binary Tree Maximum Path Sum (Hard) –> 4 lectures • 30min.
- Google Stack Question: Min Stack (Easy) –> 4 lectures • 32min.
- Amazon Stack Question: Valid Parenthesis (Easy) –> 5 lectures • 24min.
- Apple Stack Question: Binary Tree Level Order Traversal (Medium) –> 3 lectures • 19min.
- Microsoft Queue Question: Binary Tree Zigzag Level Order Traversal (Medium) –> 6 lectures • 43min.
- Stack Question: Binary Tree Postorder Traversal (Medium) –> 2 lectures • 14min.
- Google Dynamic Programming Question: House Robber (Easy) –> 5 lectures • 34min.
- Facebook Dynamic Programming Question: Best Time To Buy And Sell Stocks (Easy) –> 5 lectures • 26min.
- Amazon Dynamic Programming Question: Climbing Stairs (Easy) –> 7 lectures • 39min.
- Google Dynamic Programming Question: Coin Change (Medium) –> 5 lectures • 42min.
- Bloomberg Dynamic Programming Question: Unique Paths (Medium) –> 3 lectures • 17min.
- Microsoft Dynamic Programming Question: Longest Palindromic Substring (Medium) –> 6 lectures • 45min.
- Amazon Dynamic Programming Question: Trapping Rain Water (Hard) –> 2 lectures • 28min.

Requirements

- Want to master popular problem-solving techniques, data structures, and algorithms that interviewers love? Dive right in!
- Crave step-by-step explanations for the industry’s hottest interview questions? We’ve got you covered.
- Looking to up your game in competitive programming? Buckle up for a thrilling journey!

**Welcome to the course!**

In this course, **you’ll have a** **detailed, step by step explanation of 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 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 **generalise the patterns** you learn here on other problems.

**Each problem gets multiple videos** :

**Explanation and intuition video(s)**: 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(s)**: where we code the solution discussed in the explanation video together.**Walkthrough video(s):**where we go over each line of code and see what it does

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

The problems are categorised 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 visualisation**).**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.**