Пікірлер

• 
  @crichub1296Күн бұрын

  Its working for all cases 👍

• 
  @faizuddin40322 күн бұрын

  Great explanation, but it would be great if you use dark theme on leetcode

• 
  @m7md_abz1463 күн бұрын

  3 is not minrightnums2 , 9 is

• 
  @rajdeeppatil36234 күн бұрын

  such a sweet and simple solution, thank q mam.

• 
  @DevbrathBhattPujari5 күн бұрын

  Can you please explain more at timestamp 4:45 that why did you just took the string till index 7?

• 
  @DevbrathBhattPujari5 күн бұрын

  Can you please explain more at timestamp 4:45 that why did you not take the whole length and just till index 7?

• 
  @thAsciNileshPal5 күн бұрын

  keep it up didiiiii ; U and SashCode channel doing great job ; i request u too pls come up with the series of daily leetcode potd solutionss

• 
  @nigarsultana17396 күн бұрын

  Thanks a lot mam!!!

• 
  @bhargavchandhu51007 күн бұрын

  it is best and simple than above class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { for (int j = 0, i = m; j < n; j++) { nums1[i] = nums2[j]; i++; } Arrays.sort(nums1); } }

• 
  @user-jj9rk4en9i8 күн бұрын

  great explanation simple approach for those in new in dsa

• 
  @KapilSharma-qh4zi8 күн бұрын

  But it is not working on [5,1,3] array

• 
  @duylong36849 күн бұрын

  class Solution { public int lengthOfLongestSubstring(String label) { int end = 0; int maxLength = 0; List<Character> list = new ArrayList<>(); while (end < label.length()) { boolean isContained = list.contains(label.charAt(end)); if (!isContained) { list.add(label.charAt(end)); end++; maxLength = Math.max(maxLength, list.size()); } else { list.removeFirst(); } } return maxLength; } } i think the start variable unnecessary

• 
  @saratdas888610 күн бұрын

  the indentation and the brackets opening and closing are not taken care of , and also this code is partially complete , this doesn't pass all test cases

