Відео

when will the cycle detection in graph vdos be released?

osm explain

first again🤩🤩🤩

Like target for this video is 120, please do like. Aaj ka question ban gaya hoga na? koi aur approach use kri hai toh share kro!! 😄

In worst case ..why it does not give TLE because 2<=n<=1e4 and 0<=edges_length <=2*1e4??

what is that 'V" that you used to define the variable prob of type double, moreover it is not pre-defined please check

bhaiya itna sab kara rahe to DP ka bhi thoda sochiye na please

amazing approach. so simple and easy to understand. I used the same approach in the first try but then tried to solve it using dijkstra when i saw the hints in the question. Anyways, Kuddos

Using HashMap sol : -> ✅LeetCode:- class Solution { public String replaceWords(List<String> dictionary, String sentence) { HashSet<String> set = new HashSet<>(); for(String s : dictionary){ set.add(s); } String[]wordsArr = sentence.split(" "); StringBuilder sb = new StringBuilder(); for(String currWord : wordsArr){ String replaceWord = currWord; for(int i = 0;i<currWord.length();i++){ String prefix = currWord.substring(0, i+1); if(set.contains(prefix)){ replaceWord = prefix; break; } } sb.append(replaceWord).append(" "); } return sb.toString().trim(); } }

Can we have a separate detailed video for Bellman ford? This video feels rushed

you make us understand every problem very easily...

like target for this video is 100, please do like if you have understood😃

Amazing content

Great , love from jadavpur uni

Sir iska Notes nhi h ?

please add c++ too.

Sir we want iteratively method by stack and deque . Plzzz

Sir when are you releasing DP Series. Eagarly waiting ! Can we expect it around mid of September

Sir your graph series is amazing one of the best creator but if you upload videos like a day in life of samsung developer then reach zyada rate se increase hogi I don't know right or wrong but this is my opinion

easiest explaination thank you so much sirr

Happy Janmashtami😄

Can you have playlist of array coding of leetcode from beginners to pro ? Plz let me know

Like target is 100, Please do like if you have understood the explanation!

how space complexity is n-k ,could you please explain in detail ?

ok bhaiya watching iterative method also :")

c++ class Solution { public: //week 13 void postorderTraversalHelper(TreeNode* root, vector<int>& ans) { if(root == NULL) return; else { //L postorderTraversalHelper(root->left, ans); //R postorderTraversalHelper(root->right, ans); //N ans.push_back(root->val); } } vector<int> postorderTraversal(TreeNode* root) { //postorderTraversal -> LRN //we will solve this using recurssion vector<int> ans; //we will use a helper function postorderTraversalHelper(root, ans); return ans; } };

2 Homework In Java, a String is both a data type and a class. String as a Class: It belongs to java.lang.String and provides various methods to manipulate text. String as a Data Type: It represents a sequence of characters and is a reference data type in Java.

Day 2 Lecture 4 Complated✅

Bhaiya mein morris traversal se kiya

ban gaya tha aaj, special thanks to your EPIC Tree Series😍

Please do like this video, Like target for this video is 120. Please do watch iterative approach as well!

awesome explanation bhaiya

awesome thanks

Great Explanation!

I try this question by mySelf pass : 37/217 then for which testcase it's failed i fixed that but the code gives me TLE. Please somebody help me to fixed my code. #Code_is_given_below--> ```class Solution { public String nearestPalindromic(String n) { int mindif = Integer.MAX_VALUE; int num = Integer.parseInt(n); if(num == 1){return "0";} if(num >= 2 && num <= 10){ return Integer.toString(num - 1) ; } int ans = 0; //this is for the nearest palindrom bellow given "n" ex - > 123 for (int i = 1; i < num; i++) { if (isPalindrom(i)) { int currDif = num - i; if (currDif < mindif) { mindif = currDif; ans = i; } // break; } } //for this type of test case give error - > "1213" output ->"1221" for(int i = num+1; ;i++){ if(isPalindrom(i)){ int currDif = i - num; if(currDif < mindif){ ans = i; // get the first palindrome given number and stop there. } break; } } return Integer.toString(ans); } public boolean isPalindrom(int n){ int org = n; int rev = 0; while(n>0){ int lastdig = n%10; rev = (rev*10) + lastdig; n = n/10; } return (org != rev) ? false : true; } }```

New to DSA concept your video is very helpful bhaiya❤

❤❤❤

Bhaiya mere dimag mein pehele aaya tha, ki given string ko number mein convert koro, uske band do variable create Kara, ek given num - 1 and dusre given num + 1, and create a function to check palindrome, and call for both numbers, if both are palindrome then return minimum else return that number which is palindrome among both I know that it is ghatia approach, can anyone thought about this also? Please say

Bahot hi hard tha per ye video dekh ke samj me aa gaya .

thankyou sir ,but please come up with examples that are not there in editorial... like 2002,11011....etc this will help us more .

thanks G

Animal is a class and cat ,dog , lion is an Object 🙂

Subha 8 baje Baitha tha ye qs solve karne ke liye abhi solve hua khudse Almost 12 hr 😂 😂😢

NICE SUPER EXCELLENT MOTIVATED

shashwat Bhaia tum Aage badho Hum tumare sath Hai.....

public String nearestPalindromic(String n){ long num=Long.valueOf(n); long small=smallest(String.valueOf(num-1)); long large=largest(String.valueOf(num+1)); if(large-num<num-small) return String.valueOf(large); else return String.valueOf(small); } private long largest(String n){ char[]c=n.toCharArray (); int s=0,e=c.length-1; while(s<e){ while(c[s]!=c[e]){ incrementNum(c,end); } s++;e--; } return Long.parseLong(String.valueOf(c)); } private long smallest(String n){ char[]c=n.toCharArray(); int s=0,e=c.length-1; while(s<e){ while(c[s]!=c[e]){ decrementNum(c,end); if(c[0]=='0') return Long.parseLong(String.valueOf(c)); } s++;e--; } return Long.parseLong(String.valueOf(c)); } private void decrementNum(char[]c,int i){ while(c[i]=='0'){ c[i]='9'; i--; } c[i]--; } private void incrementNum(char[]c,int i){ while(c[i]=='9'){ c[i]='0'; i--; } c[i]++; } } 🎉❤

mene jab logic lagaya to run bhi hogya lekin test cases failed, par jab ye video dekha tab laga ye isliye HARD TAG tha😅😝

TQ sir aapne bhut ache se samjhaya ❤

tagra question tha bhaiya, maza aa gya 😍😍

little correction, we are using an arraylist of size 5, so although space is as good as constant but still you can mention it.