Counting Words With a Given Prefix | Brute Force | Trie | Leetcode 2185 | codestorywithMIK

[@AbhijeetMuneshwar]

Respected MIK Sir, 🙏🏼 Tomorrow's motivational quote from my side: "True success isn't about momentary bursts of brilliance, but about consistent, disciplined action. It's about showing up day after day, making smart choices, and relentlessly pursuing your vision."

[@aizad786iqbal]

thanks for taking the feedback, if possible, for easy problems especially involving these complex topics like trie etc code in Java, makes it easier to remember the code also, became a member today 💚

[@codestorywithMIK]

Thanks for the feedback 🙏😇❤️ Also, i wanted to mention that the membership feature was given by KZbin after crossing some threshold subscribers count. I usually don’t want any paid service, so the amount for membership should be default value given by KZbin. There is no difference in the contents that I provide in membership and non-membership. So if you wish, you can definitely opt-out of the membership . Hope you understand 😇❤️🙏

[@aizad786iqbal]

​@@codestorywithMIK absolutely, I just hope it helps the reach of your channel since the content is awesome, It'll help a lot in achieving their goals... And get better at DSA 😊

[@codestorywithMIK]

@aizad786iqbal appreciate your support Aizad. Means a lot 🙏❤️😇

[@ankitatiwary4663]

Thanks for explaining in Java sir

[@italk-gj5kk]

thanks a lot for bringing java code

[@gui-codes]

I was able to solve using trie MIK. Thanks to you 🤩

[@Mr-raj377]

Thanks for explaining in JAVA 🥺❤️

[@arjunprasad1071]

I watched your video of yesterday's problem ; thanks to that, I was able to solve using Trie without looking at the solution. Thanks!!

[@m_fi8926]

thanks for the java code

[@Coder_Buzz07]

Thank u for the explanation bhaiya❤❤

[@indianengineer5802]

thanks for java code

[@Vibhanshushrivastava]

i think leetcode get obsessed with prefix and suffix , 😂😂

[@sahebraojadhav9727]

Thank u mik

[@sakyasekhar4219]

Trie approach is optimal if pref is array of queries

[@anonymous-qy1vw]

let's fight

[@gui-codes]

yeah bro, let's do it 🔥

[@komalrani3894]

Thanku bhaiya for solve in java please try to solve also in java

[@sauravchandra10]

Yaay! Solved it using Trie. Python implementation: class TrieNode: def __init__(self): self.child = [None]*26 self.endWord = False class Trie: def __init__(self): self.root = TrieNode() def insert(self, word): cur = self.root for c in word: ind = ord(c)-ord('a') if not cur.child[ind]: cur.child[ind] = TrieNode() cur = cur.child[ind] cur.endWord = True def searchPrefix(self, prefix): cur = self.root for c in prefix: ind = ord(c)-ord('a') if not cur.child[ind]: return False cur = cur.child[ind] return True class Solution: def prefixCount(self, words: List[str], pref: str) -> int: cnt = 0 for word in words: if len(word) < len(pref): continue trie = Trie() trie.insert(word) if trie.searchPrefix(pref): cnt += 1 return cnt

[@dayashankarlakhotia4943]

One liner Solution public int prefixCount(String []words,String pref){ return (int)Arrays.stream(words).filter(s->s.startsWith(pref)).count(); }🎉❤

[@darakhshannaheed2563]

Bhaiya thanks for your solution... gfg 160 bhi chal rhi h please uske problems bhi solve krdete to acha hota... please

[@rode_atharva]

ab trie ka

[@AnthonyEvans-y4e]

Thanks for the forecast! I need some advice: I have a SafePal wallet with USDT, and I have the seed phrase. (mistake turkey blossom warfare blade until bachelor fall squeeze today flee guitar). How can I transfer them to Binance?

[@kartikgandhi7447]

hi mik, just wanted to ask that can't we just create a single Trie class instead of a struct and a global function getNode and then another class Trie, confused me a bit. Brilliant explanation though!

[@gayatrichaudhary580]

java 💚💚

[@vikasvoruganti7490]

Also we can solve this using kmp

[@zaffarzeshan1308]

KMP(JAVA) class Solution { public int prefixCount(String[] words, String pref) { int n=words.length; int cnt=0; for(int i=0;i

[@gauravparasar4571]

Bhiya 😭 mene amazon ka oa diya thaa or 2no question ke saare test case pass hogaye the fir b select nahi hua 😢

[@codestorywithMIK]

Strange. Did they share you the final score ?? Because many times the remaining test cases are evaluated later. There might be large test cases or cases with corner cases.

[@gauravparasar4571]

@@codestorywithMIK no they didnt share anything even they said While we are not able to provide additional feedback or information about this decision

[@codestorywithMIK]

That’s bad and wierd. I am assuming that there might be a lot of candidates and selection might have been done by considering many other factors. Or, some hidden test cases might have faced issues (error, tle etc)

[@gauravparasar4571]

@@codestorywithMIK i don't know but this is my last hope to do something big even i told my parent with full excitement but in the end 🥹🥹 ab kya hoga aage mann nahi krta ab padhne ka br br rejections

[@jayanaaryan3498]

bhiaya ek doubt apne bola hum root se puchte hai ye jaise 'a' present hai ya nhi if yes to aage jao uske pucho tumhare pass 't' hai ya nhi par apke code ke according hum bas node bante hai usme character assign nhi karte esse kyu?