Can u pls share me the source code 😔

Awsome

Wow sir mene ye concept to smj liya tha pr code kese banau smj hi nhi aa raha tha pr ye video dekh kr mujhe bahut kuch smj aaya mene Puri KZbin list Chan li thi or kahi bhi code explain hi nhi kra tha thanku so much sir ❤️

can be optimise the code... def knapshak(values,weights,w): ratio=[i/j for i,j in zip(values,weights)] index=list(range(len(values))) index.sort(reverse=True,key=lambda x:ratio[x]) profit=0 for i in index: if w > weights[i]: profit+=values[i] w-=weights[i] else: profit+=w*ratio[i] break return profit values=[100,120,60] weights=[20,30,10] w=50 print(knapshak(values,weights,w))

Good

Bhai solution doesn't seems correct. If input is like 1 4 4 4 4 4 4 5 and x cost is 2 then it will skip 6 shops continuously but which as per the problem it shouldn't

Please

Explain error in it

a=input() a1=a.split() n=int(a1[0]) w=int(a1[1]) b=input() b1=b.split() c=input() c1=c.split() retl=[] for i in range(n): ret1=[] ret1.append(int(b1[i])) ret1.append(int(c1[i])) ret1.append(ret1[0]/ret1[1]) retl.append(ret1) def max(p): flag=len(p) for i in range(flag): for j in range(flag-i-1): if p[j][2]>p[j+1][2]: p[j],p[j+1]=p[j+1],p[j] p.reverse() return p retv=max(retl) sum=i=0 while(w>-1 and i<n): sum=sum+retv[i][0] w-=retv[i][1] i+=1 if w>=0: print("{0:.{1}f}" .format(sum,6)) else: p=w sum=sum+p*retv[i-1][2] print("{0:.{1}f}" .format(sum,6))

Thanks

How to print all the possible way of placing n queens

please give your code link

can you give the link of the code?

so easily done..really loved it sir!

wrong ans

Best Explanation so far. People confused me so much before. Can you make one on TOP DOWN/BOTTOM UP approach as well

Improve voice quality sir

Any way tq sir

Sir only one problem na

Sir how many hours sir this class

Feedback please Will post more with more complexity to help students preparing for CAT and GATE

I think is_safe function is wrong. Second while loop is wrong.

Wrong answer.. where it is mentioned that you have cost in sorted order

Its showing time limit exceed from test case 10 to 29

31 should be the answer

the code doesn't work For the test case, 10 2 1 2 3 4 5 6 7 8 9 10 a total of 31 can be achieved 1 + 2 + 2 + 2 + 2 + 6 + 2 + 2 + 2 + 10 = 31 person shops at shop numbers 1, 2, 6, and 10 shops skipped - 3, 4, 5, 7, 8 and 9 Clearly 31 < 37.

When will be the last if case encounter??

Sir are you providing any online training now??

Hii... could you please share the questions??

Sir,please do some videos on data science

Rao ji, content is awesome.If the production is better, you'll have a great journey ahead on KZbin. Thanks for the detailed explanation.

at 9:41 sec the ans should be 33 (1 2 3 4 5) time=(1+2)=3 (3 3 4 5) time=3+(3+3)=3+6=9 (4 5 6) time =9+(4+5)=9+9=18 (6,9) time=18+(6+9)=33 But your code is showing 34. Please make some changes and update the video. Thank you🙂.

if(a2[i] < 0) sub = (a1[i] + (2*k)) * a2[i]; if(a2[i] > 0) sub = (a1[i] - (2*k)) * a2[i]; you can simply use these condition

Python solution: programmer4all.com/prime-fibonacci/

Python solution: programmer4all.com/exchange-digits-solution-using-python/

Nice sir and make more videos

Bro this is the formula in problem statement (EMI = loanAmount * monthlyInterestRate / ( 1 - 1 / (1 + monthlyInterestRate)^(numberOfYears * 12)) . But you used different one.. Explain that formula

From NEC ...right?

I am getting runtime error

Thanks sir.. Sir more videos on tcs please!!

Sir the explanation of code is good but it will be excellent when you explain the code with complexity

It is not working for below test case. abc bcd 10

finding you in my youtube, is very much great happened to me <3..... Very happyto learn from you!!

vector<int>& go(vector<int> &nums) { int n = nums.size(), nxt = 0 ; for (const int x : nums ) { if (x != 0) nums[nxt] = x, nxt++ ; } for (int i = nxt; nums[i] = 0, i < n; i++) ; return nums ; } Solution in C++ || more simple <3

👏👏👍

Sir.. Please give solution for Codevita question ON A CUBE

Iam getting runtime error if type this code could u help me plz

sir pls do a video on this problem when you r free www.hackerearth.com/problem/algorithm/dice-rolls/

Is this question asked in hackwithinfy 2020

def primes_method1(n): out = list() for num in range(2, n+1): prime = True for i in range(2, num): if (num % i == 0): prime = False if prime: out.append(num) return out list1=primes_method1(123) print(list1) sum=0 count=0 for i in list1: sum+=i if sum in list1: count+=1 count-=1 print(count) my solution is 10 times better than yours