Відео

Thanks

String numString=String.valueOf(n); int length=numString.length(); for (int i=0;i<length;i++) { System.out.println(numString.charAt(i)); numString.equals(numString); }

Summit Bhaiya, Tussi Great Ho!

Note : When you make even a slight change in your vs-code console i.e the *server.js* file . Use the *Run icon* , if the node server.js command in terminal doesn’t work . To run the code . Also use Control C first to clear the terminal. You need to compile first . Then run the server . I thought when I run the server . It would automatically compile and run . That didn’t work for me . Use the manual way

Perfect Explanation !

Excellent explanation sir... I was so confused in this question before this explanation.

start watching from 11:03

Bhai acha to tha waise , no doubt!!!

yar bahi video me obj wala part aap ne miss kar dia baki video buhat good thi

thank you sir

maza aa gya

thank god kisi teacher n to hindi m baat krni shuru ki. nahi to aadhe se zyada teacherts ko lagta h english m bak do kuch b aur sb badiya ho jayega .. Dhanyawaad guru ji

nice explanation sir.. keep it up

Here's C++ /java solution class Solution{ public: int lp2(int n){ int x=0; while((1<<x)<=n){ x++; } return x-1; } int countSetBits(int n) { if(n==0){ return 0; } int l=lp2(n); int b1=l*(1<<(l-1)); int b2=n-(1<<l)+1; int m=n-(1<<l); int b3=countSetBits(m); int ans=b1+b2+b3; return ans; } }; 😇

bhai kya kr rhe ho yaar abe shi se dikh bhi nhi rha h

No other educator could have taught it in that depth!

What if two elements in a row are equal?

Bhai , jab Kadanes Algo dekh teh hain, toh lagta hai ki , itna confusion hai , aur samjh ne ke baad , lagta hai ki yeh kya hai?? yeh explanation kabhi bhi nahi bhulunga . Thanks Sir .

GREAT !

it can be solved using hashmap

Where is notes?

Where is notes?

nahi chahiye tera explanation math se kerdiyaa

bool isValid(String input){ List<String> stack = []; Map<String,String> matchingBrackets = { ')' : '(', "}" : "{", "[" : "]", }; for(int i = 0; i< input.length;i++){ String current = input[i]; if(current == "(" || current == "{" || current == "["){ stack.add(current); }else if(current == ")" || current == "}" || current == "]"){ if(stack.isEmpty || stack.removeLast() != matchingBrackets[current]){ return false; } } } return stack.isEmpty; } In dart from chatgpt much easier code

👌👌👍👍❤❤🙏🙏

❤❤

What is leetcode question number ?

Excellent explanation ! So helpful Thank you soo muchhh !!!

definitely the most brilliant explanation for this question which i have ever come across. EACH AND EVERYTHING IS EXPLAINED. WHY ARE WE DOING THIS, HOW ARE WE DOING THIS, THANK U SO SO MUCH SIR.

what happened to rhe pepcoding website ?

haha!!! I thought you gonna demo it installing from BIOS level.

Java Solution import java.util.* ; import java.io.*; import java.util.ArrayList; public class Solution { public static boolean findRedundantBrackets(String s) { // Write your code here. Stack<Character> stack = new Stack<>(); for(int i =0;i<s.length();i++) { char ch = s.charAt(i); if(ch == ')') { if(stack.peek() == '(') return true; else{ while(stack.peek() != '(') { stack.pop(); } stack.pop(); } } else if(ch == '(' || ch == '+' || ch=='*' || ch == '-' || ch=='/'){ stack.add(ch); } } return false; } }

// I can't believe I solved it fully, without seeing the solution. The way you breakdown the question is amazing. // I started this playlist on 10th August 2024, and now after 10 days I am loving it. Thank you sir.

public class InverseNumber { public static void main(String[] args) { int a=53234263; int inverse=0; while(a!=0){ int rem=a%10; inverse=inverse*10+rem; a/=10; } System.out.println(inverse); } }

Thanku So much great content

thanks

It takes how many days to complete all this 500 + vedios

salam sir kya explain kya apne

void solve(vector<vector<int>> &mat) { int n = mat.size(); int m = mat[0].size(); bool dir = true; for(int j=0;j<m;j++) { for(int i=0;i<n;i++) { if(dir) { cout<<mat[i][j]<<" "; } else { cout<<mat[n-i-1][j]<<" "; } } dir = !dir; cout<<" "; } }

Line 36 you pushed i but not arr[I]

public int maxSubArray(int[] nums) { int start = 0, end =0, currentBest=nums[0], maxBest=currentBest; for(int i = 1 ; i < nums.length ; i++){ currentBest = Math.max(currentBest + nums[i], nums[i]); maxBest = Math.max(currentBest , maxBest); } return maxBest; }

❤

Good!!

Thank You!!

union question of sorted array ....u explain extremely well of an entire youtube videos ...amazing thx

Our course instructor suggest your playlist for better understanding of Recursion But after attending 1 lecture I know why she suggested ❤

another easy approach> int num = 15234; int currPos = 1; int ans = 0; while (num > 0) { int digit = num % 10; // System.out.println(digit + "-" + currPos); ans = ans + currPos * (int) Math.pow(10, (digit - 1)); num = num / 10; currPos++; } System.out.println(ans);

GAWD effort.... Respect

is there any issue with the website?

Thanks for this content You are the one who describing solidity in good way and also in Hindi so thanks