Video

How is this recursive?

ques2 - 08:10 ques3 - 40:49

for(int i=1;i>1;i++) { cout<<"💯"; }

I'm getting this = Your Code is not producing any output.

7:07 bro you also know you fkd up the explanation at this point..

Best intuitive explanation so far. Thanks.

waste solution

Hi Sidharth @sidhartha166 can you tell me one thing, how do you write with pen tablet on gfg site, because of i am able to use only in whiteboard

bro your explanations is at peaks. thank you so much

I used the first approach it got submitted bro

Solved this one today.

can any one tell what is the difficulty rate for the 2 and 3 question (medium or hard)

I don't think you need to calculate prime numbers beforehand as when you are starting from two and going till sqrt(n) you are already making sure you only divide arr[i] by prime numbers for example you check arr[i] is divisible by 2 and divide the number till it is no more divisible by two so when 4 or 6 comes they will not increase the count same for other prime numbers

Great video

thankyou bro your approach is cleared is there any practice sessons for creating a DB for projects??

i ws not getting the whats the limit of zeros but this video cleared thank you

Great explanation

I did the third question in a similar way with same time complexity but TLE, was it because I did in Python? The code that I did: from typing import List class Solution: def countSubarrays(self, n: int, arr: List[int]) -> int: ans = len(arr) for i in range(n): Min = arr[i] Max = arr[i] for j in range(i + 1, n): Min = min(Min, arr[j]) Max = max(Max, arr[j]) ln = j - i + 1 if (Min + Max) % ln == 0: ans += 1 return ans

bad explaination

Wow it's so simple... And I thought that's I use to the recursive for finding subarr.. to do the product..

best explaination

Nice explanation!

Great Explanation

Sir ques 4 exactly same solution is giving TLE for Java

great video

i got last question like upto 60 percetn i guess, thought of reducing number, this was great explanation

Very Nicely Explained,

so close. if only i had seen the constraints for the 3rd question

Great explanation... Understood👍

import java.util.ArrayList; public class sumofalldivisorfrom1ton { static long sumOfDivisors(int N) { ArrayList<Integer> arr = new ArrayList<>(); while (N>0) { for (int i = 1; i * i <= N; i++) { if (N % i == 0) { arr.add(i); if (i != N / i) { arr.add(N / i); } } } N--; } long sum = 0L; for (int x : arr) { sum+=x; } return sum; } public static void main(String[] args) { System.out.println(sumOfDivisors(4)); } } this is my logic but it is bruteforce and expected time is 1ms

aisa lg rha h bhaiya mst phook k bethe h

Nyc explanation ❤

@GeeksforGeeksPractice you guys always explain the solution but, but there is only one ( Siddharth Hazra) who explain to us why we would be doing this, He help us to build the approach not just solutions 😅😅.

This could be a worst possible explanation of a solution, just simply dry running the working code without even giving the intuition behind it😪

nothing is clear

Superb explanation bro. You made this hard problem very easy to understand.

Please explain brute force approach for the problem, then better followed by optimal. Also explain the intuition behind the optimal solution. Aditya Rajiv's explanation for this problem was easy to understand.

you shuold not directly jump to code doing dry run, first tell how we derived the code in the first place.. you never explained why it's inc =dec+1

❤❤❤

Very bad teaching...You are not good in english

nice explanation

NICE SUPER EXCELLENT MOTIVATED

❤

My solution: string smallestNumber(int s, int d) { if(s > 9*d) return "-1"; int max = 9*(d-1); string ans; for(int i=0;i<d;i++) { int rem = s - max; char c = rem+'0'; if(s > max){ ans.push_back(c); s -= rem; } else { if(i==0) { ans.push_back('1'); s--; } else { ans.push_back('0'); } } max-=9; } return ans; }

Please don't explain solution,explain the intuition and dry run the code

Sir one day i will be also good problem solver like you .

Best explanation My soln ---> same approach but a little easy to implement string smallestNumber(int s, int d) { // code here if(d*9<s){ return "-1"; } s--; d--; string res; for(int i=0; i<d; i++){ int ans = min(9, s); s-= ans; res.push_back('0'+ans); } if(s){ s++; res.push_back('0'+s); }else{ res.push_back('1'); } reverse(res.begin(), res.end()); return res; }

poor explanation for D

i have never the comments reach more than 50 from unique users.. so 100 users is just too much you should make the videos regardless.. not everyone watches these post contest analysis...