Udemy
    •  
    •  
    •  
    •  
    •  
    •  
    •  
    •  
Subscribe
Turn what you know into an opportunity and reach millions around the world.
Learn More
Your cart is empty.
Keep shopping
Leetcode Questions Solutions Explained 5
Rating: 4.8 out of 5(8 ratings)
1,501 students

Leetcode Questions Solutions Explained 5

Solving Microsoft, Google, Airbnb, Uber, Amazon interview questions
Created byKado Data
Last updated 11/2020
English
English [Auto],

What you'll learn

  • coding interview
  • Coding Interview preparation
  • Java Development
  • Algorithms

Course content

1 section • 10 lectures • 1h 35m total length

  • Sqrtx | Microsoft, LinkedIn, amazon interview question6:56

    Learn to compute the integer square root with binary search, using left and right pointers, truncating decimals, and an overflow-safe mid. Apply to interview questions from Amazon, Microsoft, and LinkedIn.

  • Sort Colors | Microsoft Interview Question | Leetcode 757:41

    Learn an in-place three-color sort using two pointers to arrange red, white, and blue (0, 1, 2), placing zeros first, twos last, and ones in the middle with swaps.

  • Last Stone Weight | Amazon | Facebook | Microsoft Interview question6:13

    Master the last stone weight problem by using a max-heap priority queue to repeatedly smash the two heavy stones, insert the difference back, and determine the final weight or zero.

  • Unique Paths | Leetcode | Microsoft , Amazon,Interview question12:52

    Learn to count unique paths in a grid from the top-left to bottom-right using dynamic programming and memorization, with examples inspired by Microsoft and Amazon interview questions.

  • Number of Islands | Google Interview Question | Leetcode 20010:22

    Count islands in a grid of ones and zeros by using a depth-first search to mark connected lands (horizontal or vertical) and count each unvisited group.

  • merge two sorted lists | Leetcode 2114:18

    Learn to merge two sorted linked lists into a new sorted list using a dummy node and two pointers, achieving linear time with constant space.

  • Subarray Sum Equals K O(n) Solution12:40

    Learn the O(n) solution to count subarrays with sum equal to k using a cumulative sum and a hash map, contrasting brute force with efficient hashing.

  • Squares of a sorted array | Leetcode | Microsoft , Amazon,Interview question7:16

    Learn to generate a sorted array of squares from a sorted input with negative numbers using a two-pointer approach, producing an efficient linear-time solution.

  • find all duplicates in an array | Leetcode | Microsoft ,Interview question7:59

    Learn to find all elements that appear twice in an integer array in linear time without extra space by marking visited indices with negation.

  • Valid Parentheses | Amazon, Facebook , Linkedin interview question | Leetcode 209:19

    Master the valid parentheses problem by using a stack to push openings, match and pop closings, and ensure the stack is empty at the end for a valid string.

Requirements

  • Basic Data Structures and Algorithms

Description

Technical interviews at Google, Amazon, Microsoft, Uber, and Airbnb are designed to test your thinking, not your memory. If you’ve ever looked at a hard problem and didn’t know where to start, this course is your roadmap.

I’ve traded the code editor for a whiteboard to give you a front-row seat to the problem-solving process. We aren't just writing scripts; we are drawing out the logic, visualizing the data flow, and building the "Why" behind every solution.

Why this approach works:

* Visual Deconstruction: We break down high-level problems into simple, digestible diagrams.

* The "First 5 Minutes" Strategy: Learn exactly how to analyze a prompt and choose the right data structure before you write a single line of code.

* Edge-Case Mastery: We don't just solve for the happy path; we prepare for the tricky constraints that top-tier interviewers use to test your limits.

* Communication Mastery: Learn the specific vocabulary you need to explain your logic clearly and confidently during the live interview.

This isn't about getting the right answer once—it's about developing a repeatable system that works for every question, from Arrays and Strings to Dynamic Programming and Graphs. Join me on the whiteboard and turn your technical interview from a source of stress into a showcase of your engineering talent.

What makes this variation unique:

* Visual Focus: It emphasizes "drawing out the logic" and "visualizing data flow," which appeals to visual learners.

* Psychological Angle: It uses phrases like "stop guessing" and "source of stress," which resonates with the emotional state of many candidates.

* The "Roadmap" Metaphor: It positions the course as a guide through the "unknown."

Would you like me to focus a version specifically on "System Design" questions, or should we stick to "Data Structures and Algorithms"?


Who this course is for:

  • Beginner to Advanced Programmers

Report abuse