Implement Trie (Prefix Tree) | Microsoft | Leetcode - 208

Показать описание

This is the 2nd Video of our Trie Playlist.
In this video we will try to solve the problem which is the core of TRIE Data Structure
"Implement Trie (Prefix Tree)" (Leetcode - 208).

We will do live coding after explanation and see if we are able to pass all the test cases.

Problem Name : Implement Trie (Prefix Tree)
Company Tags : GOOGLE

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish

codestorywithMIK

Рекомендации по теме

Комментарии

Oh my god the way you just explain is mind blowing. I have watched a lot of vedios, but the I can't explain how u teach it's just a blessing, watched like stiver, love babbar vedio but ur just mind blowing 🙃thx a lot ❤❤

Ramneet

Legend ho bhai tum. Itni clarity kisi channel me nahi dekhi maine aaj tak

FanIQQuiz

I actually was able to code it up myself the moment your explanation ended ❣
I can't thank you enough man.

souravjoshi

Super Easy explanation, I am able to implement TRIE just by watching your video only once. Prior to this, Trie Data Structure was scary to me. But now, it became one of my favorite data structure. Thank you so much for your quality content.❤💯💯💥

OnlyUpscOrBpsc

“Never thought, Trie would be so easy” ✨

zainabnoor

You are one of the finest YouTubers out there.
I still can't believe I am now able to understand complex DS like Graph and Trie.
Thank to you bro

souravjoshi

I was always afraid of this topic and always skipped this topic, but now while preparing for my microsoft interview I am watching your videos and found this very helpul thank you so much .

aswithasai

Khatarnak Explanation😍, You made it so easy and simple

pritishpattnaik

I have my Google interview in 2 weeks and your videos are a blessing to me bro!!!
God bless you and keep doing this!!

proballer

This is perfect, Only thing is we do not need to write I seprately for startWith function we can do it easly without it.

bool startsWith(string prefix) {
TrieNode* ptr = root;
for(char& ch : prefix) {
int idx = ch - 'a';
if(ptr->children[idx] == nullptr) {
return false;
}
ptr = ptr->children[idx];
}
return true;
}

Abhishek-yij

You are a MAGICIAN. No one can teach like you

gui-codes

That's a slap to Trie 😆
Made it a cake walk. Cool way to teach. Thanks

wearevacationuncoverers

Bhaiya jab yeh video upload hua tha tab TRIE se dar sa lagta tha(as it was new to me), par kaafi time baad man ko mana liya aur poori video dekha tab dar chala gya.
Thanks a ton & please add me to your linkedin group.

molyoxide

Thank you mik for such a great explanation - Day 1 of solving problems in Dec

heyOrca

Excellent and Simply Explained .. thanx a Lot❤‍🔥

manish_mnnit

Bhaiya please we need more videos on trie … impact not just trie we want on very topics ❤️❤️❤️❤️ love u

HealthyOm

Can you please share the entire trie playlist

aryangupta

bhaiya please delete wale pe ek video bana do, ye concept aapne bahut easily samjaya hai...🙂👌👌

tarunpatel

dope . you are amazing man. fear of trie is gone

EB-otuu

thanks for sharing this. You made it so easy.

rahulkapoor

Implement Trie (Prefix Tree) | Microsoft | Leetcode - 208

Implement Trie (Prefix Tree) - Leetcode 208

Implement Trie (Prefix Tree) - Leetcode 208 - Trees (Python)

Implement Trie (Prefix Tree) - 208. LeetCode - Java

Implement Trie (Prefix Tree) - LeetCode 202 - Python

The Trie Data Structure (Prefix Tree)

L1. Implement TRIE | INSERT | SEARCH | STARTSWITH

Implement Trie (Prefix Tree) || C++/Java/Python

[Java] Tries (Prefix Tree) | Solve Leetcode - Implement Trie in Code

Implement Trie (Prefix Tree) | LeetCode 208 | Medium

Data Structures: Tries

Leetcode Solution - 208 Implement Trie (Prefix Tree)

Implement Trie (Prefix Tree) | Microsoft | Leetcode - 208

LeetCode 208. Implement Trie (Prefix Tree) - Java

Trie Explained in 3 Minutes

Implement Trie (Prefix Tree) | Day 14 | [May LeetCoding Challenge] [Leetcode 208] [2020]

LEETCODE 208. Implement Trie (Prefix Tree) | C++ Tutorial

Trie Data Structure Implementation (LeetCode)

Implement Trie (Prefix Tree) | LeetCode | Solution Explained in Detail

Implement TRIE | Leetcode #208

implement trie(prefix tree) | implement trie python | implement trie leetcode | may coding day 14

Trie Data Structure | LeetCode 208. Implement Trie (Prefix Tree) - Interview Prep Ep 83

Implement Trie Prefix Tree: 208 - Tree interview @ Google, apple, Amazon, meta, microsoft, bloomberg

Implement Trie (Prefix Tree) - LeetCode

IMPLEMENT TRIE | LEETCODE 208 | PYTHON