Arranging Coins | leetcode 441 | Hindi

liked this video? Click here / @codebix1096 join our facebook group :- / 258049468776636
problem :- leetcode.com/problems/arrangi....
code :- github.com/luckykumardev/leet...

[@nanduksathyan7395]

Thanks Bro, Nice explanation. Love from Kerala

[@kushaalrana]

Thanks for uploading all the approaches with codes helps to develop the thought process 👍

[@codebix1096]

So nice of you

[@Rits2203]

Amazing explanation!

[@piyushsharma1638]

really liked your approach of explanation.. reminded one of the mentors in school :)

[@codebix1096]

Glad to hear that!
Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

[@palakkumar7943]

osm

[@AmazingWorld-fw9oc]

Sir I just wanted to point that in 2nd method the tc should be o(log k) as we should apply Bs on 0-k.

[@sakshampaliwal1526]

Good Explanation

[@deveshkumar2862]

Thank you sir.
Sir I have a suggestion for u. When you explaining the code . Can you zoom in to the code . This might be good .

[@deveshkumar2862]

Becoz code font size is to small for us. If you zoom in this problem might be solve

[@codebix1096]

Okay Devesh will do.
Btw code is also available in video description

[@rishavraj6861]

why you take (long)n in constant time

[@amanpandey4550]

Time Complexity - O(log n)
Code:
class Solution {
public:
bool func(long long k,int n){
return (k*(k+1)/2)