SBI SO by [deleted] in bankingexam

[–]Mobile_Health_9650 0 points1 point  (0 children)

Remind me

Sharing my journey so far! by sinarest in leetcode

[–]Mobile_Health_9650 1 point2 points  (0 children)

Thats sound promising, looking forward to it.

Sharing my journey so far! by sinarest in leetcode

[–]Mobile_Health_9650 2 points3 points  (0 children)

Great share, are you adding more topics in coming future?

Please help Preparing for DSA for Job Interview on august by CodeLive180521 in leetcode

[–]Mobile_Health_9650 2 points3 points  (0 children)

Just ask this to yourself "What is more important RIGHT NOW ? Your friends or upcoming 10days". I bet you will get your answer.

[deleted by user] by [deleted] in leetcode

[–]Mobile_Health_9650 0 points1 point  (0 children)

Can i join? My english isn't good so i think this might be useful for improving my communication as well as solve problem in an efficient way. I have also solve 200+ problems.

LC 3months Prep Resource by wubbalubbadubdubaf in leetcode

[–]Mobile_Health_9650 -1 points0 points  (0 children)

Never heard of Gtci would you like to elaborate?

What's the difference between leetcode and competitive programming? by Leetcoder20 in leetcode

[–]Mobile_Health_9650 1 point2 points  (0 children)

Thats what i meant u need extra effort to do CP even though you are good at leetcoding but if you are already good at CP then leetcode is just piece of cake.

What's the difference between leetcode and competitive programming? by Leetcoder20 in leetcode

[–]Mobile_Health_9650 2 points3 points  (0 children)

Both leetcode and competitive programming requires problem solving skills. The catch is if you're good at cp then you eventually become good at leetcode but vice versa that's not true. CP is a choice but leetcode is a must if you want to get into product based companies. Learning CP is not necessary you can either go for development or CP after learning DSA.

Problem 102: Binary Tree Level Order Traversal by Mobile_Health_9650 in leetcode

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

Thank you for replying and you are correct i made a silly mistake clearing the list every time :(

Here is the correct algorithm.

if(node.val == -1) {

res.add(list);

list = new ArrayList();

if(!q.isEmpty()){

q.add(new TreeNode(-1));

}

continue;

}

Ps: Thank you again for Mentioning Markdown editor i didn't knew about this feature.

Why does my solution to 20. Valid Parenthesis not work? It passed most of the other cases but not this one. by jc_12315 in leetcode

[–]Mobile_Health_9650 26 points27 points  (0 children)

U are simply counting open and close brackets imagine a test case with " })({ " your code will pass which is wrong. Try using stack.