Teach on Udemy

Turn what you know into an opportunity and reach millions around the world.

Learn More

Your cart is empty.

Keep shopping

50 days of LEETCODE in Java: Algorithms Coding Interview

Name: 50 days of LEETCODE in Java: Algorithms Coding Interview
Rating: 4.7 (8 reviews)

Practice data structure and algorithms questions for interviews at FAANG companies like Google, Facebook, Apple & Amazon

Created byInterview Temple

Last updated 11/2024

English

What you'll learn

Solve Easy to Hard Difficulty problems using different data structures and algorithms
How to solve some of the most popular interview questions asked by major tech companies
Breaking down the coding interview problems in a step by step, systematic manner
Popular problems patterns
Algorithms and data structures
Strengthen your problem solving and programming skills

Course content

48 sections • 217 lectures • 22h 35m total length

Introduction to the problem10:42
Brute Force solution Intuition6:15
pseudocode walkthrough7:36
Better Approach intuition10:34
Approach 2 Pseudocode walkthrough8:56
Walk through the pseudocode to implement a two-pointer solution that uses the min height of the left and right pointers to compute the max container area.
Implementing the code2:44

Introduction to the problem4:08
Brute Force Intuition13:11
Pseudocode walkthrough16:23
Explore a pseudocode walkthrough of finding the longest substring without repeating characters, starting from brute force to a sliding window solution using a seen characters map.
Approach 2 Intuition12:56
Explore the sliding window approach to the longest substring without repeating characters by using two pointers and a last seen map to update the window and maximize length.
Approach 2 pseudocode walkthrough5:44
Implementing the code4:46

Introduction to the problem and brute force approach6:13
Brute force Pseudocode walkthrough4:43
Approach 2: Optimal Approach intuition11:27
Pseudocode walkthrough part 17:18
Demonstrate a binary search using two pointers and mid to locate the first and last occurrences of a target in a sorted array.
Pseudocode walkthrough part 26:58
Implementing the code7:30
Develop functions to find first and last positions of a target in a sorted array using binary search, returning the two positions as an array or -1 if not present.

Introduction To The Problem And Brute Force Approach9:02
Optimal Solution Intuition6:20
Master the optimal solution for finding the first bad version by applying binary search. Use isBadVersion, halve the search range, and return the first bad version efficiently.
Optimal solution pseudocode walkthrough2:58
Apply a binary search using two pointers to locate the first bad version with a given isBadVersion API, halving the search range and achieving O(log n) time and O(1) space.
Implementing the code4:33

Introduction to the problem4:19
Approach 1: Brute Force Approach4:14
Approach 2: A Better Approach Explanation5:40
PseudoCode Walkthrough For Approach 23:18
Implementing the code0:24
Approach 3: Optimal Approach7:13
Implementing the optimal approach1:29
Implement the missing number function by tallying the input numbers, computing the total with Gauss's formula n(n+1)/2, and returning the difference as the missing number.

Requirements

Basic Knowledge of fundamental data structures and algorithms is preferred
Basic Knowledge of Java is preferred
If you want to submit the code yourself, you should be familiar with leetcode and have an account

Description

Getting ready for your software engineering coding interview? This is the place for you.
Want to learn about the most popular problem-solving techniques, patterns, data structures, and algorithms used in those difficult interviews? Come on in
Want a step by step explanation of the most popular interview questions in the industry? You got it.
Want to get better at competitive programming? Enjoy the ride

Welcome to the course!

In this course, you'll have a detailed, step by step explanation hand-picked LeetCode questions where you'll learn about the most popular techniques and problems used in the coding interview, This is the course I wish I had when I was doing my interviews. and it comes with a 30-day money-back guarantee

What is LeetCode?

LeetCode is essentially a huge repository of real interview questions asked by the most popular tech companies ( Google, Amazon, Facebook, Microsoft, and more ).

The problem with LeetCode is also its advantage, IT'S HUGE, so huge in fact that interviewers from the most popular companies often directly ask questions they find on LeetCode, So it's hard to navigate through the huge amount of problems to find those that really matter, this is what this course is for.

I spent countless hours on LeetCode and I'm telling you that you don't have to do the same and still be able to get a job at a major tech company.

Course overview :

In this course, I compiled the most important and the most popular interview questions asked by these major companies and I explain them, in a true STEP BY STEP fashion to help you understand exactly how to solve these types of questions.

The problems are handpicked to ensure complete coverage of the most popular techniques, data structures, and algorithms used in interviews so you can generalize the patterns you learn here on other problems.

Each problem gets multiple videos :

Explanation and intuition video(s): we do a detailed explanation of the problems and its solution, this video will be longer because we will do a step by step explanation for the problems.
Coding video(s): where we code the solution discussed in the explanation video together.
Walkthrough video(s): where we go over each line of code and see what it does

We will use basic Java for this course to code our solutions, previous knowledge in Java is preferred but NOT required for the coding part of the course.

The problems are categorised for easier navigation and will be regularly updated with more popular and interesting problems.

Some of the stuff this course will cover are :

Arrays and Strings interview questions.
Searching interview questions and algorithms.
Dynamic Programming interview questions.
Backtracking interview questions ( With call stack visualisation ).
Trees and Graphs interview questions and algorithms.
Data structures Like Stacks, Queues, Maps, Linked Lists, and more.

In other words, this course is your one-stop-shop for your dream job.

Who this course is for:

Developers eager to pass the coding interview at huge companies like Google, Facebook, Microsoft, Amazon, etc.
People who want to develop their problem solving skills.
Developers getting ready for their technical interviews.
Students getting ready for their internship coding interviews.
People who want to get better at competitive coding

50 days of LEETCODE in Java: Algorithms Coding Interview

What you'll learn

Explore related topics

Course content

Microsoft Array Question: Container with most water (Medium)6 lectures • 47min

Google Array Question: Valid mountain array (Easy)4 lectures • 19min

Google Array Question: Boats to save people (Medium)4 lectures • 26min

Facebook Array Question: Move Zeroes (Easy)5 lectures • 24min

Amazon Array Question: Longest substring without repeating characters (Medium)6 lectures • 57min

Arrays Question:Find first and last position of element in sorted Array (Medium)6 lectures • 44min

Google Array question: first bad version (Easy)4 lectures • 23min

Microsoft Math Question: Missing Number (Easy-ish)7 lectures • 27min

Amazon Math Question: Count Primes5 lectures • 32min

Airbnb Math Question: Single Number6 lectures • 31min

Requirements

Description

Who this course is for: