Пікірлер

• 
  @griffin5631Күн бұрын

  sir what is the difference between this problem and the 3 sum problem of leetcode , cuz when i submit same code there i get memory limit exceeded

• 
  @sabreayub88762 күн бұрын

  C return interview questions batao bro kya kya pucha jata hai

• 
  @ArunKumar-vd8zt7 күн бұрын

  more optimized package HASHING; import java.util.HashMap; import java.util.HashSet; public class CheckEqualArrays { public static void main(String[] args) { int [] arr1 = {1,2,5,4,0}; int [] arr2 = {2,4,5,0,1}; HashMap<Integer,Integer> freq = new HashMap<>(); CheckEqualArrays obj = new CheckEqualArrays(); boolean result = obj.isEqualArray(freq, arr1,arr2); System.out.println(result); } private boolean isEqualArray(HashMap<Integer,Integer> freq,int [] arr1,int [] arr2) { int n1= arr1.length; int n2=arr2.length; if(n1!=n2) return false; int start=0; int end=n1-1; while(start<end) { freq.put(arr1[start],freq.getOrDefault(arr1[start],0)+1); freq.put(arr2[start],freq.getOrDefault(arr2[start],0)-1); freq.put(arr1[end],freq.getOrDefault(arr1[end],0)+1); freq.put(arr2[end],freq.getOrDefault(arr2[end],0)-1); ++start; --end; } for (int x: freq.values()) if(x!=0) return false; return true; } }

• 
  @shajinshan16 күн бұрын

  class GfG { //Function to locate the occurrence of the string x in the string s. int strstr(String s, String x) { for(int i = 0;i<s.size() ; i++){ if(s[i] == x[0]){ for(int j=0;j<j.size();j++){ if(s[i+j] == x[j]){ if(j == x.size()-1){ return i; } continue; } else { break; } } } } return -1; }//method }//class

• 
  @shajinshan16 күн бұрын

  if it possible use of [ ] for chatAt()

• 
  @dhruvsingh183720 күн бұрын

  Really good explanation

• 
  @DarshanDarshu-mb9ccАй бұрын

  What is interpreter

• 
  @Rahul-jl2exАй бұрын

  love your explaination...

• 
  @soujannyadeb2415Ай бұрын

  public static int zerotofive(int n){ int copy=n; int mul=1; while(n>0){ // Corrected condition int digit=n%10; if(digit==0){ copy+=mul*5; } mul=mul*10; n=n/10; } return copy; }

• 
  @RAHUL_Supermacy_082 ай бұрын

  Tamil ku English ku nu thainiya content makes ahaa 🛐🚀💥🔥

• 
  @RAHUL_Supermacy_082 ай бұрын

  Bruhh 🤞🏻 Nice 💥

• 
  @user-wo5rd8qk2o2 ай бұрын

  great explaination.

• 
  @patelkrish26462 ай бұрын

  There is a little correction in the code The corrected version is class Solution { public boolean isBoomerang(int[][] points) { int dx1 = points[1][0] - points[0][0]; int dx2 = points[2][0] - points[1][0]; int dy1 = points[1][1] - points[0][1]; int dy2 = points[2][1] - points[1][1]; return ((dx1 * dy2) != (dx2 * dy1)); } }

• 
  @RameshKumar-ng3nf3 ай бұрын

  I havent see anybody explaining it in such simple way. Hats off to your great explanation 🙏 any beginner can understand easily.

• 
  @rinkirawat49783 ай бұрын

  thank you

• 
  @sukumarsai33974 ай бұрын

  nice explanation earned a Sub continue the great work

• 
  @krishnadahule-gw7wd4 ай бұрын

  Same same bro 😊

• 
  @krishnadahule-gw7wd4 ай бұрын

  ♾️

• 
  @krishnadahule-gw7wd4 ай бұрын

  Like is output 😊

• 
  @krishnadahule-gw7wd4 ай бұрын

  At first iteration condition will false and value of i is incremented by 1 then output is 65001

• 
  @krishnadahule-gw7wd4 ай бұрын

  I know I'm not too late Ans:14 2*6=12+2=14 😊

• 
  @krishnadahule-gw7wd4 ай бұрын

  Infine loop q ki while condition kabhi false hogi hi ni

• 
  @krishnadahule-gw7wd4 ай бұрын

  Let me correct output will be 3 2 1

• 
  @krishnadahule-gw7wd4 ай бұрын

  I think we use stack concept here So first push sequence is 1 2 3 And pop sequence is 3 2 1 So output will be 3 😊

• 
  @krishnadahule-gw7wd4 ай бұрын

  I'm not late 😢

• 
  @krishnadahule-gw7wd4 ай бұрын

  2 1 Output

• 
  @krishnadahule-gw7wd4 ай бұрын

  Output is 2 Return 0 is for our program is successfully executed Not for printf statement

• 
  @krishnadahule-gw7wd4 ай бұрын

  I know it is not too late for me ❤

• 
  @krishnadahule-gw7wd4 ай бұрын

  54321 is answer sir 😊

• 
  @krishnadahule-gw7wd4 ай бұрын

  Cannot store string in a char data type

• 
  @krishnadahule-gw7wd4 ай бұрын

  Throw error 😢

• 
  @Gamersingh20504 ай бұрын

  this code show time limit exeed same problem

• 
  @harshini0995 ай бұрын

  Bro besant technology chennai velacherry la online data science course panalama is it worth

• 
  @user-zk3cn9vi6x5 ай бұрын

  bro where did u learn complete DSA i mean all topics like stack, queue, linked list and other algorithms

• 
  @makarandpatil11835 ай бұрын

  thanks bro

• 
  @akhilkanwar70226 ай бұрын

  thanks bro , will try to solve question using your videos

• 
  @bairavin2666 ай бұрын

  Brother! Is it right that when the stack is empty top=-1?

• 
  @galavizK6 ай бұрын

  Thanks for the explanation ❤

• 
  @jayaramalukunta7206 ай бұрын

  Good explanation

• 
  @user-eq3qn9hm3e6 ай бұрын

  thank you bro

• 
  @venkatreddy-wb9mr6 ай бұрын

  output is 1 and 3 but what if the money they have is 9 rupees

• 
  @priyanshutripathi18526 ай бұрын

  When you run a Java code , then that code is translated into byte code and to run it we need JVM , to run on any platform

• 
  @clovisstanford65156 ай бұрын

  Can someone explain why he added n-1 rather than n

• 
  @ishajaswal75477 ай бұрын

  very well explained

• 
  @vishutyagi84037 ай бұрын

  Fir JRE kya krta hai

• 
  @shehza-d7 ай бұрын

  Thanks Bro got it

• 
  @saifulhuqs7 ай бұрын

  Next video maximum product subarray right bro

• 
  @codeio-english7 ай бұрын

  Right bro 😂😂🤩🤩🤩