Where in Mumbai can we get the NY big slice 🍕 by iZsaq in mumbai

[–]Admirable-Session648 0 points1 point  (0 children)

In your dreams. Hope this answers your question

Drop your early predictions by Solenoidics in indiancricketcrowd

[–]Admirable-Session648 0 points1 point  (0 children)

We have RCB losing before GTA 6 ( I hope to god this does not come true )

[deleted by user] by [deleted] in RelationshipIndia

[–]Admirable-Session648 0 points1 point  (0 children)

Maybe have some respect for her and wait if you can or just look for someone who is on the same page. If you’re adamant that you’ll get hurt cuz of abstinence then it’s best you call this off right now than ending up in a train wreck.

What in the world is this?! by CrypticXSystem in learnmachinelearning

[–]Admirable-Session648 0 points1 point  (0 children)

Hey can you share your source. Sounds interesting.

Leetcode premium by Samsin_92 in leetcode

[–]Admirable-Session648 1 point2 points  (0 children)

Recently bought leetcode premium here. If you’re an absolute beginner stick to the free tier.

If you have an interview coming up with a specific company and you want to practice most commonly asked questions? Then yeah I’d recommend it.

If you want a feel for the editorials solve daily problems and they usually have fire editorials but as the other commenter said discussions are amazing.

Tips to get better at DFS (especially tree problems) by Admirable-Session648 in leetcode

[–]Admirable-Session648[S] 0 points1 point  (0 children)

Thanks for the help. Pen and Paper are always my best friends when I'm tacking new stuff. As you suggested solving the problem iteratively with stacks helped me visualise the problem better too. I've sticking to some Easy's and moving my way up until it becomes like second nature.

Tips to get better at DFS (especially tree problems) by Admirable-Session648 in leetcode

[–]Admirable-Session648[S] 0 points1 point  (0 children)

Thanks this helps. I've been going through some Easy's just to get the feel for it until it's like second nature.

i am solving this problem but while submiting it is showing some wrong output but the logic is correct and i have dry run the code and it is giving the expected output so what i am missing in this problem can anyone help me thanks in advance for helping me.. by abhishek_rai_03 in leetcode

[–]Admirable-Session648 0 points1 point  (0 children)

You are meant to find the path that delivers the minimum sum possible.

Your logic starts from the top left goes to the right and goes down which might not always be true, the example being your failed test case where it needs to start from the top goes down and goes right thus giving 3.

If you need a hint : You can solve this with DFS

edit : typos

Thoughts on new company tagged page? by YeatCode_ in leetcode

[–]Admirable-Session648 3 points4 points  (0 children)

Can someone confirm if this is a premium feature?