Solving LeetCode's Top Interview Questions in Java [2024]

Solving LeetCode's Top Interview Questions in Java [2024], available at $69.99, has an average rating of 4.4, with 65 lectures, 1 quizzes, based on 260 reviews, and has 45099 subscribers.

You will learn about Familiarity working with Arrays, Strings, Trees, Linked Lists and many other data structures Exposure to the most common questions asked in interviews Be able to critically analyze a problem and work towards an efficient solution Learn numerous tricks which can be applied to the future questions you encounter Gain the confidence and skills to ace your coding interviews Consider time and space complexity when designing algorithms This course is ideal for individuals who are Developers looking to solidify their problem solving skills and ace their coding interviews It is particularly useful for Developers looking to solidify their problem solving skills and ace their coding interviews.

Enroll now: Solving LeetCode's Top Interview Questions in Java [2024]

Summary

Title: Solving LeetCode's Top Interview Questions in Java [2024]

Price: $69.99

Average Rating: 4.4

Number of Lectures: 65

Number of Quizzes: 1

Number of Published Lectures: 65

Number of Published Quizzes: 1

Number of Curriculum Items: 66

Number of Published Curriculum Objects: 66

Original Price: CA$32.99

Quality Status: approved

Status: Live

What You Will Learn

Familiarity working with Arrays, Strings, Trees, Linked Lists and many other data structures
Exposure to the most common questions asked in interviews
Be able to critically analyze a problem and work towards an efficient solution
Learn numerous tricks which can be applied to the future questions you encounter
Gain the confidence and skills to ace your coding interviews
Consider time and space complexity when designing algorithms

Who Should Attend

Developers looking to solidify their problem solving skills and ace their coding interviews

Target Audiences

Developers looking to solidify their problem solving skills and ace their coding interviews

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 questionsasked by the top tech companiesaround 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.

Course Curriculum

Chapter 1: Arrays

Lecture 1: (Easy) LeetCode 26: Remove Duplicates From Sorted Array

Lecture 2: (Medium) LeetCode 122: Best Time To Buy and Sell Stock II

Lecture 3: (Medium) LeetCode 189: Rotate Array

Lecture 4: (Easy) LeetCode 217: Contains Duplicate

Lecture 5: Understanding Binary Representation

Lecture 6: (Easy) LeetCode 136: Single Number

Lecture 7: (Easy) LeetCode 350: Intersection of Two Arrays II

Lecture 8: (Easy) LeetCode 66: Plus One

Lecture 9: (Easy) LeetCode 283: Move Zeroes

Lecture 10: (Easy) LeetCode 1: Two Sum

Lecture 11: (Medium) LeetCode 36. Valid Sudoku

Lecture 12: (Medium) LeetCode 48: Rotate Image

Lecture 13: (Medium) LeetCode 15: 3Sum

Lecture 14: (Medium) LeetCode 73: Set Matrix Zeroes

Lecture 15: (Medium) LeetCode 49: Group Anagrams

Chapter 2: Strings

Lecture 1: (Easy) LeetCode 344: Reverse String

Lecture 2: (Medium) LeetCode 7: Reverse Integer

Lecture 3: (Easy) LeetCode 387: First Unique Character in a String

Lecture 4: (Easy) LeetCode 242: Valid Anagram

Lecture 5: (Easy) LeetCode 125: Valid Palindrome

Lecture 6: (Medium) LeetCode 8: String to Integer (atoi)

Lecture 7: (Easy) LeetCode 28: Find the Index of the First Occurrence in a String

Lecture 8: (Easy) LeetCode 14: Longest Common Prefix

Chapter 3: Linked Lists

Lecture 1: (Medium) LeetCode 237: Delete Node in a Linked List

Lecture 2: (Medium) LeetCode 19: Remove Nth Node From End of List

Lecture 3: (Easy) LeetCode 206: Reverse Linked List

Lecture 4: (Easy) LeetCode 21: Merge Two Sorted Lists

Lecture 5: (Easy) LeetCode 234: Palindrome Linked List

Lecture 6: (Easy) LeetCode 141: Linked List Cycle

Chapter 4: Trees

Lecture 1: Depth First Search

Lecture 2: Breadth First Search

Lecture 3: (Easy) LeetCode 104: Maximum Depth of Binary Tree

Lecture 4: (Medium) LeetCode 98: Validate Binary Search Tree

Lecture 5: (Easy) LeetCode 101: Symmetric Tree

Lecture 6: (Medium) LeetCode 102: Binary Tree Level Order Traversal

Lecture 7: (Easy) LeetCode 108: Convert Sorted Array to Binary Search Tree

Chapter 5: Sorting and Searching

Lecture 1: (Easy) LeetCode 88: Merge Sorted Array

Lecture 2: (Easy) LeetCode 278: First Bad Version (Binary Search)

Chapter 6: Dynamic Programming

Lecture 1: Introduction to Dynamic Programming

Lecture 2: (Easy) LeetCode 70: Climbing Stairs

Lecture 3: (Easy) LeetCode 121: Best Time to Buy and Sell Stock

Lecture 4: (Medium) LeetCode 53: Maximum Subarray (Kadane's Algorithm)

Lecture 5: (Medium) LeetCode 198: House Robber

Lecture 6: House Robber Optimized Solution (Constant Space Complexity)

Chapter 7: Design (Object Implementation)

Lecture 1: (Medium) LeetCode 384: Shuffle an Array

Lecture 2: (Medium) LeetCode 155: Min Stack

Chapter 8: Math

Lecture 1: (Easy) LeetCode 412: Fizz Buzz

Lecture 2: (Medium) LeetCode 204: Count Primes

Lecture 3: Count Primes Time Complexity Proof

Lecture 4: (Easy) LeetCode 326: Power of Three

Lecture 5: (Easy) LeetCode 13: Roman to Integer

Chapter 9: Others

Lecture 1: (Easy) LeetCode 191: Number of 1 Bits

Lecture 2: (Easy) LeetCode 461: Hamming Distance

Lecture 3: (Easy) LeetCode 190: Reverse Bits

Lecture 4: (Easy) LeetCode 118: Pascal's Triangle

Lecture 5: (Easy) LeetCode 20: Valid Parentheses

Lecture 6: (Easy) LeetCode 268: Missing Number

Chapter 10: Graphs

Lecture 1: Introduction

Lecture 2: Representations of Graphs

Lecture 3: Depth First Search

Lecture 4: Breadth First Search

Lecture 5: (Easy) LeetCode 1971: Find if Path Exists in Graph

Lecture 6: (Medium) LeetCode 841: Keys and Rooms

Lecture 7: (Medium) LeetCode 207: Course Schedule

Chapter 11: Extra

Lecture 1: (Medium) LeetCode 300: Longest Increasing Subsequence

Instructors

Mathew Younan
Computer Science Tutor

Rating Distribution

1 stars: 3 votes
2 stars: 3 votes
3 stars: 19 votes
4 stars: 92 votes
5 stars: 143 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!

Menu