Leetcode Coding Interview Question Solution Explanation

  1. Home
  2. Coding-interview
  3. Leetcode Coding Interview Question Solution Explanation

Tags: Coding Interview

Ace your next coding interview by solving essential coding interview questions and get an offer from big tech company.

Last updated 2022-01-10 | 4.1

- Solve Easy to Hard Difficulty Problems
- How to solve some of the classical coding interview questions
- How to breaking down the coding interview problems in a decomposition manner

What you'll learn

Solve Easy to Hard Difficulty Problems
How to solve some of the classical coding interview questions
How to breaking down the coding interview problems in a decomposition manner
Strengthen your problem solving skills

* Requirements

* Basic Knowledge of fundamental data structures and algorithms is preferred
* A Computer or Smart Phone with internet connection

Description

Welcome to "LeetCode in Java: Algorithms Coding Interview Questions" course!

In this course, you'll have a detailed, step by step explanation of classical hand-picked LeetCode Problems where you'll learn about the optimum ways to solve technical coding interview question. This is the course I wish I had when I was preparing myself for the interviews. This course comes with a 30-day money-back guarantee. So nothing to lose!

What is LeetCode?

LeetCode is a huge repository of real interview questions asked by the most popular tech industries( Google, Amazon, Facebook, Microsoft, Apple, Quora, LinkedIn, Bloomberg, Uber, Goldman Sachs, Twitter and more ).

Interviewers from the most popular companies(like Google, Amazon, Facebook, Uber, Twitter etc.) often directly ask questions they find on LeetCode. It's hard to navigate through the large amount of problems(around 1500) to most important questions, this is what this course stand for.

I spent countless hours on LeetCode. From my experience, I'm telling you that you don't have to do the all problem and still be able to get a job at a big tech industry.

By the time you're finished with the course, you will be prepared for common technical coding interview questions.

See you inside the course!

Who this course is for:

  • Who want to succeed the technical coding interview at companies like Google, Facebook, Microsoft, Amazon, etc.
  • People who want to developed their problem solving skill
  • Who want to ace their technical coding interview
  • Students getting ready for their internship

Course content

16 sections • 143 lectures

Introduction 1 lectures

Introduction Preview 00:42

Intergers 4 lectures

FizzBuzz (LeetCode 412) Preview 04:36

Palindrome Number (LeetCode 9) Preview 06:47

Factorial Trailing Zeroes (LeetCode 172) Preview 06:39

Pow(x, n) (LeetCode 50) Preview 10:59

Strings 12 lectures

Reverse String (LeetCode 344) Preview 05:43

Longest Common Prefix (LeetCode 14) Preview 08:23

Reverse Words in a String (LeetCode 151) Preview 11:15

Longest Palindromic Substring (LeetCode 5) Preview 08:42

[OLD Video] Longest Palindromic Substring (LeetCode 5) Preview 11:51

Longest Substring without Repeating Characters (LeetCode 3) Preview 10:49

Valid Parentheses (LeetCode 20) Preview 05:25

Decode String (LeetCode 394) Preview 15:56

Word Break (LeetCode 139) Preview 13:16

Valid Anagram (LeetCode 242) Preview 20:24

Repeated DNA Sequences (LeetCode 187) Preview 11:00

Integer to English Words (LeetCode 273) Preview 22:45

Arrays 37 lectures

Sort Colors (LeetCode 75) Preview 14:02

Merge Sorted Array (LeetCode 80) Preview 11:18

Two Sum (LeetCode 1) Preview 07:25

Binary Search (LeetCode 704) Preview 10:03

Length of Last Word (LeetCode 58) Preview 04:45

Plus One (LeetCode 66) Preview 07:46

Jump Game (LeetCode 55) Preview 19:22

Move Zeroes (LeetCode 283) Preview 04:53

Asteroid Collision (LeetCode 753) Preview 10:34

Kids with Greatest Number of Candies (LeetCode 1431) Preview 08:00

Average Salary Excluding the Minimum and Maximum (LeetCode 1491) Preview 04:21

Best Time to Buy And Sell Stock Preview 08:30

Best Time to Buy and Sell Stock II (LeetCode 122) Preview 05:50

Find All Disappeared Numbers in an Array (LeetCode 448) Preview 10:36

Find All Duplicates Numbers in an Array (Leetcode 442) Preview 08:02

