Відео

Please complete this leetcode 150 series

not an optimized code ... 16ms runtime

int arr[]= {2,3,4,5,6,7}; this case it will fail above programme works only if array number starts with 1 for one missing number

plz start again this series

Very clear explanation with Exceptional case. Thanks!

thank you

Logic is not correct this js string reverse program not word...please change the title

For those who have doubt about all negative elements: eg. [-2, -3, -1]: max=-2 (as initialised at beginning) sum = 0 + (-2) = -2 (negative so reset to sum=0) | also sum= -2 is not greater than max= -2 . So don't update max. sum = 0 + (-3) = -3 (negative so reset to sum=0) | also sum= -3 is not greater than max= -2 . So don't update max. sum = 0 + (-1) = -1 Here, sum = -1 which is greater than max= -2. So update max = -1 So we get "max = -1" at the end of interaction which is true. Try yourself with longer arrays.

calm and nice explanation

You got one more student. Perfectly Explained..

Super

​ @Onesided.x isko check karo then, is it working? Leet code accept nahi kar raha , q ki is logic se dekhe to original array = ["dog","racecar","car"] sorting ke baad = [car, dog, racecar], to comparison first string aur last string main hua to answer car aayega as common prefix , but car dog main to nahi hai , fir? isliye leetcode main submit nahi ho raha .

Very clear intuition..loved it...Thank u soo much 🫶

you should take the length of needle no???

if you could add the sheet in description it would better

so the interpreted language is better than the compiled one i'm using?

Nice teaching I ever seen on youtube ...please make more video on DSA array string linked list

No need to use the variable count. Return i-1 when i==' '.

please upload more videos

brute force koi share kar do

In the time of 3:47.. how we can get 121/10= 12 ??? It should be 12.1 ??

👩🏻‍🏫 Exceptionally well explained in a clear and simple manner that anyone can understand and apply! 👍 Keep up the great work!

It was a great to understand from you mam

Thank you mam, wonderful explanation

Super pa good explanation ❤

Input :the sky is blue Out put: eht yks si eulb Can you pls make video on reverse words in string

Input :the sky is blue Out put: eht yks si eulb Can you pls make video on reverse words in string

Why you started arranging elements from last is it because of zeros.?

Mam. how can we get the sub array with max sum

A suggestion for u do dry run after writing code

Thanks

anybody explain me why we do not use in overflow condition {reverse> (interger.max_value - digit)/10} ?

public int removeDuplicates(int[] nums) { int count = 0; for(int i=0; i< nums.length-1; i++){ if(nums[i]!=nums[i+1]){ nums[count] = nums[i]; count++; } } nums[count] = nums[nums.length-1]; count++; return count; }

worst explanation

Make a playlist for Array also

Please continue this series

if (n <= 0) { return false; } // Divide by 2, 3, and 5 while (n % 2 == 0) { n /= 2; } while (n % 3 == 0) { n /= 3; } while (n % 5 == 0) { n /= 5; } // After removing check if n becomes 1 return n == 1; } } this is right code we don't need to run a while loop we simply remove 2,3,5 and then check n==1 or not ...in your code they cant pass test case

Kuchh jada hu inbuilt function ise kr rhi hain

กััััััััััััััััััััััััััััััััััััััััััััััััััััััััััััััััััััััั

really its a nice explanation

Thank you. This is the only video that helped

Which part of the code adds the last element into the array?

good explaination, but you are missing time and space complexity in this explaination.

Great explanation, very intuitive!

What if the value is enclosed in double quotes but the values inside it also had a double quotes. What to do

class Solution { public int removeElement(int[] nums, int val) { int n = nums.length; int count = 0; for(int i=0;i<n;i++) { if(nums[i]!=val) { nums[count]=nums[i]; count++; } } return count; } } thanks mam

Easy to understand TC O(N) class solution{ String reversevovl(String s){ Set<Character> set = new HashSet<Character>(); set.add('a'); set.add('e'); set.add('i'); set.add('o'); set.add('u'); set.add('A'); set.add('E'); set.add('I'); set.add('O'); set.add('U'); char arr[] = s.toCharArray(); int i =0; int j= arr.length-1; while(i < j) { if(set.contains(arr[i]) && set.contains(arr[j])) { char temp = arr[j]; arr[j] = arr[i]; arr[i] = temp; i++; j--; }else if(set.contains(arr[i])) { j--; }else if(set.contains(arr[j])) { i++; }else{ i++; j--; } } return new String(arr); } }

❤❤

static int steps(int n) { int a = 1, b = 0; for (int i = 0; i < n; i++) { a = a + b; b = a - b; } return a; }

Worst explanation, saans to lele