وب سایت تخصصی شرکت فرین
دسته بندی دوره ها

Leetcode in Swift: Algorithms coding interview questions

سرفصل های دوره

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


1 - Introduction
  • 1 - What to do if you dont understand an explanation or code video Important.html
  • 2 - Utilise the video format of online courses.html

  • 2 - Microsoft Array Question Container with most water Medium
  • 3 - Introduction to the problem
  • 4 - Brute Force solution Intuition
  • 5 - pseudocode walkthrough
  • 6 - Better Approach intuition
  • 7 - Approach 2 Pseudocode walkthrough
  • 8 - Implementing the code

  • 3 - Google Array Question Valid mountain array Easy
  • 9 - Introduction to the problem
  • 10 - How to think about this problem
  • 11 - Pseudocode Walkthrough
  • 12 - Implementing the code

  • 4 - Google Array Question Boats to save people Medium
  • 13 - Problem Introduction
  • 14 - How to intuitively think about this problem
  • 15 - Pseudocode Walkthrough
  • 16 - Implementing the code

  • 5 - Facebook Array Question Move Zeroes Easy
  • 17 - Brute force Intuition
  • 18 - Brute force pseudocode walkthrough
  • 19 - Better Approach Intuition
  • 20 - Better Approach Pseudocode walkthrough
  • 21 - Implementing the code

  • 6 - Amazon Array Question Longest substring without repeating characters Medium
  • 22 - Introduction to the problem
  • 23 - Brute Force Intuition
  • 24 - Pseudocode walkthrough
  • 25 - Approach 2 Intuition
  • 26 - Approach 2 pseudocode walkthrough
  • 27 - Implementing the code

  • 7 - Arrays QuestionFind first and last position of element in sorted Array Medium
  • 28 - Introduction to the problem and brute force approach
  • 29 - Brute force Pseudocode walkthrough
  • 30 - Approach 2 Optimal Approach intuition
  • 31 - Pseudocode walkthrough part 1
  • 32 - Pseudocode walkthrough part 2
  • 33 - Implementing the code

  • 8 - Google Array question first bad version Easy
  • 34 - Introduction To The Problem And Brute Force Approach
  • 35 - Optimal Solution Intuition
  • 36 - Optimal solution pseudocode walkthrough
  • 37 - Implementing the code

  • 9 - Microsoft Math Question Missing Number Easyish
  • 38 - Introduction to the problem
  • 39 - Approach 1 Brute Force Approach
  • 40 - Approach 2 A Better Approach Explanation
  • 41 - PseudoCode Walkthrough For Approach 2
  • 42 - Implementing the code
  • 43 - Approach 3 Optimal Approach
  • 44 - Implementing the optimal approach

  • 10 - Amazon Math Question Count Primes
  • 45 - Problem Introduction And Brute Force Explanation
  • 46 - Pseudocode Walkthrough For Brute Force Approach
  • 47 - Approach 2 Optimal solution
  • 48 - Pseudocode Walkthrough For Optimal Approach
  • 49 - Code Implementation

  • 11 - Airbnb Math Question Single Number
  • 50 - Introduction to the problem and brute force approach
  • 51 - Pseudocode walkthrough for brute approach
  • 52 - Approach 2 better Approach
  • 53 - Implementing the code
  • 54 - Approach 3 optimal approach
  • 55 - Implementing the optimal approach

  • 12 - Amazon Math Question Robot return to origin Easy
  • 56 - Explaining the problem
  • 57 - Implementing the code

  • 13 - Facebook Math Question Add Binary Easy
  • 58 - Introduction to the problem
  • 59 - Examples of binary additions
  • 60 - Pseudocode Implementation
  • 61 - Pseudocode Walkthrough
  • 62 - Implementing the code

  • 14 - Google Hash Tables Dictionaries question Two Sum Easy
  • 63 - Approach 1 Introduction to the problem and brute force approach
  • 64 - Brute force Pseudocode Implementation
  • 65 - Pseudocode Walkthrough
  • 66 - Approach 2 Optimal Approach Explanation
  • 67 - Pseudocode Walkthrough
  • 68 - Code Implementation

  • 15 - Google Hash Tables Dictionaries question Contains Duplicate
  • 69 - Introduction to the problem and multiple approaches
  • 70 - Optimal Approach
  • 71 - Code Implementation

  • 16 - Google Hash Tables Dictionaries question Majority Element
  • 72 - Approach 1 Intuition
  • 73 - Approach 1 Pseudocode Walkthrough
  • 74 - Approach 2 Majority Element Intuition
  • 75 - Implementing Approach 2 code
  • 76 - Approach 3 Intuition Optimal solution
  • 77 - Approach 3 Walkthrough Optimal solution
  • 78 - Implementing Approach 3 optimal approach

  • 17 - Facebook Hash Tables Dictionaries question Group Anagrams Medium
  • 79 - Explanation Group Anagrams Medium 49
  • 80 - Code Group Anagrams Medium 49

  • 18 - Hash Tables Dictionaries question 4sum 2 Medium
  • 81 - Brute force Explanation
  • 82 - Brute Force Pseudocode Walkthrough
  • 83 - Approach 2 Optimal approach
  • 84 - Implementing the code

  • 19 - Microsoft Hash Tables Dictionaries question LRU Cache Medium
  • 85 - Introduction to the problem
  • 86 - InputOuput for the problem
  • 87 - Intuition behind the problem
  • 88 - Pseudocode implementation
  • 89 - Pseudocode Walkthrough

  • 20 - Linkedin Hash Tables Dictionaries question Minimum Window Substring Hard
  • 90 - Explanation Minimum Window Substring part 1
  • 91 - Explanation Minimum window substring part 2
  • 92 - Explanation Minimum window substring part 3
  • 93 - Pseudocode Implementation
  • 94 - Pseudocode Walkthrough
  • 95 - Code Minimum Window Substring Hard 76

  • 21 - Apple Linked list question Merge Two Sorted Lists Easy
  • 96 - Explanation Merge Two Sorted Lists Easy 21
  • 97 - Implementation Merge Two Sorted Lists Easy 21
  • 98 - Walkthrough Merge Two Sorted Lists Easy 21
  • 99 - Code Merge Two Sorted Lists Easy 21

  • 22 - Amazon Linked list question Linked list cycle Medium
  • 100 - Explanation Linked List Cycle Easy 141
  • 101 - Intuition Linked List Cycle Easy 141
  • 102 - Walkthrough Linked List Cycle Easy 141
  • 103 - Code Linked List Cycle Easy 141

  • 23 - Microsoft Linked list question Reverse linked list Easy
  • 104 - Explanation Reverse Linked List
  • 105 - Intuition Reverse Linked List
  • 106 - pseudocode Implementation Walkthrough Reverse Linked List
  • 107 - Implementing the code Reverse Linked List

  • 24 - Adobe Linked list question Add two numbers Medium
  • 108 - Explanation Add Two Numbers
  • 109 - Intuition Add Two Numbers
  • 110 - Implementation Add Two Numbers
  • 111 - Walkthrough Add Two Numbers Medium 2
  • 112 - Code Add Two Numbers

  • 25 - Linked list question Remove Nth node from end of list Medium
  • 113 - Explanation Remove Nth Node From End of List
  • 114 - Intuition Remove Nth Node From End of List
  • 115 - Walkthrough Remove Nth Node From End of List
  • 116 - Approach 2 Explanation Remove Nth Node From End of List
  • 117 - Approach 2 Walkthrough Remove Nth Node From End of List Medium 19
  • 118 - Code Remove Nth Node From End of List

  • 26 - Linked list question Odd Even linked list Medium
  • 119 - Explanation Odd Even Linked List
  • 120 - Intuition Odd Even Linked List
  • 121 - Implementation Odd Even Linked List
  • 122 - Walkthrough Odd Even Linked List
  • 123 - Code Odd Even Linked List

  • 27 - Google Linked list question Merge K sorted lists Hard
  • 124 - Explanation Merge K Sorted Lists Hard 23
  • 125 - Code Merge K Sorted Lists Hard 23

  • 28 - Facebook Backtracking question Subsets Medium
  • 126 - Explanation Subsets
  • 127 - Cascading solution explanation Subsets
  • 128 - Cascading solution walkthrough Subsets
  • 129 - Backtracking Approach 2 explanation Subsets
  • 130 - Implementing the code

  • 29 - Amazon Backtracking question Letter Combination of a Phone Number Medium
  • 131 - Explanation Letter Combinations of a Phone Number
  • 132 - Intuition Letter Combinations of a Phone Number
  • 133 - Walkthrough Letter Combinations of a Phone Number
  • 134 - Code Letter Combinations of a Phone Number

  • 30 - Microsoft Backtracking question Word Search Medium
  • 135 - Explanation Word Search Medium 79

  • 31 - Uber Backtracking question Combination Sum Medium
  • 136 - Explanation the problem
  • 137 - Intuition behind the problem
  • 138 - Walkthrough over the pseudocode
  • 139 - Implementing the code

  • 32 - Bloomberg Backtracking question Palindrome Partitioning Medium
  • 140 - Intuition behind the problem
  • 141 - Pseudocode implementation
  • 142 - Walkthrough over pseudocode
  • 143 - Implementing the code

  • 33 - Microsoft Trees question Symmetric Trees Easy
  • 144 - Explaining the problem
  • 145 - Intuition behind the problem
  • 146 - Walkthrough over pseudocode
  • 147 - Implementing the code

  • 34 - Google Trees question Maximum Depth of a Binary Tree Easy
  • 148 - Explaining the problem
  • 149 - Intuition and pseudocode implementation
  • 150 - Walkthrough over pseudocode
  • 151 - Implementing the code

  • 35 - Amazon Trees question Path Sum Easy
  • 152 - Explaining the problem
  • 153 - Intuition behind the problem
  • 154 - Walkthrough over pseudocode
  • 155 - Coding the solution

  • 36 - Facebook Trees question Lowest Common Ancestor of a Binary Tree Medium
  • 156 - Explaining the problem
  • 157 - Intuition behind the problem
  • 158 - Pseudocode implementation
  • 159 - Walkthrough over pseudocode
  • 160 - Coding the solution

  • 37 - Google Trees question Kth Smallest Element In a BST Medium
  • 161 - Explaining the problem
  • 162 - Optimized Solution Explanation Kth Smallest Element in a BST Medium 230
  • 163 - Code Kth Smallest Element in a BST Medium 230

  • 38 - Microsoft Trees question Serialise And Deserialise Binary Tree Hard
  • 164 - Explaining the Serialisation
  • 165 - Walkthrough over pseudocode Serialisation
  • 166 - Explaining the Deserialisation
  • 167 - Walkthrough over pseudocode Deserialisation

  • 39 - Microsoft Trees question Binary Tree Maximum Path Sum Hard
  • 168 - Explaining the problem
  • 169 - Intuition behind the problem
  • 170 - Walkthrough over pseudocode
  • 171 - Coding the solution

  • 40 - Google Stack Question Min Stack Easy
  • 172 - Brute force explanation Min Stack Easy 155
  • 173 - Walkthrough over pseudocode
  • 174 - Optimal solution explanation
  • 175 - Coding the solution

  • 41 - Amazon Stack Question Valid Parenthesis Easy
  • 176 - Explaining the problem
  • 177 - Intuition behind this problem
  • 178 - Pseudocode Implementation
  • 179 - Walkthrough over the pseudocode
  • 180 - Code Valid Parenthesis Easy 20

  • 42 - Apple Stack Question Binary Tree Level Order Traversal Medium
  • 181 - Explaining the problem
  • 182 - Walkthrough over pseudocode
  • 183 - Implementing the code

  • 43 - Microsoft Queue Question Binary Tree Zigzag Level Order Traversal Medium
  • 184 - Explaining the problem
  • 185 - Intuition behind the problem
  • 186 - Walkthrough over pseudocode
  • 187 - Optimal solution explanation
  • 188 - Optimal solution pseudocode walkthrough
  • 189 - Implementing the code

  • 44 - Stack Question Binary Tree Postorder Traversal Medium
  • 190 - Explanation of the problem
  • 191 - Implementing the code

  • 45 - Google Dynamic Programming Question House Robber Easy
  • 192 - Explanation behind the problem
  • 193 - Intuition behind the problem
  • 194 - 2nd Approach Bottom Up dynamic programming
  • 195 - Walkthrough behind pseudocode
  • 196 - Implementing the code

  • 46 - Facebook Dynamic Programming Question Best Time To Buy And Sell Stocks Easy
  • 197 - Explanation behind the problem
  • 198 - Intuition behind the problem
  • 199 - Walkthrough over pseudocode
  • 200 - Optimal solution explanation
  • 201 - Coding the solution

  • 47 - Amazon Dynamic Programming Question Climbing Stairs Easy
  • 202 - Explaining the problem
  • 203 - Intuition behind the problem
  • 204 - Implementation the pseudocode
  • 205 - Bottom up approach explanation
  • 206 - Bottom up approach walkthrough Climbing Stairs Easy 70
  • 207 - Bottom up optimization Climbing Stairs Easy 70
  • 208 - Code Climbing Stairs Easy 70

  • 48 - Google Dynamic Programming Question Coin Change Medium
  • 209 - Explaining the problem
  • 210 - Intuition behind the problem
  • 211 - Pseudocode Implementation and optimisation
  • 212 - Bottom up approach explanation
  • 213 - Implementing the code

  • 49 - Bloomberg Dynamic Programming Question Unique Paths Medium
  • 214 - Explaining the problem
  • 215 - Pseudocode Implementation and walkthrough
  • 216 - Implementing the code

  • 50 - Microsoft Dynamic Programming Question Longest Palindromic Substring Medium
  • 217 - Explanation of the problem
  • 218 - Initial Intuition behind the problem
  • 219 - Optimising the previous solution
  • 220 - Pseudocode Implementation
  • 221 - Walkthrough over pseudocode
  • 222 - Implementing the code

  • 51 - Amazon Dynamic Programming Question Trapping Rain Water Hard
  • 223 - Explaining the problem
  • 224 - Coding the implementation
  • 54,900 تومان
    بیش از یک محصول به صورت دانلودی میخواهید؟ محصول را به سبد خرید اضافه کنید.
    خرید دانلودی فوری

    در این روش نیاز به افزودن محصول به سبد خرید و تکمیل اطلاعات نیست و شما پس از وارد کردن ایمیل خود و طی کردن مراحل پرداخت لینک های دریافت محصولات را در ایمیل خود دریافت خواهید کرد.

    ایمیل شما:
    تولید کننده:
    مدرس:
    شناسه: 31816
    حجم: 3993 مگابایت
    مدت زمان: 1419 دقیقه
    تاریخ انتشار: 20 مرداد 1403
    طراحی سایت و خدمات سئو

    54,900 تومان
    افزودن به سبد خرید