U deserve many likes on your videos

Bro what is your name your teaching style is very different❤

can uu provide me more fidelity problems? I have interviews

Best explanation

very bad Explanation

hey but what about duplicate numbers ,

Thank you na

Its too late to reply ,but Nice explanation...

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

C return interview questions batao bro kya kya pucha jata hai

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; } }

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

Really good explanation

What is interpreter

love your explaination...

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; }

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

Bruhh 🤞🏻 Nice 💥

great explaination.

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)); } }

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

thank you

nice explanation earned a Sub continue the great work

Same same bro 😊

♾️

Like is output 😊

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

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

Infine loop q ki while condition kabhi false hogi hi ni

Let me correct output will be 3 2 1

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 😊

I'm not late 😢

2 1 Output

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

I know it is not too late for me ❤

54321 is answer sir 😊

Cannot store string in a char data type

Throw error 😢

this code show time limit exeed same problem

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

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

thanks bro

thanks bro , will try to solve question using your videos

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

Thanks for the explanation ❤

Good explanation

thank you bro