what a great explanation....i just discovered your channel today....other people have just wrote the code and didnt tell intuition behind working of it.....u gave such a detailed explanation with proper intuition.....will come every week to see solution of the contest questions which i will not be able to solve.....please never stop uploading.....maybe u r getting less views now but 1k-2k people who are watching i am sure are getting a great help from this....thanks
Your channel is a gem, the only feedback which I would like to give you- there are too many playlists which are not organized in the easier to harder order. For beginners, it is confusing if they want to follow you or which path to follow step by step. Could you please make a dedicated video / organize your content in easy to high level problems as such it would be easy for everyone to follow? Thanks!
sir not able to understand whats wrong in my code class Solution { public: const int MOD = 1000000000+7; long long power_mod(long long base, long long exp) { long long result = 1; while (exp > 0) { if (exp % 2 == 1) { result = (result * base) % MOD; } base = (base * base) % MOD; exp = exp / 2; } return result; } vector getFinalState(vector& nums, int k, int multiplier) { if(multiplier ==1) return nums; priority_queue minHeap; int initialMaximum =0 ; int initialMaximumIndex = -1; for(int i=0 ;i initialMaximum) { initialMaximum = nums[i]; initialMaximumIndex = i; } } while(k> 0 && minHeap.top().first*multiplier 0) { nums[minHeap.top().second]=(minHeap.top().first*multiplierKiPowerKaResult)%MOD; minHeap.pop(); } for(int i=0 ;i
Really Helpful
Amazing !!! thank you!
what a great explanation....i just discovered your channel today....other people have just wrote the code and didnt tell intuition behind working of it.....u gave such a detailed explanation with proper intuition.....will come every week to see solution of the contest questions which i will not be able to solve.....please never stop uploading.....maybe u r getting less views now but 1k-2k people who are watching i am sure are getting a great help from this....thanks
a great, easy to follow and comprehensive explanation 🔥
Amazing explanation also do a dry run of code also for beginners
Thank you, great explanation!
Great Explanation!
So good video. Crystal clear. Please continue making such type of videos very helpful
Great Solution Bhaiya..
Overwhelmed by the explanation :)
thank mohan, for this much-needed video i really appreciate it
THIS QUALITY CONTENT >>>>>>>
Your channel is a gem, the only feedback which I would like to give you- there are too many playlists which are not organized in the easier to harder order. For beginners, it is confusing if they want to follow you or which path to follow step by step. Could you please make a dedicated video / organize your content in easy to high level problems as such it would be easy for everyone to follow? Thanks!
Great explanation. Improve your thumbnail you deserve more ❤🎉
thank you
QUALITY>>>
thnxx keep going.
god's work
is this any cp concept? how 300 people solved this in the time of contest?
bro mohan is your real name?
My real name is Subham.
@@codingmohanall hail king Subham
sir not able to understand whats wrong in my code class Solution {
public:
const int MOD = 1000000000+7;
long long power_mod(long long base, long long exp) {
long long result = 1;
while (exp > 0) {
if (exp % 2 == 1) {
result = (result * base) % MOD;
}
base = (base * base) % MOD;
exp = exp / 2;
}
return result;
}
vector getFinalState(vector& nums, int k, int multiplier) {
if(multiplier ==1) return nums;
priority_queue minHeap;
int initialMaximum =0 ;
int initialMaximumIndex = -1;
for(int i=0 ;i initialMaximum) {
initialMaximum = nums[i];
initialMaximumIndex = i;
}
}
while(k> 0 && minHeap.top().first*multiplier 0) {
nums[minHeap.top().second]=(minHeap.top().first*multiplierKiPowerKaResult)%MOD;
minHeap.pop();
}
for(int i=0 ;i