วีดีโอ

Thanks Sir for providing really nice explanation.

dp ki series kab aa rhi?

how the answer can be n(length of citations) ,please reply me sir(bhaiya)

Thaks gurujii

why you are not use hashMap and priorityQueue.

Do more video like this

Great explanation

this is bruteforce approach & will inc TC. Make video with 2 pointers

nice bro

Nhi smjh aaya

Why should we need to use StringBuilder class ?

Nice it's help me your explaination is simple

good work brother😍

Test cases are evil 0 is also a multiple of k. So we also need to take care of continuous 0.

class Solution { public int lengthOfLastWord(String s) { String[] word = s.split(" "); int length = word.length; String LastWord = word[length-1]; int lenLW = LastWord.length(); return lenLW; } } Its easier this way..

How do you have such clear concept of java

when I am speaking they can hear me but they are not audiable and our microphone is not muted

SIR YOUR LINKEDIN ID?

Dhanyawad bhai hindi k liye..

code does not have the main function?

Video off kese karen agar sorf audio karni hai ???

yr bhai dry run kraye kro boht fast krao yr

Without using Set class Solution { public boolean wordPattern(String pattern, String s) { HashMap<Character, String> map = new HashMap<>(); String[] words = s.split(" "); if (pattern.length() != words.length) { return false; } for (int i = 0; i < pattern.length(); i++) { char c = pattern.charAt(i); if (map.containsKey(c)) { if (!map.get(c).equals(words[i])) { return false; } } else { if (map.containsValue(words[i])) { return false; } map.put(c, words[i]); } } return true; } }

Great explanation for java language

Good explanation but time limit exceeded bro😢

looking at this you made my solution shame 😭, in my case i first written a code to find a peak using BS then, checked if the left of the peak from for(i=0 to i=peak) elemens would be in INCREASING order then, same for the other side of the peak.

Best explanation

thanks for the help.

Thank you sir ...nice explanation👌👌👌

Make video on rotate list question leetcode

bhai rotate array by kth position problem chahiye please upload karo

can you/anyone explain why u did idx>= n1??