Companies Home Search Profile

LeetCode In Typescript:Algorithms Coding Interview Questions

Focused View

Bit Punch

22:32:33

87 View
  • 1. Introduction to the problem.mp4
    10:42
  • 2. Brute Force solution Intuition.mp4
    06:15
  • 3. pseudocode walkthrough.mp4
    07:36
  • 4. Better Approach intuition.mp4
    10:34
  • 5. Approach 2 Pseudocode walkthrough.mp4
    08:16
  • 6. Implementing the code.mp4
    02:23
  • 1. Introduction to the problem.mp4
    04:36
  • 2. How to think about this problem.mp4
    06:23
  • 3. Pseudocode Walkthrough.mp4
    05:08
  • 4. Implementing the code.mp4
    02:35
  • 1. Problem Introduction.mp4
    07:14
  • 2. How to intuitively think about this problem.mp4
    07:14
  • 3. Pseudocode Walkthrough.mp4
    06:57
  • 4. Implementing the code.mp4
    03:50
  • 1. Brute force Intuition.mp4
    06:38
  • 2. Brute force pseudocode walkthrough.mp4
    03:56
  • 3. Better Approach Intuition.mp4
    07:01
  • 4. Better Approach Pseudocode walkthrough.mp4
    03:44
  • 5. Implementing the code.mp4
    02:42
  • 1. Introduction to the problem.mp4
    04:08
  • 2. Brute Force Intuition.mp4
    13:11
  • 3. Pseudocode walkthrough.mp4
    16:23
  • 4. Approach 2 Intuition.mp4
    12:56
  • 5. Approach 2 pseudocode walkthrough.mp4
    05:44
  • 6. Implementing the code.mp4
    04:28
  • 1. Introduction to the problem and brute force approach.mp4
    06:13
  • 2. Brute force Pseudocode walkthrough.mp4
    04:43
  • 3. Approach 2 Optimal Approach intuition.mp4
    11:27
  • 4. Pseudocode walkthrough part 1.mp4
    07:18
  • 5. Pseudocode walkthrough part 2.mp4
    06:58
  • 6. Implementing the code.mp4
    07:31
  • 1. Introduction To The Problem And Brute Force Approach.mp4
    09:02
  • 2. Optimal Solution Intuition.mp4
    06:20
  • 3. Optimal solution pseudocode walkthrough.mp4
    02:58
  • 4. Implementing the code.mp4
    04:34
  • 1. Introduction to the problem.mp4
    04:19
  • 2. Approach 1 Brute Force Approach.mp4
    04:14
  • 3. Approach 2 A Better Approach Explanation.mp4
    05:40
  • 4. PseudoCode Walkthrough For Approach 2.mp4
    03:18
  • 5. Implementing the code.mp4
    01:51
  • 6. Approach 3 Optimal Approach.mp4
    07:13
  • 7. Implementing the optimal approach.mp4
    01:29
  • 1. Problem Introduction And Brute Force Explanation.mp4
    08:01
  • 2. Pseudocode Walkthrough For Brute Force Approach.mp4
    05:43
  • 3. Approach 2 Optimal solution.mp4
    08:30
  • 4. Pseudocode Walkthrough For Optimal Approach.mp4
    05:35
  • 5. Code Implementation.mp4
    04:31
  • 1. Introduction to the problem and brute force approach.mp4
    05:07
  • 2. Pseudocode walkthrough for brute approach.mp4
    03:07
  • 3. Approach 2 better Approach.mp4
    07:04
  • 4. Implementing the code.mp4
    03:23
  • 5. Approach 3 optimal approach.mp4
    10:15
  • 6. Implementing the optimal approach.mp4
    02:23
  • 1. Explaining the problem.mp4
    05:15
  • 2. Implementing the code.mp4
    02:44
  • 1. Introduction to the problem.mp4
    04:39
  • 2. Examples of binary additions.mp4
    03:49
  • 3. Pseudocode Implementation.mp4
    04:27
  • 4. Pseudocode Walkthrough.mp4
    07:30
  • 5. Implementing the code.mp4
    05:11
  • 1. Approach 1 Introduction to the problem and brute force approach.mp4
    09:22
  • 2. Brute force Pseudocode Implementation.mp4
    02:05
  • 3. Pseudocode Walkthrough.mp4
    04:48
  • 4. Approach 2 Optimal Approach Explanation.mp4
    09:20
  • 5. Pseudocode Walkthrough.mp4
    05:47
  • 6. Code Implementation.mp4
    02:40
  • 1. Introduction to the problem and multiple approaches.mp4
    11:19
  • 2. Optimal Approach.mp4
    05:24
  • 3. Code Implementation.mp4
    02:39
  • 1. Approach 1 Intuition.mp4
    05:58
  • 2. Approach 1 Pseudocode Walkthrough.mp4
    05:09
  • 3. Approach 2 - Majority Element Intuition.mp4
    06:13
  • 4. Implementing Approach 2 code.mp4
    02:17
  • 5. Approach 3 Intuition - Optimal solution.mp4
    11:16
  • 6. Approach 3 Walkthrough - Optimal solution.mp4
    06:09
  • 7. Implementing Approach 3 (optimal approach).mp4
    02:17
  • 1. Explanation - Group Anagrams - Medium #49.mp4
    14:49
  • 2. Code - Group Anagrams - Medium #49.mp4
    04:25
  • 1. Brute force Explanation.mp4
    07:19
  • 2. Brute Force Pseudocode Walkthrough.mp4
    05:44
  • 3. Approach 2 Optimal approach.mp4
    11:42
  • 4. Implementing the code.mp4
    04:19
  • 1. Introduction to the problem.mp4
    05:47
  • 2. InputOuput for the problem.mp4
    06:39
  • 3. Intuition behind the problem.mp4
    04:49
  • 4. Pseudocode implementation.mp4
    05:44
  • 5. Pseudocode Walkthrough.mp4
    10:48
  • 1. Explanation - Minimum Window Substring - part 1.mp4
    05:52
  • 2. Explanation - Minimum window substring - part 2.mp4
    07:55
  • 3. Explanation - Minimum window substring - part 3.mp4
    14:00
  • 4. Pseudocode Implementation.mp4
    09:16
  • 5. Pseudocode Walkthrough.mp4
    07:20
  • 6. Code - Minimum Window Substring - Hard #76.mp4
    07:05
  • 1. Explanation - Merge Two Sorted Lists - Easy #21.mp4
    04:56
  • 2. Implementation - Merge Two Sorted Lists - Easy #21.mp4
    05:10
  • 3. Walkthrough - Merge Two Sorted Lists - Easy #21.mp4
    05:58
  • 4. Code - Merge Two Sorted Lists - Easy #21.mp4
    03:12
  • 1. Explanation - Linked List Cycle - Easy #141.mp4
    03:43
  • 2. Intuition - Linked List Cycle - Easy #141.mp4
    06:00
  • 3. Walkthrough - Linked List Cycle - Easy #141.mp4
    02:37
  • 4. Code - Linked List Cycle - Easy #141.mp4
    02:47
  • 1. Explanation - Reverse Linked List.mp4
    03:06
  • 2. Intuition - Reverse Linked List.mp4
    05:28
  • 3. pseudocode Implementation & Walkthrough - Reverse Linked List.mp4
    07:08
  • 4. Implementing the code - Reverse Linked List.mp4
    03:28
  • 1. Explanation - Add Two Numbers.mp4
    05:36
  • 2. Intuition - Add Two Numbers.mp4
    05:22
  • 3. Pseudocode Implementation - Add Two Numbers.mp4
    03:57
  • 4. Walkthrough - Add Two Numbers - Medium #2.mp4
    06:02
  • 5. Code - Add Two Numbers.mp4
    06:40
  • 1. Explanation - Remove Nth Node From End of List.mp4
    03:43
  • 2. Intuition - Remove Nth Node From End of List.mp4
    07:12
  • 3. Walkthrough - Remove Nth Node From End of List.mp4
    03:45
  • 4. Approach 2 Explanation - Remove Nth Node From End of List.mp4
    07:03
  • 5. Approach 2 Walkthrough - Remove Nth Node From End of List - Medium #19.mp4
    03:14
  • 6. Code - Remove Nth Node From End of List.mp4
    03:33
  • 1. Explanation - Odd Even Linked List.mp4
    04:28
  • 2. Intuition - Odd Even Linked List.mp4
    11:06
  • 3. Pseudocode Implementation - Odd Even Linked List.mp4
    02:31
  • 4. Walkthrough - Odd Even Linked List.mp4
    04:17
  • 5. Code - Odd Even Linked List.mp4
    03:19
  • 1. Explanation - Merge K Sorted Lists - Hard #23.mp4
    06:45
  • 1. Explanation - Subsets.mp4
    05:33
  • 2. Cascading solution explanation - Subsets.mp4
    04:57
  • 3. Cascading solution walkthrough - Subsets.mp4
    03:38
  • 4. Backtracking Approach 2 explanation - Subsets.mp4
    08:07
  • 5. Implementing the code.mp4
    04:11
  • 1. Explanation - Letter Combinations of a Phone Number.mp4
    04:42
  • 2. Intuition - Letter Combinations of a Phone Number.mp4
    11:57
  • 3. Walkthrough - Letter Combinations of a Phone Number.mp4
    10:21
  • 4. Code - Letter Combinations of a Phone Number.mp4
    03:06
  • 1. Explanation the problem.mp4
    04:26
  • 2. Intuition behind the problem.mp4
    08:19
  • 3. Walkthrough over the pseudocode.mp4
    07:17
  • 4. Implementing the code.mp4
    05:13
  • 1. Intuition behind the problem.mp4
    09:35
  • 2. Pseudocode implementation.mp4
    04:17
  • 3. Walkthrough over pseudocode.mp4
    11:49
  • 4. Implementing the code.mp4
    04:44
  • 1. Explaining the problem.mp4
    03:41
  • 2. Intuition behind the problem.mp4
    06:08
  • 3. Walkthrough over pseudocode.mp4
    09:03
  • 4. Implementing the code.mp4
    02:57
  • 1. Explaining the problem.mp4
    01:55
  • 2. Intuition and pseudocode implementation.mp4
    07:29
  • 3. Walkthrough over pseudocode.mp4
    06:08
  • 4. Implementing the code.mp4
    02:41
  • 1. Explaining the problem.mp4
    03:42
  • 2. Intuition behind the problem.mp4
    05:09
  • 3. Walkthrough over pseudocode.mp4
    08:19
  • 4. Coding the solution.mp4
    03:47
  • 1. Explaining the problem.mp4
    02:55
  • 2. Intuition behind the problem.mp4
    05:14
  • 3. Pseudocode implementation.mp4
    05:24
  • 4. Walkthrough over pseudocode.mp4
    05:42
  • 1. Explaining the problem.mp4
    07:07
  • 2. Optimized Solution Explanation- Kth Smallest Element in a BST - Medium #230.mp4
    11:43
  • 3. Code - Kth Smallest Element in a BST - Medium #230.mp4
    02:40
  • 1. Explaining the Serialisation.mp4
    08:49
  • 2. Walkthrough over pseudocode (Serialisation).mp4
    05:06
  • 3. Explaining the Deserialisation.mp4
    07:56
  • 4. Walkthrough over pseudocode (Deserialisation).mp4
    06:11
  • 1. Explaining the problem.mp4
    04:23
  • 2. Intuition behind the problem.mp4
    09:46
  • 3. Walkthrough over pseudocode.mp4
    11:57
  • 4. Coding the solution.mp4
    03:56
  • 1. Brute force explanation - Min Stack - Easy #155.mp4
    10:23
  • 2. Walkthrough over pseudocode.mp4
    04:29
  • 3. Optimal solution explanation.mp4
    12:29
  • 1. Explaining the problem.mp4
    06:14
  • 2. Intuition behind this problem.mp4
    07:06
  • 3. Pseudocode Implementation.mp4
    01:46
  • 4. Walkthrough over the pseudocode.mp4
    06:10
  • 5. Code - Valid Parenthesis - Easy #20.mp4
    03:42
  • 1. Explaining the problem.mp4
    09:52
  • 2. Walkthrough over pseudocode.mp4
    05:13
  • 3. Implementing the code.mp4
    03:16
  • 1. Explaining the problem.mp4
    03:57
  • 2. Intuition behind the problem.mp4
    10:51
  • 3. Walkthrough over pseudocode.mp4
    05:28
  • 4. Optimal solution explanation.mp4
    14:15
  • 5. Optimal solution pseudocode walkthrough.mp4
    04:40
  • 6. Implementing the code.mp4
    03:28
  • 1. Explanation of the problem.mp4
    10:27
  • 2. Implementing the code.mp4
    03:28
  • 1. Explanation behind the problem.mp4
    07:06
  • 2. Intuition behind the problem.mp4
    11:43
  • 3. 2nd Approach Bottom Up dynamic programming.mp4
    06:09
  • 4. Walkthrough behind pseudocode.mp4
    04:06
  • 5. Implementing the code.mp4
    04:13
  • 1. Explanation behind the problem.mp4
    04:14
  • 2. Intuition behind the problem.mp4
    07:35
  • 3. Walkthrough over pseudocode.mp4
    04:31
  • 4. Optimal solution explanation.mp4
    06:35
  • 5. Coding the solution.mp4
    03:10
  • 1. Explaining the problem.mp4
    09:20
  • 2. Intuition behind the problem.mp4
    09:51
  • 3. Implementation the pseudocode.mp4
    06:47
  • 4. Bottom up approach explanation.mp4
    03:16
  • 5. Bottom up approach walkthrough - Climbing Stairs - Easy #70.mp4
    03:45
  • 6. Bottom up optimization - Climbing Stairs - Easy #70.mp4
    02:51
  • 7. Code - Climbing Stairs - Easy #70.mp4
    02:34
  • 1. Explaining the problem.mp4
    04:57
  • 2. Intuition behind the problem.mp4
    10:16
  • 3. Pseudocode Implementation and optimisation.mp4
    07:11
  • 4. Bottom up approach explanation.mp4
    13:13
  • 1. Explaining the problem.mp4
    08:16
  • 2. Pseudocode Implementation and walkthrough.mp4
    04:53
  • 3. Implementing the code.mp4
    03:30
  • 1. Explanation of the problem.mp4
    03:03
  • 2. Initial Intuition behind the problem.mp4
    08:05
  • 3. Optimising the previous solution.mp4
    09:00
  • 4. Pseudocode Implementation.mp4
    05:33
  • 5. Walkthrough over pseudocode.mp4
    11:51
  • 6. Implementing the code.mp4
    06:48
  • 1. Explaining the problem.mp4
    21:54
  • 2. coding the implementation.mp4
    05:45
  • Description


    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
    • Algorithms and data structures
    • Strengthen your problem solving and programming skills

    Who is this for?


  • 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
  • What You Need to Know?


  • Basic Knowledge of fundamental data structures and algorithms is preferred
  • Basic Knowledge of typescript is preferred
  • If you want to submit the code yourself, you should be familiar with leetcode and have an account
  • More details


    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 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 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 typescript for this course to code our solutions, previous knowledge in typescript 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.



    Who this course is for:

    • 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

    User Reviews
    Rating
    0
    0
    0
    0
    0
    average 0
    Total votes0
    Focused display
    I am a professional software engineer with a passion for teaching and a strong believer in lifelong learning.I am not one of those guys who started programming at the age of 3 and stuff like that, I started programming in my first year of college, I struggled, built stuff, failed many times and finally through countless hours of hard work I managed to become a professional software engineer in a very respectable company that you probably heard of.I am here to teach you all that I know about software engineering, web development, data structures and algorithmsI hope to save you tons of hours skimming through tens of resources online as I did, and I sincerely hope that I could benefit you as much as possible
    Students take courses primarily to improve job-related skills.Some courses generate credit toward technical certification. Udemy has made a special effort to attract corporate trainers seeking to create coursework for employees of their company.
    • language english
    • Training sessions 217
    • duration 22:32:33
    • Release Date 2023/10/04

    Courses related to Coding Interview

    Courses related to TypeScript