Leetcode In Swift – Algorithms Coding Interview Questions

Free Download Leetcode In Swift – Algorithms Coding Interview Questions
Published 12/2023
MP4 | Video: h264, 1920×1080 | Audio: AAC, 44.1 KHz
Language: English | Size: 3.90 GB | Duration: 23h 37m
Practice data structure and algorithms questions for interviews at FAANG companies like Google, Facebook, Apple & Amazon

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
Requirements
Basic Knowledge of fundamental data structures and algorithms is preferred
Basic Knowledge of Swift is preferred
Description
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 guaranteeWhat 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 doesWe 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.
Overview
Section 1: Introduction
Lecture 1 What to do if you don’t understand an explanation or code video (Important)
Lecture 2 Utilise the video format of online courses
Section 2: Microsoft Array Question: Container with most water (Medium)
Lecture 3 Introduction to the problem
Lecture 4 Brute Force solution Intuition
Lecture 5 pseudocode walkthrough
Lecture 6 Better Approach intuition
Lecture 7 Approach 2 Pseudocode walkthrough
Lecture 8 Implementing the code
Section 3: Google Array Question: Valid mountain array (Easy)
Lecture 9 Introduction to the problem
Lecture 10 How to think about this problem
Lecture 11 Pseudocode Walkthrough
Lecture 12 Implementing the code
Section 4: Google Array Question: Boats to save people (Medium)
Lecture 13 Problem Introduction
Lecture 14 How to intuitively think about this problem
Lecture 15 Pseudocode Walkthrough
Lecture 16 Implementing the code
Section 5: Facebook Array Question: Move Zeroes (Easy)
Lecture 17 Brute force Intuition
Lecture 18 Brute force pseudocode walkthrough
Lecture 19 Better Approach Intuition
Lecture 20 Better Approach Pseudocode walkthrough
Lecture 21 Implementing the code
Section 6: Amazon Array Question: Longest substring without repeating characters (Medium)
Lecture 22 Introduction to the problem
Lecture 23 Brute Force Intuition
Lecture 24 Pseudocode walkthrough
Lecture 25 Approach 2 Intuition
Lecture 26 Approach 2 pseudocode walkthrough
Lecture 27 Implementing the code
Section 7: Arrays Question:Find first and last position of element in sorted Array (Medium)
Lecture 28 Introduction to the problem and brute force approach
Lecture 29 Brute force Pseudocode walkthrough
Lecture 30 Approach 2: Optimal Approach intuition
Lecture 31 Pseudocode walkthrough part 1
Lecture 32 Pseudocode walkthrough part 2
Lecture 33 Implementing the code
Section 8: Google Array question: first bad version (Easy)
Lecture 34 Introduction To The Problem And Brute Force Approach
Lecture 35 Optimal Solution Intuition
Lecture 36 Optimal solution pseudocode walkthrough
Lecture 37 Implementing the code
Section 9: Microsoft Math Question: Missing Number (Easy-ish)
Lecture 38 Introduction to the problem
Lecture 39 Approach 1: Brute Force Approach
Lecture 40 Approach 2: A Better Approach Explanation
Lecture 41 PseudoCode Walkthrough For Approach 2
Lecture 42 Implementing the code
Lecture 43 Approach 3: Optimal Approach
Lecture 44 Implementing the optimal approach
Section 10: Amazon Math Question: Count Primes
Lecture 45 Problem Introduction And Brute Force Explanation
Lecture 46 Pseudocode Walkthrough For Brute Force Approach
Lecture 47 Approach 2: Optimal solution
Lecture 48 Pseudocode Walkthrough For Optimal Approach
Lecture 49 Code Implementation
Section 11: Airbnb Math Question: Single Number
Lecture 50 Introduction to the problem and brute force approach
Lecture 51 Pseudocode walkthrough for brute approach
Lecture 52 Approach 2: better Approach
Lecture 53 Implementing the code
Lecture 54 Approach 3: optimal approach
Lecture 55 Implementing the optimal approach
Section 12: Amazon Math Question: Robot return to origin (Easy)
Lecture 56 Explaining the problem
Lecture 57 Implementing the code
Section 13: Facebook Math Question: Add Binary (Easy)
Lecture 58 Introduction to the problem
Lecture 59 Examples of binary additions
Lecture 60 Pseudocode Implementation
Lecture 61 Pseudocode Walkthrough
Lecture 62 Implementing the code
Section 14: Google Hash Tables / Dictionaries question: Two Sum (Easy)
Lecture 63 Approach 1: Introduction to the problem and brute force approach
Lecture 64 Brute force Pseudocode Implementation
Lecture 65 Pseudocode Walkthrough
Lecture 66 Approach 2: Optimal Approach Explanation
Lecture 67 Pseudocode Walkthrough
Lecture 68 Code Implementation
Section 15: Google Hash Tables / Dictionaries question: Contains Duplicate
Lecture 69 Introduction to the problem and multiple approaches
Lecture 70 Optimal Approach
Lecture 71 Code Implementation
Section 16: Google Hash Tables / Dictionaries question: Majority Element
Lecture 72 Approach 1 Intuition
Lecture 73 Approach 1 Pseudocode Walkthrough
Lecture 74 Approach 2 – Majority Element Intuition
Lecture 75 Implementing Approach 2 code
Lecture 76 Approach 3 Intuition – Optimal solution
Lecture 77 Approach 3 Walkthrough – Optimal solution
Lecture 78 Implementing Approach 3 (optimal approach)
Section 17: Facebook Hash Tables / Dictionaries question: Group Anagrams (Medium)
Lecture 79 Explanation – Group Anagrams – Medium #49
Lecture 80 Code – Group Anagrams – Medium #49
Section 18: Hash Tables / Dictionaries question: 4sum 2 (Medium)
Lecture 81 Brute force Explanation
Lecture 82 Brute Force Pseudocode Walkthrough
Lecture 83 Approach 2: Optimal approach
Lecture 84 Implementing the code
Section 19: Microsoft Hash Tables / Dictionaries question: LRU Cache (Medium)
Lecture 85 Introduction to the problem
Lecture 86 Input/Ouput for the problem
Lecture 87 Intuition behind the problem
Lecture 88 Pseudocode implementation
Lecture 89 Pseudocode Walkthrough
Section 20: Linkedin Hash Tables / Dictionaries question: Minimum Window Substring (Hard)
Lecture 90 Explanation – Minimum Window Substring – part 1
Lecture 91 Explanation – Minimum window substring – part 2
Lecture 92 Explanation – Minimum window substring – part 3
Lecture 93 Pseudocode Implementation
Lecture 94 Pseudocode Walkthrough
Lecture 95 Code – Minimum Window Substring – Hard #76
Section 21: Apple Linked list question: Merge Two Sorted Lists (Easy)
Lecture 96 Explanation – Merge Two Sorted Lists – Easy #21
Lecture 97 Implementation – Merge Two Sorted Lists – Easy #21
Lecture 98 Walkthrough – Merge Two Sorted Lists – Easy #21
Lecture 99 Code – Merge Two Sorted Lists – Easy #21
Section 22: Amazon Linked list question: Linked list cycle (Medium)
Lecture 100 Explanation – Linked List Cycle – Easy #141
Lecture 101 Intuition – Linked List Cycle – Easy #141
Lecture 102 Walkthrough – Linked List Cycle – Easy #141
Lecture 103 Code – Linked List Cycle – Easy #141
Section 23: Microsoft Linked list question: Reverse linked list (Easy)
Lecture 104 Explanation – Reverse Linked List
Lecture 105 Intuition – Reverse Linked List
Lecture 106 pseudocode Implementation & Walkthrough – Reverse Linked List
Lecture 107 Implementing the code – Reverse Linked List
Section 24: Adobe Linked list question: Add two numbers (Medium)
Lecture 108 Explanation – Add Two Numbers
Lecture 109 Intuition – Add Two Numbers
Lecture 110 Implementation – Add Two Numbers
Lecture 111 Walkthrough – Add Two Numbers – Medium #2
Lecture 112 Code – Add Two Numbers
Section 25: Linked list question: Remove Nth node from end of list (Medium)
Lecture 113 Explanation – Remove Nth Node From End of List
Lecture 114 Intuition – Remove Nth Node From End of List
Lecture 115 Walkthrough – Remove Nth Node From End of List
Lecture 116 Approach 2 Explanation – Remove Nth Node From End of List
Lecture 117 Approach 2 Walkthrough – Remove Nth Node From End of List – Medium #19
Lecture 118 Code – Remove Nth Node From End of List
Section 26: Linked list question: Odd Even linked list (Medium)
Lecture 119 Explanation – Odd Even Linked List
Lecture 120 Intuition – Odd Even Linked List
Lecture 121 Implementation – Odd Even Linked List
Lecture 122 Walkthrough – Odd Even Linked List
Lecture 123 Code – Odd Even Linked List
Section 27: Google Linked list question: Merge K sorted lists (Hard)
Lecture 124 Explanation – Merge K Sorted Lists – Hard #23
Lecture 125 Code – Merge K Sorted Lists – Hard #23
Section 28: Facebook Backtracking question: Subsets (Medium)
Lecture 126 Explanation – Subsets
Lecture 127 Cascading solution explanation – Subsets
Lecture 128 Cascading solution walkthrough – Subsets
Lecture 129 Backtracking Approach 2 explanation – Subsets
Lecture 130 Implementing the code
Section 29: Amazon Backtracking question: Letter Combination of a Phone Number (Medium)
Lecture 131 Explanation – Letter Combinations of a Phone Number
Lecture 132 Intuition – Letter Combinations of a Phone Number
Lecture 133 Walkthrough – Letter Combinations of a Phone Number
Lecture 134 Code – Letter Combinations of a Phone Number
Section 30: Microsoft Backtracking question: Word Search (Medium)
Lecture 135 Explanation – Word Search – Medium #79
Section 31: Uber Backtracking question: Combination Sum (Medium)
Lecture 136 Explanation the problem
Lecture 137 Intuition behind the problem
Lecture 138 Walkthrough over the pseudocode
Lecture 139 Implementing the code
Section 32: Bloomberg Backtracking question: Palindrome Partitioning (Medium)
Lecture 140 Intuition behind the problem
Lecture 141 Pseudocode implementation
Lecture 142 Walkthrough over pseudocode
Lecture 143 Implementing the code
Section 33: Microsoft Trees question: Symmetric Trees (Easy)
Lecture 144 Explaining the problem
Lecture 145 Intuition behind the problem
Lecture 146 Walkthrough over pseudocode
Lecture 147 Implementing the code
Section 34: Google Trees question: Maximum Depth of a Binary Tree (Easy)
Lecture 148 Explaining the problem
Lecture 149 Intuition and pseudocode implementation
Lecture 150 Walkthrough over pseudocode
Lecture 151 Implementing the code
Section 35: Amazon Trees question: Path Sum (Easy)
Lecture 152 Explaining the problem
Lecture 153 Intuition behind the problem
Lecture 154 Walkthrough over pseudocode
Lecture 155 Coding the solution
Section 36: Facebook Trees question: Lowest Common Ancestor of a Binary Tree (Medium)
Lecture 156 Explaining the problem
Lecture 157 Intuition behind the problem
Lecture 158 Pseudocode implementation
Lecture 159 Walkthrough over pseudocode
Lecture 160 Coding the solution
Section 37: Google Trees question: Kth Smallest Element In a BST (Medium)
Lecture 161 Explaining the problem
Lecture 162 Optimized Solution Explanation- Kth Smallest Element in a BST – Medium #230
Lecture 163 Code – Kth Smallest Element in a BST – Medium #230
Section 38: Microsoft Trees question: Serialise And Deserialise Binary Tree (Hard)
Lecture 164 Explaining the "Serialisation"
Lecture 165 Walkthrough over pseudocode (Serialisation)
Lecture 166 Explaining the "Deserialisation"
Lecture 167 Walkthrough over pseudocode (Deserialisation)
Section 39: Microsoft Trees question: Binary Tree Maximum Path Sum (Hard)
Lecture 168 Explaining the problem
Lecture 169 Intuition behind the problem
Lecture 170 Walkthrough over pseudocode
Lecture 171 Coding the solution
Section 40: Google Stack Question: Min Stack (Easy)
Lecture 172 Brute force explanation – Min Stack – Easy #155
Lecture 173 Walkthrough over pseudocode
Lecture 174 Optimal solution explanation
Lecture 175 Coding the solution
Section 41: Amazon Stack Question: Valid Parenthesis (Easy)
Lecture 176 Explaining the problem
Lecture 177 Intuition behind this problem
Lecture 178 Pseudocode Implementation
Lecture 179 Walkthrough over the pseudocode
Lecture 180 Code – Valid Parenthesis – Easy #20
Section 42: Apple Stack Question: Binary Tree Level Order Traversal (Medium)
Lecture 181 Explaining the problem
Lecture 182 Walkthrough over pseudocode
Lecture 183 Implementing the code
Section 43: Microsoft Queue Question: Binary Tree Zigzag Level Order Traversal (Medium)
Lecture 184 Explaining the problem
Lecture 185 Intuition behind the problem
Lecture 186 Walkthrough over pseudocode
Lecture 187 Optimal solution explanation
Lecture 188 Optimal solution pseudocode walkthrough
Lecture 189 Implementing the code
Section 44: Stack Question: Binary Tree Postorder Traversal (Medium)
Lecture 190 Explanation of the problem
Lecture 191 Implementing the code
Section 45: Google Dynamic Programming Question: House Robber (Easy)
Lecture 192 Explanation behind the problem
Lecture 193 Intuition behind the problem
Lecture 194 2nd Approach: Bottom Up dynamic programming
Lecture 195 Walkthrough behind pseudocode
Lecture 196 Implementing the code
Section 46: Facebook Dynamic Programming Question: Best Time To Buy And Sell Stocks (Easy)
Lecture 197 Explanation behind the problem
Lecture 198 Intuition behind the problem
Lecture 199 Walkthrough over pseudocode
Lecture 200 Optimal solution explanation
Lecture 201 Coding the solution
Section 47: Amazon Dynamic Programming Question: Climbing Stairs (Easy)
Lecture 202 Explaining the problem
Lecture 203 Intuition behind the problem
Lecture 204 Implementation the pseudocode
Lecture 205 Bottom up approach explanation
Lecture 206 Bottom up approach walkthrough – Climbing Stairs – Easy #70
Lecture 207 Bottom up optimization – Climbing Stairs – Easy #70
Lecture 208 Code – Climbing Stairs – Easy #70
Section 48: Google Dynamic Programming Question: Coin Change (Medium)
Lecture 209 Explaining the problem
Lecture 210 Intuition behind the problem
Lecture 211 Pseudocode Implementation and optimisation
Lecture 212 Bottom up approach explanation
Lecture 213 Implementing the code
Section 49: Bloomberg Dynamic Programming Question: Unique Paths (Medium)
Lecture 214 Explaining the problem
Lecture 215 Pseudocode Implementation and walkthrough
Lecture 216 Implementing the code
Section 50: Microsoft Dynamic Programming Question: Longest Palindromic Substring (Medium)
Lecture 217 Explanation of the problem
Lecture 218 Initial Intuition behind the problem
Lecture 219 Optimising the previous solution
Lecture 220 Pseudocode Implementation
Lecture 221 Walkthrough over pseudocode
Lecture 222 Implementing the code
Section 51: Amazon Dynamic Programming Question: Trapping Rain Water (Hard)
Lecture 223 Explaining the problem
Lecture 224 Coding the implementation
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

Homepage

www.udemy.com/course/leetcode-in-swift-algorithms-coding-interview-questions/