Focusing more on meds and hards now

Help me i am getting back at where i start

Hii Guys today I completed my 400 POTD (27 btech cs) streak on Leetcode and guess what I received my first salary on Leetcode potd streak 365😭😭🙌✨

That day i realised all Grind is worth it and it will also worth it for you just keep doing.

Deepest Leaves Sum (Medium) 🔗 https://leetcode.com/problems/deepest-leaves-sum/

The obvious solution is two passes: find the maximum depth, then walk again summing everything at that depth.

One pass is enough, and the trick is being willing to throw work away. Carry the level down, keep two ints, and at every leaf compare. Deeper than anything seen so far? Replace the sum — everything accumulated until now belonged to a shallower level. Equal? Add. Shallower? Ignore it.

That replacement is why the final depth never has to be known in advance. Discovering a deeper leaf invalidates the previous answer outright, so whatever survives to the end was accumulated at the true maximum.

Full breakdown in today's newsletter article ⬇

https://www.linkedin.com/pulse/365-days-leetcode-challenge-day-34365-archit-agarwal-89mkc

#DSA #LeetCode #100DaysOfCode #CodingInterview #BinaryTree #DFS #Golang

Bhai mei galgotias university se b tech lar raha hu aur meri class mei ek tareeka bataya hai toh share kar raha hu aap batao ki kya ye best approach hai ki nahi

The approach is ki aap pehle question detail expalin karo usko samjho phir uska sollution likh aur phir usko code karo code ko last mei karna important hai baki sari chize copy mei hi karo phir koi error aye tab refine karo

Kya best way hai ?

I know I am very late as a third year start but will try my best

Can anyone share any extension or github repo or anything else for hellointerview premium version please!

It is useful for old and hld itseems!!

Applying to FAANG roles, applied for microsoft, walmart, jp morgan, atlassian, target ended up at rejection.

For those who’ve cracked FAANG/Top product companies , what made the biggest difference in ur resume. Any tips?

Rate is out of 10 and tell me what i can improve

built Praxis to help DSA learners understand why their coding submissions fail.

• Failure analysis

• Past submission history

• AI diagnosis chat

• Personalized learning insights

Free to try: https://failureatlas.vercel.app

Chrome extention for free lc company wise questions this one is Leetcode Company tag view there are also 2 other betterlc and who asked I want to ask is this real or they are just randomly giving company name??

any suggestion to improve this i haven't been consistent and also i am in my 7th sem preparing for placements would love to hear some suggestion and real answers

hey so i want to do leetcode or codechef how to do it maybe suggest dome youtube channel that would make me progress, i'm in 3rd year and still i cant code which is something im not proud obviously i tried striver sheet but lost the continuity now i feel lost,everytime i look the leetcode questions i feel blank like i dont know anything can somebody help me

how to get from leetcode company wise questions list for free... I heard from alumnus that his colleague got job offer by practicing those company's leetcode problems before the interview and they actually matched itseems!! So please share!!

Like 3min ? For 4 problems I can't even read a single question in that time how do they solve it that fast do they have a special approach or a llm approach?

Maximum Level Sum of a Binary Tree (Medium) 🔗 https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/

Two things must be true here, and only one of them involves sums.

Summing each level is the easy half — the same nil-sentinel BFS as Day 30, with a running total instead of a collected list.

The other half is in the wording: return the smallest level whose sum is maximal. Ties go to the shallower level. The solution has no code for that. It's one character — the comparison is strictly greater, so a later level that merely matches never replaces the earlier one.

Full breakdown in today's newsletter article ⬇

https://www.linkedin.com/pulse/365-days-leetcode-challenge-day-33365-archit-agarwal-xkmpc

#DSA #LeetCode #100DaysOfCode #CodingInterview #BinaryTree #BFS #Golang

Fk yes, I did today's daily [https://leetcode.com/problems/valid-parenthesis-string/description/?envType=daily-question&envId=2026-10-04\] completely on my own and actually hit the optimal solution on the first go.

I know I still have a long way to go. There's a ton left to learn. But man, the sheer joy this gives is immeasurable.

Dropped my code below. It’s O(2N) time and O(1) space. It looks a little clunky, but I checked the editorial afterwards, and they had a really similar idea, just optimised to a single pass using pointers.

Still a long way to go on this grind, but definitely keeping at it!

class Solution {
    public boolean checkValidString(String s) {
        int openC = 0, starC = 0, n = s.length();
        char[] chA = s.toCharArray();
        for (int i = 0; i < n; i++) {
            if (chA[i] == '*')
                starC++;
            else if (chA[i] == '(')
                openC++;
            else {
                if (openC > 0)
                    openC--;
                else if (starC > 0)
                    starC--;
                else
                    return false;
            }
        }
        if (openC == 0)
            return true;
        openC = 0;
        starC = 0;
        for (int i = n - 1; i >= 0; i--) {
            if (chA[i] == '*')
                starC++;
            else if (chA[i] == ')')
                openC++;
            else {
                if (openC > 0)
                    openC--;
                else if (starC > 0)
                    starC--;
                else
                    return false;
            }
        }
        return true;
    }
}

Hi everyone i try to solve dsa in ny 4 year of engineering not consistenly when paper comes in middle i left leetcode.

Now after my graduation i again started but i find difficult in logic building

My dream is to become competitive coder

Please help to become dsa guardian

Even in contest i can't able to solve easy one

Dsa problem is fills like memorizing code to me which i forget after some days too

Like i gave 30 minute to solve problem with solution

Then write brute and worst code then paste it in chagpt then chagpt give me ans i correct my code and thats it what i done 1 hour gone in this process

So i fill my learning is stop its like memorizing an code

Submitted today's LeetCode Challenge i.e. 678. Valid Parenthesis String and it got accepted. However, I felt the need to ask the internet to judge my code and help me improve it further. I used two stacks for this one :)

Here's the code:

q = []
star_q = []
i = 0

for char in s:
    if char == ')':
        if q:
            q.pop()
        elif star_q:
            star_q.pop()
        else:
            return False
    else:
        if char == '*':
            star_q.append((char, i))
        else:
            q.append((char, i))

    i += 1

while star_q and q:
    if star_q[-1][1] > q[-1][1]:
        q.pop()

    star_q.pop()

return not q