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

LeetCode In C++: Algorithms Coding Interview Questions

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

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


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

  • 2 - Google Array Question Valid mountain array Easy
  • 7 - Introduction to the problem
  • 8 - How to think about this problem
  • 9 - Pseudocode Walkthrough
  • 10 - Implementing the code

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

  • 4 - Facebook Array Question Move Zeroes Easy
  • 15 - Brute force Intuition
  • 16 - Brute force pseudocode walkthrough
  • 17 - Better Approach Intuition
  • 18 - Better Approach Pseudocode walkthrough
  • 19 - Implementing the code

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

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

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

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

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

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

  • 11 - Amazon Math Question Robot return to origin Easy
  • 54 - Explaining the problem
  • 55 - Implementing the code

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

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

  • 14 - Google Hash Tables Dictionaries question Contains Duplicate
  • 67 - Introduction to the problem and multiple approaches
  • 68 - Optimal Approach
  • 69 - Code Implementation

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

  • 16 - Hash Tables Dictionaries question 4sum 2 Medium
  • 77 - Brute force Explanation
  • 78 - Brute Force Pseudocode Walkthrough
  • 79 - Approach 2 Optimal approach
  • 80 - Implementing the code

  • 17 - Linkedin Hash Tables Dictionaries question Minimum Window Substring Hard
  • 81 - Explanation Minimum Window Substring part 1
  • 82 - Explanation Minimum window substring part 2
  • 83 - Explanation Minimum window substring part 3
  • 84 - Pseudocode Implementation
  • 85 - Pseudocode Walkthrough
  • 86 - Code Implementation Minimum Window Substring

  • 18 - Facebook Hash Tables Dictionaries question Group Anagrams Medium
  • 87 - Explanation Group Anagrams Medium 49

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

  • 20 - Apple Linked list question Merge Two Sorted Lists Easy
  • 93 - Explanation Merge Two Sorted Lists Easy 21
  • 94 - Pseudocode Implementation Merge Two Sorted Lists Easy 21
  • 95 - Walkthrough Merge Two Sorted Lists Easy 21
  • 96 - Code Merge Two Sorted Lists Easy 21

  • 21 - Amazon Linked list question Linked list cycle Medium
  • 97 - Explanation Linked List Cycle Easy 141
  • 98 - Intuition Linked List Cycle Easy 141
  • 99 - Walkthrough Linked List Cycle Easy 141
  • 100 - Code Linked List Cycle Easy 141

  • 22 - Microsoft Linked list question Reverse linked list Medium
  • 101 - Explanation Reverse Linked List
  • 102 - Intuition Reverse Linked List
  • 103 - pseudocode Implementation Walkthrough Reverse Linked List
  • 104 - Implementing the code Reverse Linked List

  • 23 - Adobe Linked list question Add two numbers Medium
  • 105 - Explanation Add Two Numbers
  • 106 - Intuition Add Two Numbers
  • 107 - Pseudocode Implementation Add Two Numbers
  • 108 - Walkthrough Add Two Numbers
  • 109 - Code Add Two Numbers

  • 24 - Linked list question Remove Nth node from end of list Medium
  • 110 - Explanation Remove Nth Node From End of List
  • 111 - Intuition Remove Nth Node From End of List
  • 112 - Walkthrough Remove Nth Node From End of List
  • 113 - Approach 2 Explanation Remove Nth Node From End of List
  • 114 - Approach 2 Walkthrough Remove Nth Node From End of List
  • 115 - Code Remove Nth Node From End of List

  • 25 - Linked list question Odd Even linked list Medium
  • 116 - Explanation Odd Even Linked List
  • 117 - Intuition Odd Even Linked List
  • 118 - Implementation Odd Even Linked List
  • 119 - Walkthrough Odd Even Linked List
  • 120 - Code Odd Even Linked List

  • 26 - Facebook Backtracking question Subsets Medium
  • 121 - Explanation Subsets
  • 122 - Cascading solution explanation Subsets
  • 123 - Cascading solution walkthrough Subsets
  • 124 - Backtracking Approach 2 explanation Subsets
  • 125 - Implementing the code

  • 27 - Amazon Backtracking question Letter Combination of a Phone Number Medium
  • 126 - Explanation Letter Combinations of a Phone Number
  • 127 - Intuition Letter Combinations of a Phone Number
  • 128 - Walkthrough Letter Combinations of a Phone Number
  • 129 - Code Letter Combinations of a Phone Number

  • 28 - Microsoft Backtracking question Word Search Medium
  • 130 - Explanation Word Search Medium 79

  • 29 - Uber Backtracking question Combination Sum Medium
  • 131 - Explanation the problem
  • 132 - Intuition behind the problem
  • 133 - Walkthrough over the pseudocode
  • 134 - Implementing the code

  • 30 - Bloomberg Backtracking question Palindrome Partitioning Medium
  • 135 - Explaining the problem
  • 136 - Pseudocode implementation
  • 137 - Walkthrough over pseudocode
  • 138 - Implementing the code

  • 31 - Microsoft Trees question Symmetric Trees Easy
  • 139 - Explaining the problem
  • 140 - Intuition behind the problem
  • 141 - Walkthrough over pseudocode
  • 142 - Implementing the code

  • 32 - Google Trees question Maximum Depth of a Binary Tree Easy
  • 143 - Explaining the problem
  • 144 - Intuition and pseudocode implementation
  • 145 - Walkthrough over pseudocode
  • 146 - Implementing the real code

  • 33 - Amazon Trees question Path Sum Easy
  • 147 - Explaining the problem
  • 148 - Intuition behind the problem
  • 149 - Walkthrough over pseudocode
  • 150 - Coding the solution

  • 34 - Facebook Trees question Lowest Common Ancestor of a Binary Tree Medium
  • 151 - Explaining the problem
  • 152 - Intuition behind the problem
  • 153 - Pseudocode implementation
  • 154 - Walkthrough over pseudocode

  • 35 - Google Trees question Kth Smallest Element In a BST Medium
  • 155 - Explaining the problem and brute force approach
  • 156 - Optimised Solution Explanation
  • 157 - Implementing the code

  • 36 - Microsoft Trees question Serialise And Deserialise Binary Tree Hard
  • 158 - Explaining the Serialisation
  • 159 - Walkthrough over pseudocode Serialisation
  • 160 - Explaining the Deserialisation
  • 161 - Walkthrough over pseudocode Deserialisation

  • 37 - Microsoft Trees question Binary Tree Maximum Path Sum Hard
  • 162 - Explaining the problem
  • 163 - Intuition behind the problem
  • 164 - Walkthrough over pseudocode
  • 165 - Coding the solution

  • 38 - Google Stack Question Min Stack Easy
  • 166 - Brute force explanation
  • 167 - Walkthrough over pseudocode
  • 168 - Optimal solution explanation

  • 39 - Amazon Stack Question Valid Parenthesis Easy
  • 169 - Explaining the problem
  • 170 - Intuition behind this problem
  • 171 - Pseudocode Implementation
  • 172 - Walkthrough over the pseudocode
  • 173 - Implementing the code

  • 40 - Apple Stack Question Binary Tree Level Order Traversal Medium
  • 174 - Explaining the problem
  • 175 - Walkthrough over pseudocode
  • 176 - Implementing the code

  • 41 - Microsoft Queue Question Binary Tree Zigzag Level Order Traversal Medium
  • 177 - Explaining the problem
  • 178 - Intuition behind the problem
  • 179 - Walkthrough over pseudocode
  • 180 - Optimal solution explanation
  • 181 - Optimal solution pseudocode walkthrough
  • 182 - Implementing the code

  • 42 - Stack Question Binary Tree Postorder Traversal Medium
  • 183 - Explanation of the problem
  • 184 - Implementing the code

  • 43 - Google Dynamic Programming Question House Robber Easy
  • 185 - Explanation behind the problem
  • 186 - Intuition behind the problem
  • 187 - 2nd Approach Bottom Up dynamic programming
  • 188 - Walkthrough behind pseudocode
  • 189 - Implementing the code

  • 44 - Facebook Dynamic Programming Question Best Time To Buy And Sell Stocks Easy
  • 190 - Explanation behind the problem
  • 191 - Intuition behind the problem
  • 192 - Walkthrough over pseudocode
  • 193 - Optimal solution explanation
  • 194 - Coding the solution

  • 45 - Amazon Dynamic Programming Question Climbing Stairs Easy
  • 195 - Explaining the problem
  • 196 - Intuition behind the problem
  • 197 - Implementation the pseudocode
  • 198 - Bottom up approach explanation
  • 199 - Bottom up approach walkthrough
  • 200 - Bottom up optimisation
  • 201 - Code Climbing Stairs

  • 46 - Google Dynamic Programming Question Coin Change Medium
  • 202 - Explaining the problem
  • 203 - Intuition behind the problem
  • 204 - Pseudocode Implementation and optimisation
  • 205 - Bottom up approach explanation
  • 206 - Implementing the code

  • 47 - Bloomberg Dynamic Programming Question Unique Paths Medium
  • 207 - Explaining the problem
  • 208 - Pseudocode Implementation and walkthrough
  • 209 - Implementing the code

  • 48 - Microsoft Dynamic Programming Question Longest Palindromic Substring Medium
  • 210 - Explanation of the problem
  • 211 - Initial Intuition behind the problem
  • 212 - Optimising the previous solution
  • 213 - Pseudocode Implementation
  • 214 - Walkthrough over pseudocode
  • 215 - Implementing the code

  • 49 - Amazon Dynamic Programming Question Trapping Rain Water Hard
  • 216 - Explaining the problem
  • 217 - Coding the implementation
  • 139,000 تومان
    بیش از یک محصول به صورت دانلودی میخواهید؟ محصول را به سبد خرید اضافه کنید.
    افزودن به سبد خرید
    خرید دانلودی فوری

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

    ایمیل شما:
    تولید کننده:
    مدرس:
    شناسه: 20919
    حجم: 5594 مگابایت
    مدت زمان: 1377 دقیقه
    تاریخ انتشار: ۷ آبان ۱۴۰۲
    دسته بندی محصول
    طراحی سایت و خدمات سئو

    139,000 تومان
    افزودن به سبد خرید