Pascal's Triangle (LeetCode 118) Preview 16:50

Pascal's Triangle II (LeetCode 119) Preview 12:37

Sequential Digits (LeetCode 1291) Preview 07:21

Product of Array Except Self (LeetCode 238) Preview 08:51

Gas Station (LeetCode 134) Preview 09:35

Rotate Array (LeetCode 189) Preview 10:42

Minimum Domino Rotations For Equal Row (LeetCode 1007) Preview 11:26

Subarray Product Less than K (LeetCode 713) Preview 25:36

Jump Game III (LeetCode 1306) Preview 10:23

K-Diff Pairs in an Array (LeetCode 532) Preview 15:06

Degree of an Array (LeetCode 697) Preview 18:33

[NEW] Majority Element :: 3 Solutions :: (LeetCode 169) Preview 21:06

[OLD] Majority Element - O(n) Space Solution (LeetCode 169) Preview 10:50

[OLD] Majority Element - O(1) Space Solution (LeetCode 169) Preview 07:16

House Robber II (LeetCode 213) Preview 22:12

[OLD]House Robber II (LeetCode 213) Preview 12:20

Maximum Product Subarray (LeetCode 152) Preview 13:43

Group Anagrams (LeetCode 49) Preview 06:39

132 Pattern :: 3 Solution :: (LeetCode 456) Preview 21:19

First Missing Positive (LeetCode 41) Preview 25:04

Sliding Window Maximum (LeetCode 239) Preview 30:59

Median of Two Sorted Arrays (LeetCode 4) Preview 22:48

Two Pointer 6 lectures

Is Subsequence (LeetCode 392) Preview 07:11

Valid Palindrome (LeetCode 125) Preview 07:52

Squares of a Sorted Array (LeetCode 977) Preview 07:38

Remove Duplicates from Sorted Array (LeetCode 26) Preview 06:42

Trapping Rain Water (LeetCode 42) Preview 21:40

3 Sum (LeetCode 15) Preview 15:38

Famous Algorithm 2 lectures

Kaden's Algorithm (Maximum Subarray :: LeetCode 53) Preview 17:00

[OLD] Kaden's Algorithm (Maximum Subarray :: LeetCode 53) Preview 05:08

Sorting Algorithms 2 lectures

Merge Sort ::Sort an Array (LeetCode 912) Preview 13:21

Quick Sort ::Sort an Array (LeetCode 912) Preview 16:33

2D Arrays / Matrix 7 lectures

Rotate Image (LeetCode 48) Preview 08:25

Remove Covered Interval (LeetCode 1288) Preview 07:05

Merge Intervals (LeetCode 56) Preview 04:15

Matrix Diagonal Sum (LeetCode 1572) Preview 08:36

Search a 2D Matrix (LeetCode 74) Preview 10:57

Set Matrix Zeroes(3 Solutions) (LeetCode 73) Preview 27:39

Spiral Matrix (LeetCode 54) Preview 15:37

Linked List 20 lectures

Flatten Binary Tree to Linked List (LeetCode 114) Preview 13:07

Add Two Linked Lists || Add Two Numbers II (LeetCode 445) Preview 08:03

Odd Even Linked List (LeetCode 328) Preview 09:48

Rotate List (LeetCode 61) Preview 12:31

Swap Nodes In Pairs [Iterative] (LeetCode 24) Preview 08:00

Swap Nodes In Pairs [Recursive] (LeetCode 24) Preview 09:16

Middle of a Linked List (LeetCode 876) Preview 04:21

Linked List Cycle ii (LeetCode 142) Preview 16:54

[OLD] Linked List Cycle ii (LeetCode 142) Preview 06:50

Linked List Cycle (LeetCode 141) Preview 06:47

Reverse Linked List [Iterative + Recursive] (LeetCode 206) Preview 13:13

[New video] Reverse Linked List [Iterative] (LeetCode 206) Preview 08:31

[New video] Reverse Linked List [Recursive] (LeetCode 206) Preview 08:50

Merge Two Sorted Lists (LeetCode 21) Preview 10:37

Intersection of Two Linked List (LeetCode 160) Preview 08:23

Palindrome Linked List (LeetCode 234) Preview 21:36

Copy List with Random Pointer (LeetCode 138) Preview 06:28

