Data Structures & Algorithms in Java + 130 Leetcode Problems
Loại khoá học: Programming Languages
Mastering Leetcode In Java - Step By Step
Mô tả
The "Mastering the Top 100 Leetcode Problems" course is a comprehensive training program designed to help you excel in coding interviews by focusing on the top 100 Leetcode problems.
Leetcode is a well-known platform that offers a vast collection of coding challenges frequently used by tech companies during their hiring process.
In this course, we will tackle the most frequently encountered problems in coding interviews.
Each problem will be thoroughly analyzed, providing you with valuable insights into the underlying concepts and problem-solving techniques.
You will learn how to approach problems systematically, break them down into smaller manageable tasks, and devise efficient algorithms to solve them.
A key aspect of this course is the live implementation of code.
Each problem will be demonstrated in real-time, allowing you to witness the coding process firsthand.
This practical approach will help solidify your understanding and improve your coding skills.
You will gain insights into efficient coding practices, optimization techniques, and common pitfalls to avoid.
We will go over each of the problems in extreme detail, going through the thought process, and live implementation for the code.
To support your learning journey, the course will provide code sample files accompanying the video lectures.
These resources will serve as valuable references and guides, assisting you in implementing the solutions effectively.
Bạn sẽ học được gì
Yêu cầu
Nội dung khoá học
20 sections
How to get started with Leetcode ?
04:24
Introduction to Time & Space Complexity
05:52
What is Big O Notation ?
08:06
Checking If Big O Notation Is Acceptable
08:44
Calculating Time Complexity Example 1
09:56
Calculating Time Complexity Example 2
09:13
Myth About Time Complexity 1
04:35
Calculating Space Complexity
11:20
Calculating Time Complexity Of Recursive Cases
08:12
Space Complexity Calculation Simple Case
04:57
Recursive Time Complexity Example 2
11:53
Recursive Space Complexity Example 2
03:33
Time Complexity Live Demonstration
05:18
Leetcode #53 - Maximum Sum Subarray - Java
12:22
Leetcode #121 - Best Time To Buy And Sell A Stock - Java
10:02
Leetcode #152 - Maximum Product Subarray - Java
15:19
Leetcode #238 - Product Of Array Except Self - Java
11:23
Leetcode #189 - Rotate Array - Java
09:16
Leetcode #485 - Max Consecutive Ones
03:55
Leetcode #36 - Valid Sudoku - Java
10:35
Leetcode #973 - K Closest Points To Origin - Java
06:57
Practice Problem 4 - Encode and Decode Strings
14:47
Sliding Window Introduction
07:18
Sliding Window Part 2
06:14
Sliding Window Implementation
07:23
Practice Problem 3 - Longest Substring Without Repeating Characters
19:07
Leetcode #424 - Longest Repeating Character Replacement
10:58
Leetcode #239 - Sliding Window Maximum - Java
22:47
Leetcode #11 - Container With Most Water - Java
09:29
Leetcode #42 - Trapping Rain Water - Java
06:40
Leetcode #167 - Two Sum II - Input Array Is Sorted - Java
13:45
Valid Palindrome - Java
06:53
Leetcode #57 - Insert Interval
09:08
Leetcode #35 - Search Insert Position - Java
14:24
Practice Problem 3 - Merge Intervals
13:42
Leetcode #252 - Meeting Rooms - Java
06:24
Leetcode #435 - Non Overlapping Intervals
06:34
Leetcode #73 - Set Matrix Zero - Java
12:03
Leetcode #48 - Rotate Image
10:01
Leetcode #54 - Spiral Matrix - Java
11:33
Pow (X, N)
09:04
Leetcode #169 - Majority Element - Java
10:38
Leetcode #283 - Move Zeroes - Java
10:15
Introduction To Backtracking
13:56
Backtracking Example 1
08:23
Leetcode #39 -Combination Sum - Java
11:55
Leetcode #78 - Subsets - Java
11:31
Leetcode #51 - N Queens - Java
18:20
Leetcode #46 - Permutations - Java
11:11
Leetcode #90 - Subsets II - Java
11:11
Leetcode #40 - Combinations Sum II
15:56
Leetcode #17 - Letter Combinations Of A Phone Number
09:26
Leetcode #79 - Word Search
14:11
Leetcode #212 - Word Search II
12:36
Introduction To Binary Search
09:18
Binary Search Implementation
04:05
Binary Search Complexity
06:45
Leetcode #34 - Find First And Last Position Of Element In Sorted Array - Java
10:43
Leetcode #33 -Search In A Rotated Sorted Array - Java
16:23
Leetcode #875 - Koko Eating Bananas - Java
13:22
Leetcode #1552 -Magnetic Force Between Two Balls - Java
18:08
Leetcode #153 - Find Minimum In A Rotated Sorted Array - Java
09:05
Introduction To Binary Search Trees
08:36
Height Balanced BST
01:02
BST Insertion
06:19
Inorder Successor And Predecessor
04:31
BST Deletion
13:18
Leetcode #230 - Kth Smallest Element In BST - Java
06:32
Leetcode #98 - Validate Binary Search Tree - Java
09:44
Leetcode #235 - Lowest Common Ancestor Of A Binary Search Tree - Java
06:23
Introduction to Binary Trees
08:39
Terms Related To Trees
07:36
Level Order Traversal
02:56
Tree Traversal Algorithms
09:24
Leetcode #94 - Binary Tree InOrder Traversal - Java
02:55
Leetcode #101 - Symmetric Tree - Java
08:02
Leetcode #104 - Maximum Depth Of A Binary Tree - Java
08:17
Leetcode #226 - Invert Binary Tree - Java
04:50
Leetcode #543 - Diameter Of A Binary Tree - Java
14:04
Leetcode #102 - Binary Tree Level Order Traversal - Java
10:23
Leetcode #112 - Path Sum - Java
09:05
Leetcode #113 - Path Sum II - Java
15:39
Leetcode #993 - Cousins in Binary Tree - Java
08:43
Leetcode #1161 - Maximum Level Sum of Binary Tree - Java
09:54
Leetcode #100 - Same Tree - Java
04:18
Leetcode #105-Construct Binary Tree FromPreorder and inorder Traversal-Java
10:38
Leetcode #572 - Subtree Of Another Tree - Java
06:16
Leetcode #110 - Balanced Binary Tree - Java
07:33
Leetcode #199 - Binary Tree Right Side View - Java
05:40
Leetcode #1448 - Count Good Nodes In Binary Tree - Java
07:40
Leetcode #404 - Sum Of Left Leaves - Java
06:54
Leetcode #124 - Binary Tree Maximum Path Sum
13:31
Leetcode #208 - Implement Trie (Prefix Sum Tree)
17:30
Leetcode #211 - Design Add and Search Word Data Structure
09:49
Leetcode #297 - Serialize and Deserialize Binary Tree
09:55
Introduction to Bitwise Operators
04:43
Common Bitwise Operators
07:11
Leetcode #136 - Single Number - Java
06:01
Leetcode #338 - Counting Bits - Java
10:52
Leetcode #287 - Find the Duplicate Number - Java
09:47
Leetcode #29 - Divide Two Integers - Java
15:04
Leetcode #268 - Missing Number - Java
05:35
Leetcode #191 - Number of 1 Bits - Java
06:34
Leetcode #371 - Sum Of Two Integers - Java
08:57
Leetcode #7 - Reverse Integer - Java
07:21
Introduction to Dynamic Programming
11:39
Leetcode #70 - Climbing Stairs - Java
14:37
Leetcode #55 - Jump Game - Java
13:07
Practice Problem 3-Coin Change
16:24
Practice Problem 4-Target Sum
17:23
Practice Problem 5 - Longest Common Subsequence
15:11
Practice Problem 6 - House Robber
13:35
Practice Problem 7 - Longest Increasing Subsequence
13:34
Practice Problem 8 - Partition Equal Subset Sum
13:52
Practice Problem 9 0-1 Matrix
17:52
Practice Problem 10 - Integer Replacement
10:33
Practice Problem 12 - Decode Ways
16:12
Practice Problem 13 - House Robber II
08:44
Practice Problem 14 - Min Cost Climbing Stairs
07:15
Practice Problem 15 - Longest Palindromic Substring
13:32
Practice Problem 16 - Word Break
16:02
Practice Problem 17 - Unique Paths
16:12
Practice Problem 18 - Palindromic Substrings
11:49
What Are Graphs
07:26
Directed vs Undirected Graphs
06:17
Weighted vs Unweighted Graphs
06:13
Terms Of Graphs Part 1
05:51
Types Of Graphs Part 1
05:49
Types Of Graphs Part 2
11:29
Implementing Graphs Part 1
06:28
Implementing Graphs Part 2
10:19
Graph Implementation Part 3
04:47
Graph Adjacency Matrix Demonstration
07:57
Graph Adjacency List Demonstration
08:26
Introduction To Traversals
08:13
BFS Working
09:08
BFS Implementation
10:52
Rotting Oranges Property Solution
10:27
BFS Property 1
10:12
BFS Over Binary WeightedGraphs
09:49
Introduction to DFS
09:56
DFS Iterative Implementation
07:31
DFS Recursive Implementation
06:36
DFS Important Properties
04:59
Cycle Detection Part 1
08:30
Cycle Detection Part 2
04:25
Cycle Detection Part 3
05:24
Cycle Detection Implementation
07:50
What Is Topological Sorting
05:48
Topological Sorting Example 1
06:23
Single Source Shortest Path Algorithm
04:56
Djkitras Algorithm
09:17
Djkitras Algorithm Implementation
15:28
Introduction To Bellman Ford Algorithm
05:45
Bellman Ford Algorithm Working
08:26
Introduction To Minimum Spanning Tree
04:13
Prims Algorithm
05:41
Prims Algorithm Implementation
07:36
Practice Problem 1-Course Schedule
14:46
Practice Problem 2-Number Of Islands
13:39
Practice Problem 3-Find the Town Judge
09:35
Practice Problem 4-Surrounded Regions
17:04
Practice Problem 5-Number of Enclaves
10:23
Practice Problem 6 - Flood Fill
06:09
Practice Problem 7 - Network Delay Time
07:57
Practice Problem 8 - Rotting Oranges
17:55
Practice Problem 9 - Graph Valid Tree
09:54
Practice Problem 10 - Number Of Connected Components In An Undirected Graph
09:08
Practice Problem 12 - Alien Dictionary
17:05
Practice Problem 13 - Clone Graph
09:25
What Is Hash Table
04:00
Advantage Of Hash Table
00:28
How Is Hash Table Implemented
12:06
Types Of Hash Table
04:12
Hash Table Usage
10:14
Practice Problem 1 - Two Sum
10:54
Practice Problem 2 - Three Sum
25:03
Practice Problem 3 - Longest Consecutive Sequence
11:43
Practice Problem 4 - Contains Duplicate
03:15
Practice Problem 5 - Valid Anagram
04:03
Practice Problem 2 - Group Anagrams
08:19
Introduction To Heaps
11:10
Implementation Of Heaps
09:45
Insertion in heaps
06:28
Deletion in heaps
07:25
Practice Problem 1 - Kth Largest Element In An Array
09:58
Practice Problem 2 - Find Median from Data Stream
14:38
Practice Problem 3 - Kth Largest Element In A Stream
09:08
Leetcode #1046 - Last Stone Weight - Java
05:54
Leetcode #23 - Merge K Sorted Lists
08:51
Leetcode #253 - Meeting Rooms II
11:32
Leetcode #347 - Top K Frequent Elements
10:25
Drawback Of Arrays
05:33
What Is Linked List
11:01
Implementing Linked Lists
05:57
Iterating Over Linked Lists
05:15
Inserting In Linked List
08:36
Deleting From Front In Linked List
04:51
What Is Doubly Linked List
03:18
Linked List Class In Java
03:56
Creating Linked Lists
01:42
Using Iterators To Iterate
03:31
Contains
01:22
Iterating In Reverse Order
02:00
Add Methods In Linked List
05:39
Removal Methods In Linked Lists
05:27
Practice Problem 1 - Intersection Of Two Linked Lists
14:02
Practice Problem 2 - Merge Two Sorted Lists
11:47
Practice Problem 3 - Linked List Cycle
08:40
Practice Problem 4-Reverse Linked List
08:24
Practice Problem 5-Palindrome Linked List
18:51
Practice Problem 6 - Linked List Cycle II
09:03
Practice Problem 7 - Find Middle Of The Linked List
06:10
Practice Problem. 8 - Remove Nth Node From End Of List
09:21
Practice Problem 9 - Add Two Numbers
10:24
Practice Problem 10 - Reorder List
09:12
Practice Problem 1 - Valid Paranthesis
10:28
Practice Problem 2 - Min Stack
12:41
Practice Problem 3-Next Greater Element II
18:26
Practice Problem 4 - Evaluate Reverse Polish notation
07:48
Introduction To Greedy Algorithms
13:16
Practice Problem 1 - Minimum Add To Make Parantheses Valid
08:14
Viết Bình Luận
Khoá học liên quan
![Java Certification : OCA (1Z0-808) Exam Simulation [2023]](/uploads/courses/udemy/1464072_c364_6.jpg)
![10 Sample Exams ISTQB Foundation Level (CTFL) v4.0 [NEW!]](/uploads/courses/udemy/3228307_dcb2_10.jpg)
Đăng ký get khoá học Udemy - Unica - Gitiho giá chỉ 50k!
Get khoá học giá rẻ ngay trước khi bị fix.
Đánh giá của học viên
Bình luận khách hàng