Really true bro
I got prime rangers and second one was given a graph we have to make it bipartite with maximum size by deleting edges
Yeah but no need of combinations
Directly u can memorize that count of 2s , 3s ,5s ,7s and index and another variable state which refers for generating that nunbers
Finally dp will look like dp[][][][][][]
3 of my friends had the coding round on 4th October and the other 2 (including me) on 7th October.
everyone else here received just the shortlist on 14th october. You talking about interview or coding test?
Oh, I am sorry I corrected it. I was talking about coding round. My bad.
what was the question asked in the interview?
anyone else got any interview mail?
did you got any interview mail??
no
1 Like
Not scheduled till date and not expecting too. Score was less. Let’s see.
what was your score?
1 Like
140 in Coding aur MCQ’s me bhi hope all correct so 170.
anyone who is shortlisted and got an interview call?
This approach didn’t completely work. Actually I did using the same approach but it passed just 4/10 test cases. For rest 6 Time Limit Exceeded.
Using that approach i managed to solve fully
Could you please share the code
sorry i havent used comments
hope u can understand that code
if any solved the question of bipartite graph (u will be given a graph u have to make it bipartite by removing minimum number of nodes so ultimately u have to find maximum size of bi partite graph that u can make )
plzz let me know
1 Like
No worries. Thanks for sharing the code 
I gave my interview on 19th haven’t heard back from them till yet.Did anyone else over here gave interview as well?
1 Like
Waiting since ages
1 Like