Reverse Nodes in k-group (LeetCode 25) Preview 11:03

LRU Cache (LeetCode 146) Preview 16:46

Design Linked List (LeetCode 707) Preview 15:39

Tree, Stack, Queue 24 lectures

Tree Traversal Techniques in Details (Preorder, Inorder, Postorder) Preview 21:02

Binary Tree Preorder Traversal ::Recursive + Iterative Solution:: (LeetCode 144) Preview 20:04

Binary Tree Inorder Traversal ::Recursive + Iterative Solution:: (LeetCode 94) Preview 17:23

Binary Tree Post Order Traversal ::Recursive + Iterative:: (LeetCode 145) Preview 17:27

Level Order Traversal Binary Tree ::Recursive + Iterative:: (LeetCode 102) Preview 15:32

[OLD] Level Order Traversal Binary Tree (LeetCode 102) Preview 07:29

Binary Tree Zigzag Level Order Traversal ::Recursive + Iterative::(LeetCode 103) Preview 25:07

Convert Sorted Array to Binary Search Tree (LeetCode 108) Preview 11:55

Construct Binary Search Tree from Preorder Traversal (LeetCode 1008) Preview 13:51

Diameter of Binary Tree (LeetCode 543) Preview 14:51

Range Sum of BST (LeetCode 938) Preview 04:01

Same Tree (LeetCode 100) Preview 11:19

[New] Flip/Invert Binary Tree (LeetCode 226) Preview 06:58

[OLD] Flip/Invert Binary Tree (LeetCode 226) Preview 06:30

Minimum Depth of Binary Tree (LeetCode 111) Preview 07:50

Maximum Depth of Binary Tree (LeetCode 104) Preview 06:39

Balanced Binary Tree (LeetCode 110) Preview 10:18

Insert into a Binary Search Tree (LeetCode 701) Preview 05:56

Serialize and deserialize binary tree (LeetCode 297) Preview 10:58

Binary Tree Maximum Path Sum (LeetCode 124) Preview 07:32

Implement Trie (LeetCode 208) Preview 14:18

Validate Binary Search Tree (LeetCode 98) Preview 24:36

Robber House III (LeetCode 337) Preview 10:52

Lowest Common Ancestor of Binary Tree (LeetCode 236) Preview 21:13

Graph 3 lectures

Number of Islands (LeetCode 200) Preview 18:25

Clone a Graph (LeetCode 133) Preview 12:28

Pacific Atlantic Water Flow (LeetCode 417) Preview 04:43

Fibonacci Sequence 1 lectures

Climbing Stairs Preview 07:15

Backtracking / Recursion 5 lectures

Generate Parentheses (LeetCode 22) Preview 08:47

Combination Sum (LeetCode 39) Preview 11:50

Combination Sum iii (LeetCode 216) Preview 10:08

Subsets (LeetCode 78) Preview 12:49

Letter Combinations of a Phone Number (LeetCode 17) Preview 11:40

Dynamic Programming 10 lectures

Climbing Stairs (LeetCode 70) Preview 10:25

Fibonacci Number :: 3 Solutions :: (LeetCode 509) Preview 25:09

Minimum Path Sum (LeetCode 64) Preview 11:32

House Robber (LeetCode 198) Preview 16:38

Longset Increasing Subsequence(LeetCode 300) Preview 16:03

Best Time to Buy and Sell Stock IV (LeetCode 188) Preview 16:57

Longest Common Subsequence (LeetCode 1143) Preview 11:07

Edit Distance (LeetCode 72) Preview 13:00

Wilcard Matching (LeetCode 44) Preview 15:58

Regular Expression Matching (LeetCode 10) Preview 22:37

Bit Manipulation 8 lectures

Number of 1 Bits (LeetCode 191) Preview 08:59

Find the Difference (LeetCode 389) Preview 05:05

Reverse Bits (LeetCode 190) Preview 06:02

Hamming Distance (LeetCode 461) Preview 08:11

Complement of Base 10 Integer (LeetCode 1009) Preview 09:03

Counting Bits (LeetCode 338) Preview 16:11

Sum of Two Integers (LeetCode 371) Preview 13:58

Divide Two Integers (LeetCode 29) Preview 23:23

Design 1 lectures

Design a Stack ::Min Stack:: (LeetCode 155) Preview 09:29