Crack the Leetcode Interview - High Frequency[Must-Do]

Name: Crack the Leetcode Interview - High Frequency[Must-Do]
Rating: 3.9 (10 reviews)

Practice high-frequency Leetcode questions, and prepare interviews for FAANG companies.

Created byCoding No Fear

Last updated 1/2022

English

What you'll learn

Leetcode
Computer Science
Algorithm
Data Structure
Technical Interview
Coding Interview

Course content

1 section • 35 lectures • 6h 6m total length

3Sum13:33
Letter Combinations of a Phone Number11:19
Product Of Array Except Self9:35
Subarray Sum Equals K8:38
Decode String14:25
Maximum Product Subarray6:28
Search In Roatated Sorted Array10:21
Find First And Last Position Of Element In Sorted Array10:19
Explore how to find the first and last positions of a target in a sorted array using binary search, achieving O(log n) time by performing left and right searches.
Next Permutation10:30
Group Anagrams7:59
Learn to group anagrams by sorting each word to form a key, store matching words in a hash map, and return the grouped lists in any order.
Add Binary5:12
Subsets8:33
Validate Binary Search Tree7:41
Maximum Depth Of Binary Tree10:55
Serialize And Deserialize Binary Tree8:41
Counting Bits8:55
Top K Frequent Elements8:54
Intersection of Two Arrays II8:22
Basic Calculator24:50
Nested List Weight Sum II9:18
Learn how to compute the nested list weight sum II by traversing integers and lists with a helper function, using recursion to accumulate level weighted totals.
Merge K Sorted List7:37
House Robber6:50
Solve the LeetCode 198 house robber problem by choosing non consecutive houses to maximize loot, using dynamic programming with a recurrence that adds the current value two steps back.
Count Primes9:38
Maximum Subarray5:44
Decode Ways8:42
Find K Pairs with Smallest Sums10:48
Learn to find the k pairs with smallest sums from two arrays using a priority queue, then optimize memory by capping the heap to k.
Partition Equal Subset Sum13:17
Find All Anagrams in a String15:05
Minimum Path Sum8:20
Alien Dictionary31:23
K Closest Points To Origin10:13
Word Break9:06
Explore the word break problem by determining if a string can be segmented. Use a dynamic programming approach with a boolean table to validate prefixes and substrings against the dictionary.
Climbing Stairs6:58
Jump Game7:31
First Position of Target10:28

Requirements

Basic knowledge of Data Structure
Basic knowledge of one programming language
Java

Description

"2000+ Leetcode questions??"

"That must be super intimidating to prepare for the interview!"

"Do I need to know them all? How long will I get through all of them?"

You are not alone! We are here practicing the same questions but some question is really important and sometimes fun to know. I list some of them here and let's take a look at them together.

This course is for all those people who want to learn the basics of data structure and algorithms from the absolute beginner to the Intermediate level. We will use many examples to make the lectures very easy to understand and digest.

I HIGHEST recommend everyone to take the "100 Leetcode challenge course" from my course list to warm up the muscle memory, which will give it a good foundation for these great Leetcode questions.

After going through these 35 Leetcode questions, you will get your foot wet and start trying some "Medium" and "HARD" questions soon. The purpose of this course is to learn to understand some interview coding standards and get familiar with the real interview setup.

If you have any questions, please feel free to comment below. I will get back to you as soon as possible. I hope you have a wonderful learning experience here!

Who this course is for:

Who is interested in crashing the technical interview
Who is interested in learning the algorithm
Who is interested in learning data structure