Name: LeetCode in Java: Algorithms Coding Interview Questions
Rating: 4.2 (423 reviews)

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

16 sections • 140 lectures • 27h 43m total length

Preview00:42

Preview05:43
Longest Common Prefix (LeetCode 14)
08:23
Reverse Words in a String (LeetCode 151)
11:15
Longest Palindromic Substring (LeetCode 5)
08:42
[OLD Video] Longest Palindromic Substring (LeetCode 5)
11:51
Longest Substring without Repeating Characters (LeetCode 3)
10:49
Valid Parentheses (LeetCode 20)
05:25
Decode String (LeetCode 394)
15:56
Preview13:16
Valid Anagram (LeetCode 242)
20:24
Repeated DNA Sequences (LeetCode 187)
11:00
Integer to English Words (LeetCode 273)
22:45

Sort Colors (LeetCode 75)
14:02
Merge Sorted Array (LeetCode 80)
11:18
Two Sum (LeetCode 1)
07:25
Binary Search (LeetCode 704)
10:03
Length of Last Word (LeetCode 58)
04:45
Plus One (LeetCode 66)
07:46
Jump Game (LeetCode 55)
19:22
Preview04:53
Asteroid Collision (LeetCode 753)
10:34
Kids with Greatest Number of Candies (LeetCode 1431)
08:00
Average Salary Excluding the Minimum and Maximum (LeetCode 1491)
04:21
Best Time to Buy And Sell Stock
08:30
Best Time to Buy and Sell Stock II (LeetCode 122)
05:50
Find All Disappeared Numbers in an Array (LeetCode 448)
10:36
Find All Duplicates Numbers in an Array (Leetcode 442)
08:02
Pascal's Triangle (LeetCode 118)
16:50
Pascal's Triangle II (LeetCode 119)
12:37
Sequential Digits (LeetCode 1291)
07:21
Product of Array Except Self (LeetCode 238)
08:51
Gas Station (LeetCode 134)
09:35
Rotate Array (LeetCode 189)
10:42
Minimum Domino Rotations For Equal Row (LeetCode 1007)
11:26
Subarray Product Less than K (LeetCode 713)
25:36
Jump Game III (LeetCode 1306)
10:23
K-Diff Pairs in an Array (LeetCode 532)
15:06
[NEW] Majority Element :: 3 Solutions :: (LeetCode 169)
21:06
[OLD] Majority Element - O(n) Space Solution (LeetCode 169)
10:50
[OLD] Majority Element - O(1) Space Solution (LeetCode 169)
07:16
House Robber II (LeetCode 213)
22:12
[OLD]House Robber II (LeetCode 213)
12:20
Maximum Product Subarray (LeetCode 152)
13:43
Group Anagrams (LeetCode 49)
06:39
132 Pattern :: 3 Solution :: (LeetCode 456)
21:19
First Missing Positive (LeetCode 41)
25:04
Sliding Window Maximum (LeetCode 239)
10:14
Median of Two Sorted Arrays (LeetCode 4)
22:48

Flatten Binary Tree to Linked List (LeetCode 114)
13:07
Add Two Linked Lists || Add Two Numbers II (LeetCode 445)
08:03
Odd Even Linked List (LeetCode 238)
09:48
Rotate List (LeetCode 61)
12:31
Swap Nodes In Pairs [Iterative] (LeetCode 24)
08:00
Swap Nodes In Pairs [Recursive] (LeetCode 24)
09:16
Middle of a Linked List (LeetCode 876)
04:21
Linked List Cycle ii (LeetCode 142)
16:54
[OLD] Linked List Cycle ii (LeetCode 142)
06:50
Linked List Cycle (LeetCode 141)
06:47
Preview13:13
[New video] Reverse Linked List [Iterative] (LeetCode 206)
08:31
[New video] Reverse Linked List [Recursive] (LeetCode 206)
08:50
Merge Two Sorted Lists (LeetCode 21)
10:37
Intersection of Two Linked List (LeetCode 160)
08:23
Palindrome Linked List (LeetCode 234)
10:08
Copy List with Random Pointer (LeetCode 138)
06:28
Reverse Nodes in k-group (LeetCode 25)
11:03
LRU Cache (LeetCode 146)
16:46
Design Linked List (LeetCode 707)
15:39

Tree Traversal Techniques in Details (Preorder, Inorder, Postorder)
21:02
Binary Tree Preorder Traversal ::Recursive + Iterative Solution:: (LeetCode 144)
20:04
Binary Tree Inorder Traversal ::Recursive + Iterative Solution:: (LeetCode 94)
17:23
Binary Tree Post Order Traversal ::Recursive + Iterative:: (LeetCode 145)
17:27
Level Order Traversal Binary Tree ::Recursive + Iterative:: (LeetCode 102)
15:32
[OLD] Level Order Traversal Binary Tree (LeetCode 102)
07:29
Binary Tree Zigzag Level Order Traversal ::Recursive + Iterative::(LeetCode 103)
25:07
Convert Sorted Array to Binary Search Tree (LeetCode 108)
11:55
Construct Binary Search Tree from Preorder Traversal (LeetCode 1008)
13:51
Diameter of Binary Tree (LeetCode 543)
14:51
Range Sum of BST (LeetCode 938)
04:01
Same Tree (LeetCode 100)
11:19
[New] Flip/Invert Binary Tree (LeetCode 226)
06:58
[OLD] Flip/Invert Binary Tree (LeetCode 226)
06:30
Minimum Depth of Binary Tree (LeetCode 111)
07:50
Maximum Depth of Binary Tree (LeetCode 104)
06:39
Balanced Binary Tree (LeetCode 110)
10:18
Insert into a Binary Search Tree (LeetCode 701)
05:56
Preview10:58
Binary Tree Maximum Path Sum (LeetCode 124)
07:32
Implement Trie (LeetCode 208)
14:18
Validate Binary Search Tree (LeetCode 98)
24:36
Robber House III (LeetCode 337)
10:52
Lowest Common Ancestor of Binary Tree (LeetCode 236)
21:13

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

Md. A. Barik

Software Engineer

4.2 Instructor Rating
2,772 Reviews
242,554 Students
14 Courses

Hi! My name is Md. A. Barik

I'm a software engineer with a great passion. I'm programming from the age of just 16 years. I have always had a fascinations in computer and technology from early in life.

Having been a self taught programmer, I understood that there is an overwhelming number of online courses, tutorials and books that are overly verbose and inadequate at teaching proper skills. Most people feel paralyzed and don't know where to start when learning a complex subject matter, or even worse, most people don't have $20,000 to spend on a coding bootcamp. Programming skills should be affordable and open to all. An education material should teach real life skills that are current and they should not waste a student's valuable time. I have learned an important lessons from my programming career. I'm trying to teach others valuable programming skills in order to take control of their life and work in an exciting company with infinite possibilities.

I promises that there are very few courses out there as comprehensive and as well explained.

See you inside the courses!

LeetCode in Java: Algorithms Coding Interview Questions

What you'll learn

Course content

Introduction1 lecture • 1min

Intergers4 lectures • 29min

Strings12 lectures • 2hr 25min

Arrays36 lectures • 7hr 17min

Two Pointer6 lectures • 1hr 7min

Famous Algorithm2 lectures • 22min

Sorting Algorithms2 lectures • 30min

2D Arrays / Matrix7 lectures • 1hr 23min

Linked List20 lectures • 3hr 25min

Tree, Stack, Queue24 lectures • 5hr 14min

Requirements

Description

Who this course is for:

Instructor