• 
  @adityarajsah41411 күн бұрын

  Guys whoever is getting wrong ans, just check my solution it is accepted by leetcode: class Solution { public int[] searchRange(int[] nums, int target) { int[] result = new int[2]; result[0] = findFirstPosition(nums, target); result[1] = findLastPosition(nums, target); return result; } private int findFirstPosition(int[] nums, int target) { int left = 0; int right = nums.length - 1; int firstPosition = -1; while (left <= right) { int mid = left + (right - left) / 2; if (nums[mid] == target) { firstPosition = mid; right = mid - 1; // keep searching to the left } else if (nums[mid] < target) { left = mid + 1; } else { right = mid - 1; } } return firstPosition; } private int findLastPosition(int[] nums, int target) { int left = 0; int right = nums.length - 1; int lastPosition = -1; while (left <= right) { int mid = left + (right - left) / 2; if (nums[mid] == target) { lastPosition = mid; left = mid + 1; // keep searching to the right } else if (nums[mid] < target) { left = mid + 1; } else { right = mid - 1; } } return lastPosition; } }

• 
  @AmitBiswas014213 күн бұрын

  public int[] searchRange(int[] nums, int target) { int[] arr = new int[2]; arr[0] = arr[1] = -1; for (int i = 0; i < nums.length; i++) { if (nums[i] == target) { arr[0] = i; break; } } if (arr[0] != -1) { for (int i = arr[0]; i < nums.length; i++) { if (nums[i] == target) { arr[1] = i; } else { break; } } } return arr; } For anyone facing issue try this solution

• 
  @adityarajsah41414 күн бұрын

  Please do continue with the series, In entire you tube this is the only channel where I am able to understand the solution and co-relate with my approach. I understand because of medical condition you took a break, but please try uploading the videos as soon as possible please Amrita it's my humble request. And if you are not well, Get well soon and then upload the videos.

• 
  @TechnosageLearning11 күн бұрын

  Thank you for your message. We will be starting up with the videos soon.

• 
  @mayukh_16 күн бұрын

  Essentially this not in constant space. Because in the for loop, you are creating another copy for the array.

• 
  @SumitChouhan-ss5tt16 күн бұрын

  I just have a silly questions?? How much time the loop run ???

• 
  @ashishnannaware734916 күн бұрын

  what if array=["Thik","kuchh nhi","Thik h"] as per your code output is => Thik but output will be "" (blank)

• 
  @tanyamodi923314 күн бұрын

  first sort the array, once it is sorted it will give correct output

• 
  @GulshanKumar-rm2fz18 күн бұрын

  maam what if there is two missing number then this code will be failed

• 
  @mayanksinghal140018 күн бұрын

  Hello.. Thankyou for this video. Can you explain please why can't we use overflow condition like if (rev*10 > Integer.MAX_VALUE || rev*10 < Integer.MIN_VALUE)

• 
  @anshulsen335719 күн бұрын

  regex kese kaam kr rha h maam @Technosage

• 
  @samorouji284221 күн бұрын

  legend

• 
  @start1learn-n17121 күн бұрын

  Tq😊

• 
  @Naveenkumar-p4i21 күн бұрын

  here's a single word 0ms code for it class Solution { public int strStr(String haystack, String needle) { return haystack.indexOf(needle); } }

• 
  @Riteshpc-c3x21 күн бұрын

  thanks

• 
  @sauryakumargupta300822 күн бұрын

  Outstanding explanation in such a ez way <3 !

• 
  @MrBeasstHindiEnglish22 күн бұрын

  "Great explanation on removing duplicates from a sorted array! 𝑰 𝒓𝒆𝒄𝒆𝒏𝒕𝒍𝒚 𝒎𝒂𝒅𝒆 𝒂 𝒗𝒊𝒅𝒆𝒐 𝒐𝒏 𝒕𝒉𝒆 𝒔𝒂𝒎𝒆 𝒕𝒐𝒑𝒊𝒄 , exploring different approaches. It's always interesting to see how others tackle this problem."

• 
  @sandykl23 күн бұрын

  PROBLEM SOLVED!

• 
  @Caped_Crusader724 күн бұрын

  why visited = -1?

• 
  @vikasvarshney168127 күн бұрын

  Good explanation.!!

• 
  @beesettiswathi716229 күн бұрын

  great explanation mam..thank you so much

• 
  @narendrabudaniya4353Ай бұрын

  mam your code is left the last element always so return count is always less one here is the write code int pointer = 0; for (int i=0; i<nums.length-1; i++){ if (nums[i] != nums[i+1]){ nums[++pointer] = nums[i+1]; } } return nums.length ==0 ? 0 : pointer+1;

• 
  @gastonhitw720Ай бұрын

  34:57 when you are in this screen is there a way to use vmware esxi gui on the same server? or it has to be managed yes or yes from that ip address in a browser?

• 
  @ganeshjaggineni4097Ай бұрын

  NICE SUPER EXCELLENT MOTIVATED

• 
  @ujjwaldas2302Ай бұрын

  you dint verified the case that majority element should be more the n/2 ????

• 
  @ganeshjaggineni4097Ай бұрын

  NICE SUPER EXCELLENT MOTIVATED

• 
  @helloworld3975Ай бұрын

  amazing solution

• 
  @hiteshsuthar1097Ай бұрын

  Tnx, changing broadband speed options really worked well

• 
  @HiteshGorantlaАй бұрын

  Is there a way to automate it through CLI ?

• 
  @TechnosageLearningАй бұрын

  You can use Python library pyvmomi. Or if you need CLI you can use ovftool offered by vmware.

• 
  @GauravRaj-bi9kgАй бұрын

  why u have stop the series you may complete it all plzzzzzzzzzz

• 
  @TechnosageLearningАй бұрын

  Hi Starting very soon..working on it..Please stay tuned

• 
  @GauravRaj-bi9kgАй бұрын

  @@TechnosageLearning as soon as possible am waiting

• 
  @allasandeep1466Ай бұрын

  class Solution { public int search(int[] nums, int target) { if(nums.length == 0 || nums == null){ return -1; } int n= nums.length; int i; for( i=0;i<n;i++){ if(nums[i] == target){ return i; } } return -1; } }

• 
  @zarahassan6058Ай бұрын

  I'm working with a large dataset and the data is stored in json files. Json file Holds data,path is correct too,not parsing the data through any api still it gives the same error. Even i tried multiple ways. Why is this happening?

• 
  @pragatii9054Ай бұрын

  Thank you

• 
  @ka23853Ай бұрын

  Please share your code series of java

• 
  @dhruvavishwakarma253Ай бұрын

  Why are you not solving in Leetcode , In Leetcode this code didn't pass all test cases

• 
  @maheshdurishetti7370Ай бұрын

  What if we give values like 1,2,3,3,3,3,5,6,6

• 
  @nandinideshpande1467Ай бұрын

  very well explained!!

• 
  @navalprakash3727Ай бұрын

  class Solution { public int search(int[] nums, int target) { for(int i=0; i<nums.length; i++){ if(nums[i]==target){ return i; } } return -1; } } this colde is also acceptable

• 
  @ChinmayPatil-22Ай бұрын

  bro it's time complexity is O(n) we have to do the question by O(log n)✌