Hello bro , subscribed to ur channel today .. started late but one day even i have hopes that i will understand complex dsa problems. I want to switch from service based to product based .. the kind of work u r doing for us is truely inspirational. Keep inspiring us ❤❤
A2Z DSA course , I am a new learner and found that some videos are coming soon, and in step 2, only counting frequencies of array elements and other videos are not uploaded. Please guide me on what we have to do here.
sir i love your vidoes u make dsa look very easy. i did linked list from you and understood all the concepts but stack and queue is something I am facing a lot of challenge with. can you please after this playlist complete the stack and queue playlist.
Striver bhai.. Plz add search bar in our website. Any problem I need to separately search in google tuf.. then in youtube tuf for video… tuf is my first preference for any dsa…
Sir having a doubt not of this que I come through this problem many time as I try to run the code it executes and gives correct output for some case but sometimes submiting the code gives error at same test case with different output What actually is going on and how to handle it
use Double in the comparitor function so what happens is assum we have val1 = 10 , 7 and val 2 = 10 , 6 so it compares 10/7 , 10/6 becz in int type they both are 1 so it return 10/7 which is wrong but using double solves it .
Striver a request, could you kindly provide a shorter playlist version for the binary search playlist as you said you would and as you have done for graphs and dp , as we have very less time for placements.
OPTIMAL SOLUTION $$ class Solution { public: static bool comp(Item a, Item b){ double r1 = (double) a.value/a.weight; double r2 = (double) b.value/b.weight; return r1>r2; } // Function to get the maximum total value in the knapsack. double fractionalKnapsack(int w, Item arr[], int n) { // Your code here double totalval=0; sort(arr,arr+n,comp); for(int i=0;i
class Solution { public: // Function to get the maximum total value in the knapsack. double fractionalKnapsack(int w, Item arr[], int n) { typedef pairpfi; priority_queuepq; for(int i = 0;i0&&pq.size()>0){ auto it = pq.top(); pq.pop(); double vl = it.second.first; double wt = it.second.second; if(wt
your content is gold. Please public the stacks and queues series 🙂
bhai kya hua stack and queue series kal toh dekhi thi maine aaj gayab kaise ho gyi??????????
@@Deepakkumar-pm2kt audio quality accha nahi tha isliye re-upload kiya
Understood. Striver ,String series please its much needed!!!!
Striver why did you remove the Stacks and Queues Videos from your channel ?????
I study DSA in many courses but trust me such a way, you teach never found.l❤
why did you remove the stack and queues playlist aadha kiya tha
hey striver why u did stack and queue playlist as private
Yes last night it was uploaded and now its not there what happened?
Strings and stack queues after this please!
Hello bro , subscribed to ur channel today .. started late but one day even i have hopes that i will understand complex dsa problems. I want to switch from service based to product based .. the kind of work u r doing for us is truely inspirational. Keep inspiring us ❤❤
Sir please start making videos on strings and stacks
Recursion and Backtracking please
@@arunbhagat8023 There is already a playlist on recursion by striver
@@shreyanshsrivastav6773 that is basic
@@shreyanshsrivastav6773 it is basic
@@arunbhagat8023 please share the joint you are smoking 🚬
Hey striver, please make the Stack Queue series public. I was in the middle of a video lol
why he did private bro????
Sir ppz start stack and queue and strings 😢
Completed , Thanks a ton striver
Where is stacks playlist...?striver...
sir apne private kyu krdi stack best playlist thi
Nice! Thanks for clear explanation. May i know which pen/tablet and app you are using for this teaching ?
A2Z DSA course , I am a new learner and found that some videos are coming soon, and in step 2, only counting frequencies of array elements and other videos are not uploaded. Please guide me on what we have to do here.
bhai leave them basics must have been clear and now move to arrays directly.
sir i love your vidoes u make dsa look very easy. i did linked list from you and understood all the concepts but stack and queue is something I am facing a lot of challenge with. can you please after this playlist complete the stack and queue playlist.
Hey Striver! Will there be a SDE SHEET CHALLENGE 2024? Love the work you do for the community
Heart from india.. watching from 🇨🇦
Please bring string series
Recursion playlist needed
stack series coming soon!!
saw striver's leetcode profile he solved stack problems 😁
Link of profile
understood ♥...... next heaps playlist please🥺!!!!
Recursion Backtracking Strings and Stack Next Please...
please upload the videos of string
Stack and Queue series kyun udd gayi?????
understood
Segment Tree videos plz
Bro can you please solve the problem "STRONG PASSWORD CHECKER" in leetcode question no.420. And make a video on it.
Stacks Queues plzzzzzz
bro public the stack and queue playlist again plss
Which notepad application are you using?
can anyone tell me why Unauthorised showing again and again after i login from my gmail account
please upload video on java collections
strings after this please
brother pls upload the videos of string and stack queue
is this the last video for greedy algorithms ??
Start Doing on Strings please sir
Please sir upload on string
broo where did your stack and queue playlist gone 🥲
I need Strings and Recursion videos
Striver bhai.. Plz add search bar in our website. Any problem I need to separately search in google tuf.. then in youtube tuf for video… tuf is my first preference for any dsa…
❤❤❤❤
Waiting for strings playlist
First comment.. love from 🇨🇦
Striver bro do video on Huffman coding
Two City Scheduling Please
can anyone paste complete cpp code here
Why you made your screen small please zoom it although I cant concentrate seriously looking at you😅
@takeUforward bhaiya pleasee give the codes too! THANKS A LOT
We are the Zeta alpha and none other than sorcher ones
Stack means lifo and queue means fifo naa
Sir having a doubt not of this que
I come through this problem many time as I try to run the code it executes and gives correct output for some case but sometimes submiting the code gives error at same test case with different output
What actually is going on and how to handle it
use Double in the comparitor function
so what happens is assum we have val1 = 10 , 7 and val 2 = 10 , 6
so it compares 10/7 , 10/6 becz in int type they both are 1 so it return 10/7 which is wrong but using double solves it .
Please upload string videos
can you please let me know the app that you are using for writing notes while explaining
onenote
Take this
Striver a request, could you kindly provide a shorter playlist version for the binary search playlist as you said you would and as you have done for graphs and dp , as we have very less time for placements.
Hi
What is the name of the app he use?
I wanna know this too
ye toh sach h ki bhagwan h
OPTIMAL SOLUTION $$
class Solution {
public:
static bool comp(Item a, Item b){
double r1 = (double) a.value/a.weight;
double r2 = (double) b.value/b.weight;
return r1>r2;
}
// Function to get the maximum total value in the knapsack.
double fractionalKnapsack(int w, Item arr[], int n) {
// Your code here
double totalval=0;
sort(arr,arr+n,comp);
for(int i=0;i
Who who who who who who
vote for System Design 👇👇👇👇
Greedy: I am here to make profit not to enjoy my life😂
U r trolled by me and my brother
Baccho ka dsa
Look sandeep maheshwari greatest incentive ever than u
class Solution {
public:
// Function to get the maximum total value in the knapsack.
double fractionalKnapsack(int w, Item arr[], int n) {
typedef pairpfi;
priority_queuepq;
for(int i = 0;i0&&pq.size()>0){
auto it = pq.top();
pq.pop();
double vl = it.second.first;
double wt = it.second.second;
if(wt
Who this rubbish sir
Strings and stack queues after this please!
yes
Strings and stack queues after this please!
Strings and stack queues after this please!
Strings and stack queues after this please!
Strings and stack queues after this please!
Strings and stack queues after this please!
Strings and stack queues after this please!
Strings and stack queues after this please!
Strings and stack queues after this please!
Strings and stack queues after this please!
Strings and stack queues after this please!
Strings and stack queues after this please!