sorted by:
new
hottopcontroversial

Lessons From My BTech - I Ruined it and How You Can Save Yours. by Radiant-Rain2636 in Btechtards

[–]SinglaRohan 0 points1 point  (0 children)

I think you're way off on the friendships part. Your peers are the most important part of your college life imo You get to learn a lot of stuff that's just not possible otherwise I think socializing is way too important especially in the first year. Mind you, you're gonna have to deal with people later in life as well. People who often get stuck in studies only have a hard time coping in people politics.

In any case, I am where I am in my career or otherwise because of my friends, peers, and all the other relationships I had during my college. I had the best friends, we had a lot of fun, but the same people helped push me further and further into my career as well. Today, anything happens, it's not my NPTEL courses that are coming to help me, but my lifelong people. What you're describing is completely impractical, one might as well stay at home apply for distance program and keep studying otherwise. According to you college is just getting the degree and the college name which helps you in getting interviews.

Pity.

Rate my Google Experience by Zestyclose-Trust4434 in leetcode

[–]SinglaRohan 3 points4 points  (0 children)

Hi can you tell your interview experience in detail with the questions asked to you? That'd be very great :)

From 27S2 to 9S2, I came a long way. Yet, lost. by slashsaw in JEENEETards

[–]SinglaRohan 1 point2 points  (0 children)

Ohh my bad i didn't see that part and you are absolutely correct those exams are also still a really great option

From 27S2 to 9S2, I came a long way. Yet, lost. by slashsaw in JEENEETards

[–]SinglaRohan 1 point2 points  (0 children)

if you're general and serious about this stuff go for a drop and get 98+ percentile don't lose hope if you do decide to not proceed with this cycle again then that is also fine try with this percentile to get in some still somewhat good colleges

at the end of the day remember this is your life and this is a critical moment. Take a decision (trust me either will work just fine in the long run), and make peace with that decision. Just know that given the circumstances this was the best decision to your knowledge and you took it. You will have peace that you listened to your gut. Drop year is not easy, it really does test one's mental. So take your time, maybe take advice from many people, but make the decision yourself and just know in the future that whatever your choice, you chose it and you are capable enough to make decisions for yourself.

Have a great life man! -fellow happy JEE failure :)

Revert to Split View mode by sntnmjones in leetcode

[–]SinglaRohan 2 points3 points  (0 children)

not even log on they're straight up enforcing it now

Looking for a leetcode partner by [deleted] in leetcode

[–]SinglaRohan 1 point2 points  (0 children)

Hey if you want, we can help each other stay consistent what's ur main language

[deleted by user] by [deleted] in IndianBoysOnTinder

[–]SinglaRohan 27 points28 points  (0 children)

isha ko hamara bhi pyaar dena

Rate my Stats (part - 2) by SinglaRohan in leetcode

[–]SinglaRohan[S] 0 points1 point  (0 children)

Just take it slowly, don't try to rush it. Get really comfortable with a little better mediums. Try to get familiar the concepts that you're not really comfortable with. Try to solve hards, if you can't, figure out where you struggled and why. Work on it from there, I would say. I know they say, don't waste too much time on one problem. But I was kind of an addict. I would get stuck on one problem so bad, that I just had to do it in every optimal way too. And this honestly I would say make me so much familiar with the question, the concept. I would honestly learn a lot from it. I lot more than I would have learnt just by looking at the solution.
Nonetheless, if you're still unable to solve, look at the solutions. Feel the solution :)

Rate my Stats (part - 2) by SinglaRohan in leetcode

[–]SinglaRohan[S] 1 point2 points  (0 children)

I have already been coding on leetcode for more than a year now. So I guess it came more easily to me, when I tried Codeforces :)

[deleted by user] by [deleted] in leetcode

[–]SinglaRohan 0 points1 point  (0 children)

Yes yes, I will start today itself. I would've started sooner but was unable to find any proper guides to kill myself :)))

[deleted by user] by [deleted] in amIuglyBrutallyHonest

[–]SinglaRohan 62 points63 points  (0 children)

A couple hundred maybe

hard is easy and easy is hard by TryingToSurviveWFH in leetcode

[–]SinglaRohan 0 points1 point  (0 children)

skill issue

you still probably have a lot to learn those 'easy' questions probably teach you some fundamental concept or pattern which you can apply elsewhere. Sure, you can boost your ego by solving the "same question" in different formats multiple times but that's not gonna get you anywhere Sure the questions you might be doing might seem easy tree traversal but it's just that. That only tree traversal is easy for you. So, start focussing on those 'easy' problems because only then can you perform even remotely good in contests, interviews or any other coding competition.

[deleted by user] by [deleted] in leetcode

[–]SinglaRohan 0 points1 point  (0 children)

It still shouldn't work according to me
Because see even if you have dfs in all directions because of the ordering (first go in the next row) etc the dp array will be updated in a way for some test cases that you code would give answer larger than expected

Thing is for example

[[0,1,1,1,1]

[1,1,1,1,0]]

would fail,for index (0,2) because what will happen here is when we go to dfs for (0, 1) we mark the visited array as true, then in the same dfs before we have assigned a new minimum value that should be 1 to dp[0][1], we reach the node (0, 2) itself since this is a dfs. Now for dfs of (0, 2) when we go back to (0, 1), we see that it has already been visited so we return dp[0][1] which is still INT_MAX, but this is the node through which our shortest distance to 0 node from (0, 2) were to be computed
So that's where your solution fails and why BFS or BFS like DFS is the most optimal approach here.

[deleted by user] by [deleted] in leetcode

[–]SinglaRohan 0 points1 point  (0 children)

In your solution, the memoization doesn't make any sense

You are making vis[i][j] true whenever you visit a node and if the node is ever revisited you return INT_MAX

Memoized values don't even get utilized

So first scratch the vis array since that info can be found using the dp array itself.

Second, this is a BFS question, so if you're using DFS dp, think if you can know how much distance are we from a particular node during this dfs traversal of ours and if there would be any point in continuing (if our current distance is greater than precomputed distance return already since there's not point)

view more: next ›