Blind 75 Leetcode Java - Algorithms - Solved - Full Course - Part 2

Welcome to the ultimate guide to mastering the acclaimed Blind 75 leetcode technical interview questions. With the tech industry's growing demand for intricate problem-solving abilities, and the popularity of top tech jobs, this comprehensive walkthrough ensures you're armed with the knowledge to excel, as I accidently created world's longest educational video.

Each section is time-stamped so, use it for whatever question you want the answer to. Dive into fundamental topics such as "Two Sum" and scale to advanced segments like "graphs", "trees", "heap" and many more.

For every single problem, I will show which are the companies that have asked that question. After that I will explain problem statement in depth, explain the brute force solution, and from there we will make improvements to our solution, ultimately ending with the optimal solution at hand. Once we get there I will also explain the time and space complexities. Lastly I will show the entire java solution for the problem.

I believe in democratizing education and ensuring everyone has an equal shot at acing their technical interviews. This marathon session is a testament to that belief. I hope this video empowers you to shine in your next interview.

Join me in what I believe is YouTube's longest educational video dedicated to technical interview preparation. Let's master these questions together and make a mark in the tech industry!
These are the questions I covered

Introduction: 00:00:00
Set Matrix Zeroes: 00:00:14
Spiral Matrix: 00:17:40
Rotate Image: 00:37:03
Word Search: 00:52:56
Longest Substring Without Repeating Characters: 01:07:31
Longest Repeating Character Replacement: 01:18:37
Minimum Window Substring: 01:39:38
Valid Anagram: 02:02:26
Group Anagrams: 02:13:34
Valid Parentheses: 02:26:18
Valid Palindrome: 02:37:58
Longest Palindromic Substring: 02:47:07
Palindromic Substrings: 03:03:43
Encode and Decode Strings (Leetcode Premium): 03:17:30
Maximum Depth of Binary Tree: 03:25:49
Same Tree: 03:31:54
Invert/Flip Binary Tree: 03:39:12
Binary Tree Maximum Path Sum: 03:46:25
Binary Tree Level Order Traversal: 04:02:02
Serialize and Deserialize Binary Tree: 04:14:16
Subtree of Another Tree: 04:25:22
Construct Binary Tree from Preorder and Inorder Traversal: 04:33:48
Validate Binary Search Tree: 04:49:43
Kth Smallest Element in a BST: 04:59:55
Lowest Common Ancestor of BST: 05:07:30
Implement Trie (Prefix Tree): 05:18:18
Add and Search Word: 06:03:36
Word Search II: 06:19:34
Top K Frequent Elements: 06:16:42
Find Median from Data Stream: 06:27:25
Bit Manipulation Questions: 07:17:20

In this video I was only able to put 45 to 75 questions.
So for 45 - 75 questions please check out part one of this video.

#leetcode #java #fullcourse #softwareengineering #techjobs #faang #googleinterview #amazoninterview #facebookinterview #codinginterview #sdevelopers #blind75 #crackingthecode #microsoftinterview #leetcode75 #array #binary #dynamicprogramming #graph #intervals #linkedlists #matrix #strings #tree #heap
-------------------------------------------------------------------------------------------------------------------------
(Contact me for Business Inquiries):

GitHub Repository for Questions solved so far:

(Support the channel, if videos helps you in any manner... Give me a Coffee)

Here is a list of some of the awesome companies in the tech world:

FAANG,
Meta,
Facebook,
Google,
Amazon,
Netflix,
Microsoft,
apple,
doordash,
roblox,
stripe,
instacart,
uber,
lyft,
twitter,
linked In,
pinetrest,
bloomberg,
robinhood,
Goldman Sachs,
box,
two sigma,
byte dance,
tik tok,
air bnb,
nuro,
ui path,
oracle,
twitch,
data bricks,
waymo,
dropbox,
coinbase,
snowflake,
snap,
nvdia,
broadcom,
slack,
intel,
cisco,
indeed,
salesforce,
reddit,
wayfair,
okta,
splunk,
service now,
coursera,
square,
upgrade,
mozilla,
yelp,
unity,
ebay,
affirm,
stach adapt,
amplitude,
github,
wish,
brex,
etsy,
chime,
shopify,
amd,
GoDaddy,
IBM

[vasubabujinagam]

Hey I found your tutorial very useful to complete blind75 and I really appreciate your efforts in clearly explaining all the problems with the bruteforce approach and optimal way and its very clear and concise.

One request, can you also do a similar video for Grind 75 as well ? Thanks in advance

[Itsmenly]

Whats the difference between part 1 & part 2? Btw, appreciate your efforts

[zahidanwar]

Hi,
You are awsome! great work. One suggestion for Group Anagrams, you could do following simpler way. And memory wise bit faster too and easy to read :)

public List<List<String>> groupAnagrams(String[] strs) {

if(strs == null || strs.length == 0) {
return new ArrayList<>();
}

Map<String, List> ansMap = new HashMap<>();

for(int i = 0; i< strs.length; i++) {
char[] chars = strs[i].toCharArray();
Arrays.sort(chars);
String key = new String(chars);

if(!ansMap.containsKey(key)){
ansMap.put(key, new ArrayList());

}
ansMap.get(key).add(strs[i]);
}

return new ArrayList(ansMap.values());
}

[vamsikrishna]

Hi, i am a 2022 graduate, currently not working, is it too late to start dsa??