Solving LeetCode's Top Interview Questions in Java [2025]
- Description
- Curriculum
- FAQ
- Reviews
Welcome!
Hello everyone, and welcome to the course that will help you prepare for your coding interviews!
Specifically, we will be breaking down the problems of LeetCode’s Top Interview Questions playlist. This playlist includes problems that are very commonly asked by interviewers from large tech companies such as Apple, Meta, Google, Uber, and many more! We will learn how to approach problems of all kinds, such as those consisting of Arrays, Strings, Linked Lists, Trees, Dynamic Programming, Design, Math, and general knowledge, while also learning useful concepts and tricks which will help when facing more difficult problems.
What is LeetCode?
Simply put, LeetCode is a large repository filled with interview questions asked by the top tech companies around the world (Google, Facebook, Amazon, and many more).
The main problem as a new user on LeetCode is that there are ENDLESS amounts of questions that you can find on there so you may not know which questions are the most common/beneficial to go over. This course’s purpose is to provide a solution to this issue, as I go over the Top Inteview Questions recommended by LeetCode. If you are looking to ace your upcoming coding interview or even just to strengthen your problem solving skills, then look no further as you have found the one-stop-shop to become a problem solving machine.
Course Overview
For each problem in the playlist, I have a video dedicated to explaining the thought process in detail which will lead us to the most efficient solution, paired with a visual to aid in explaining the algorithm. After we understand the approach for the most efficient solution, I will translate the visual into Java code, breaking down every line as I code it. After the entire solution is implemented, we will analyze the time and space complexity of the solution.
-
1LeetCode #26: Remove Duplicates From Sorted ArrayVideo lesson
-
2LeetCode #122: Best Time to Buy and Sell Stock IIVideo lesson
-
3LeetCode #189: Rotate ArrayVideo lesson
-
4LeetCode #217: Contains DuplicateVideo lesson
-
5Understanding Binary RepresentationVideo lesson
-
6LeetCode #136: Single NumberVideo lesson
-
7LeetCode #350: Intersection of Two Arrays IIVideo lesson
-
8LeetCode #66: Plus OneVideo lesson
-
9LeetCode #283: Move ZeroesVideo lesson
-
10LeetCode #1: Two SumVideo lesson
-
11LeetCode #36: Valid SudokuVideo lesson
-
12LeetCode #48: Rotate ImageVideo lesson
-
13LeetCode #344: Reverse StringVideo lesson
-
14LeetCode #7: Reverse IntegerVideo lesson
-
15LeetCode #387: First Unique Character in a StringVideo lesson
-
16LeetCode #242: Valid AnagramVideo lesson
-
17LeetCode #125: Valid PalindromeVideo lesson
-
18LeetCode #8: String to Integer (atoi)Video lesson
-
19LeetCode #28: Find the Index of the First Occurrence in a StringVideo lesson
-
20LeetCode #14: Longest Common PrefixVideo lesson
-
21LeetCode #237: Delete Node in a Linked ListVideo lesson
-
22LeetCode #19: Remove Nth Node From End of ListVideo lesson
-
23LeetCode #206: Reverse Linked ListVideo lesson
-
24LeetCode #21: Merge Two Sorted ListsVideo lesson
-
25LeetCode #234: Palindrome Linked ListVideo lesson
-
26LeetCode #141: Linked List CycleVideo lesson
-
27Depth First SearchVideo lesson
-
28Breadth First SearchVideo lesson
-
29LeetCode #104: Maximum Depth of Binary TreeVideo lesson
-
30LeetCode #98: Validate Binary Search TreeVideo lesson
-
31LeetCode #101: Symmetric TreeVideo lesson
-
32LeetCode #102: Binary Tree Level Order TraversalVideo lesson
-
33LeetCode #108: Convert Sorted Array to Binary Search TreeVideo lesson
-
36Introduction to Dynamic ProgrammingVideo lesson
-
37LeetCode #70: Climbing StairsVideo lesson
-
38LeetCode #121: Best Time to Buy and Sell StockVideo lesson
-
39LeetCode #53: Maximum Subarray (Kadane's Algorithm)Video lesson
-
40LeetCode #198: House RobberVideo lesson
-
41House Robber Optimized Solution (Constant Space Complexity)Text lesson
External Links May Contain Affiliate Links read more