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

LeetCode In Typescript: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)
  • 1. Introduction to the problem
  • 2. How to think about this problem
  • 3. Pseudocode Walkthrough
  • 4. Implementing the code

  • 3. Google Array Question Boats to save people (Medium)
  • 1. Problem Introduction
  • 2. How to intuitively think about this problem
  • 3. Pseudocode Walkthrough
  • 4. Implementing the code

  • 4. Facebook Array Question Move Zeroes (Easy)
  • 1. Brute force Intuition
  • 2. Brute force pseudocode walkthrough
  • 3. Better Approach Intuition
  • 4. Better Approach Pseudocode walkthrough
  • 5. Implementing the code

  • 5. Amazon Array Question Longest substring without repeating characters (Medium)
  • 1. Introduction to the problem
  • 2. Brute Force Intuition
  • 3. Pseudocode walkthrough
  • 4. Approach 2 Intuition
  • 5. Approach 2 pseudocode walkthrough
  • 6. Implementing the code

  • 6. Arrays QuestionFind first and last position of element in sorted Array (Medium)
  • 1. Introduction to the problem and brute force approach
  • 2. Brute force Pseudocode walkthrough
  • 3. Approach 2 Optimal Approach intuition
  • 4. Pseudocode walkthrough part 1
  • 5. Pseudocode walkthrough part 2
  • 6. Implementing the code

  • 7. Google Array question first bad version (Easy)
  • 1. Introduction To The Problem And Brute Force Approach
  • 2. Optimal Solution Intuition
  • 3. Optimal solution pseudocode walkthrough
  • 4. Implementing the code

  • 8. Microsoft Math Question Missing Number (Easy-ish)
  • 1. Introduction to the problem
  • 2. Approach 1 Brute Force Approach
  • 3. Approach 2 A Better Approach Explanation
  • 4. PseudoCode Walkthrough For Approach 2
  • 5. Implementing the code
  • 6. Approach 3 Optimal Approach
  • 7. Implementing the optimal approach

  • 9. Amazon Math Question Count Primes
  • 1. Problem Introduction And Brute Force Explanation
  • 2. Pseudocode Walkthrough For Brute Force Approach
  • 3. Approach 2 Optimal solution
  • 4. Pseudocode Walkthrough For Optimal Approach
  • 5. Code Implementation

  • 10. Airbnb Math Question Single Number
  • 1. Introduction to the problem and brute force approach
  • 2. Pseudocode walkthrough for brute approach
  • 3. Approach 2 better Approach
  • 4. Implementing the code
  • 5. Approach 3 optimal approach
  • 6. Implementing the optimal approach

  • 11. Amazon Math Question Robot return to origin (Easy)
  • 1. Explaining the problem
  • 2. Implementing the code

  • 12. Facebook Math Question Add Binary (Easy)
  • 1. Introduction to the problem
  • 2. Examples of binary additions
  • 3. Pseudocode Implementation
  • 4. Pseudocode Walkthrough
  • 5. Implementing the code

  • 13. Google Hash Tables Dictionaries question Two Sum (Easy)
  • 1. Approach 1 Introduction to the problem and brute force approach
  • 2. Brute force Pseudocode Implementation
  • 3. Pseudocode Walkthrough
  • 4. Approach 2 Optimal Approach Explanation
  • 5. Pseudocode Walkthrough
  • 6. Code Implementation

  • 14. Google Hash Tables Dictionaries question Contains Duplicate
  • 1. Introduction to the problem and multiple approaches
  • 2. Optimal Approach
  • 3. Code Implementation

  • 15. Google Hash Tables Dictionaries question Majority Element
  • 1. Approach 1 Intuition
  • 2. Approach 1 Pseudocode Walkthrough
  • 3. Approach 2 - Majority Element Intuition
  • 4. Implementing Approach 2 code
  • 5. Approach 3 Intuition - Optimal solution
  • 6. Approach 3 Walkthrough - Optimal solution
  • 7. Implementing Approach 3 (optimal approach)

  • 16. Facebook Hash Tables Dictionaries question Group Anagrams (Medium)
  • 1. Explanation - Group Anagrams - Medium #49
  • 2. Code - Group Anagrams - Medium #49

  • 17. Hash Tables Dictionaries question 4sum 2 (Medium)
  • 1. Brute force Explanation
  • 2. Brute Force Pseudocode Walkthrough
  • 3. Approach 2 Optimal approach
  • 4. Implementing the code

  • 18. Microsoft Hash Tables Dictionaries question LRU Cache (Medium)
  • 1. Introduction to the problem
  • 2. InputOuput for the problem
  • 3. Intuition behind the problem
  • 4. Pseudocode implementation
  • 5. Pseudocode Walkthrough

  • 19. Linkedin Hash Tables Dictionaries question Minimum Window Substring (Hard)
  • 1. Explanation - Minimum Window Substring - part 1
  • 2. Explanation - Minimum window substring - part 2
  • 3. Explanation - Minimum window substring - part 3
  • 4. Pseudocode Implementation
  • 5. Pseudocode Walkthrough
  • 6. Code - Minimum Window Substring - Hard #76

  • 20. Apple Linked list question Merge Two Sorted Lists (Easy)
  • 1. Explanation - Merge Two Sorted Lists - Easy #21
  • 2. Implementation - Merge Two Sorted Lists - Easy #21
  • 3. Walkthrough - Merge Two Sorted Lists - Easy #21
  • 4. Code - Merge Two Sorted Lists - Easy #21

  • 21. Amazon Linked list question Linked list cycle (Medium)
  • 1. Explanation - Linked List Cycle - Easy #141
  • 2. Intuition - Linked List Cycle - Easy #141
  • 3. Walkthrough - Linked List Cycle - Easy #141
  • 4. Code - Linked List Cycle - Easy #141

  • 22. Microsoft Linked list question Reverse linked list (Medium)
  • 1. Explanation - Reverse Linked List
  • 2. Intuition - Reverse Linked List
  • 3. pseudocode Implementation & Walkthrough - Reverse Linked List
  • 4. Implementing the code - Reverse Linked List

  • 23. Adobe Linked list question Add two numbers (Medium)
  • 1. Explanation - Add Two Numbers
  • 2. Intuition - Add Two Numbers
  • 3. Pseudocode Implementation - Add Two Numbers
  • 4. Walkthrough - Add Two Numbers - Medium #2
  • 5. Code - Add Two Numbers

  • 24. Linked list question Remove Nth node from end of list (Medium)
  • 1. Explanation - Remove Nth Node From End of List
  • 2. Intuition - Remove Nth Node From End of List
  • 3. Walkthrough - Remove Nth Node From End of List
  • 4. Approach 2 Explanation - Remove Nth Node From End of List
  • 5. Approach 2 Walkthrough - Remove Nth Node From End of List - Medium #19
  • 6. Code - Remove Nth Node From End of List

  • 25. Linked list question Odd Even linked list (Medium)
  • 1. Explanation - Odd Even Linked List
  • 2. Intuition - Odd Even Linked List
  • 3. Pseudocode Implementation - Odd Even Linked List
  • 4. Walkthrough - Odd Even Linked List
  • 5. Code - Odd Even Linked List

  • 26. Google Linked list question Merge K sorted lists (Hard)
  • 1. Explanation - Merge K Sorted Lists - Hard #23

  • 27. Facebook Backtracking question Subsets (Medium)
  • 1. Explanation - Subsets
  • 2. Cascading solution explanation - Subsets
  • 3. Cascading solution walkthrough - Subsets
  • 4. Backtracking Approach 2 explanation - Subsets
  • 5. Implementing the code

  • 28. Amazon Backtracking question Letter Combination of a Phone Number (Medium)
  • 1. Explanation - Letter Combinations of a Phone Number
  • 2. Intuition - Letter Combinations of a Phone Number
  • 3. Walkthrough - Letter Combinations of a Phone Number
  • 4. Code - Letter Combinations of a Phone Number

  • 29. Uber Backtracking question Combination Sum (Medium)
  • 1. Explanation the problem
  • 2. Intuition behind the problem
  • 3. Walkthrough over the pseudocode
  • 4. Implementing the code

  • 30. Bloomberg Backtracking question Palindrome Partitioning (Medium)
  • 1. Intuition behind the problem
  • 2. Pseudocode implementation
  • 3. Walkthrough over pseudocode
  • 4. Implementing the code

  • 31. Microsoft Trees question Symmetric Trees (Easy)
  • 1. Explaining the problem
  • 2. Intuition behind the problem
  • 3. Walkthrough over pseudocode
  • 4. Implementing the code

  • 32. Google Trees question Maximum Depth of a Binary Tree (Easy)
  • 1. Explaining the problem
  • 2. Intuition and pseudocode implementation
  • 3. Walkthrough over pseudocode
  • 4. Implementing the code

  • 33. Amazon Trees question Path Sum (Easy)
  • 1. Explaining the problem
  • 2. Intuition behind the problem
  • 3. Walkthrough over pseudocode
  • 4. Coding the solution

  • 34. Facebook Trees question Lowest Common Ancestor of a Binary Tree (Medium)
  • 1. Explaining the problem
  • 2. Intuition behind the problem
  • 3. Pseudocode implementation
  • 4. Walkthrough over pseudocode

  • 35. Google Trees question Kth Smallest Element In a BST (Medium)
  • 1. Explaining the problem
  • 2. Optimized Solution Explanation- Kth Smallest Element in a BST - Medium #230
  • 3. Code - Kth Smallest Element in a BST - Medium #230

  • 36. Microsoft Trees question Serialise And Deserialise Binary Tree (Hard)
  • 1. Explaining the Serialisation
  • 2. Walkthrough over pseudocode (Serialisation)
  • 3. Explaining the Deserialisation
  • 4. Walkthrough over pseudocode (Deserialisation)

  • 37. Microsoft Trees question Binary Tree Maximum Path Sum (Hard)
  • 1. Explaining the problem
  • 2. Intuition behind the problem
  • 3. Walkthrough over pseudocode
  • 4. Coding the solution

  • 38. Google Stack Question Min Stack (Easy)
  • 1. Brute force explanation - Min Stack - Easy #155
  • 2. Walkthrough over pseudocode
  • 3. Optimal solution explanation

  • 39. Amazon Stack Question Valid Parenthesis (Easy)
  • 1. Explaining the problem
  • 2. Intuition behind this problem
  • 3. Pseudocode Implementation
  • 4. Walkthrough over the pseudocode
  • 5. Code - Valid Parenthesis - Easy #20

  • 40. Apple Stack Question Binary Tree Level Order Traversal (Medium)
  • 1. Explaining the problem
  • 2. Walkthrough over pseudocode
  • 3. Implementing the code

  • 41. Microsoft Queue Question Binary Tree Zigzag Level Order Traversal (Medium)
  • 1. Explaining the problem
  • 2. Intuition behind the problem
  • 3. Walkthrough over pseudocode
  • 4. Optimal solution explanation
  • 5. Optimal solution pseudocode walkthrough
  • 6. Implementing the code

  • 42. Stack Question Binary Tree Postorder Traversal (Medium)
  • 1. Explanation of the problem
  • 2. Implementing the code

  • 43. Google Dynamic Programming Question House Robber (Easy)
  • 1. Explanation behind the problem
  • 2. Intuition behind the problem
  • 3. 2nd Approach Bottom Up dynamic programming
  • 4. Walkthrough behind pseudocode
  • 5. Implementing the code

  • 44. Facebook Dynamic Programming Question Best Time To Buy And Sell Stocks (Easy)
  • 1. Explanation behind the problem
  • 2. Intuition behind the problem
  • 3. Walkthrough over pseudocode
  • 4. Optimal solution explanation
  • 5. Coding the solution

  • 45. Amazon Dynamic Programming Question Climbing Stairs (Easy)
  • 1. Explaining the problem
  • 2. Intuition behind the problem
  • 3. Implementation the pseudocode
  • 4. Bottom up approach explanation
  • 5. Bottom up approach walkthrough - Climbing Stairs - Easy #70
  • 6. Bottom up optimization - Climbing Stairs - Easy #70
  • 7. Code - Climbing Stairs - Easy #70

  • 46. Google Dynamic Programming Question Coin Change (Medium)
  • 1. Explaining the problem
  • 2. Intuition behind the problem
  • 3. Pseudocode Implementation and optimisation
  • 4. Bottom up approach explanation

  • 47. Bloomberg Dynamic Programming Question Unique Paths (Medium)
  • 1. Explaining the problem
  • 2. Pseudocode Implementation and walkthrough
  • 3. Implementing the code

  • 48. Microsoft Dynamic Programming Question Longest Palindromic Substring (Medium)
  • 1. Explanation of the problem
  • 2. Initial Intuition behind the problem
  • 3. Optimising the previous solution
  • 4. Pseudocode Implementation
  • 5. Walkthrough over pseudocode
  • 6. Implementing the code

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

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

    ایمیل شما:
    تولید کننده:
    مدرس:
    شناسه: 20766
    حجم: 5542 مگابایت
    مدت زمان: 1353 دقیقه
    تاریخ انتشار: 15 مهر 1402
    طراحی سایت و خدمات سئو

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