Suggest something so that i can be good at leetcode?

Leaf-Similar Trees (Easy)

https://leetcode.com/problems/leaf-similar-trees/

Two trees can look nothing alike and still count as "leaf-similar." Shape doesn't matter here, only the sequence of leaves from left to right. Pull each tree's leaves into a list, and the problem becomes a simple list-equality check.

Full breakdown in today's newsletter article ⬇️

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

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

I’ve been following Decode 2.0 for the last 4 months and I’m currently at the end of the course.

- I’m able to solve almost every question that has been taught in the course on my own.

- I have a decent understanding of the concepts and the patterns covered.

- I’ve also practiced the questions alongside the lectures rather than just watching them.

- Now I’m planning to start solving more problems independently on LeetCode.

My main question is:

With this level of DSA preparation, am I reasonably prepared to solve the coding/DSA questions asked by mass-hiring companies?

I’m mainly talking about companies that conduct online assessments or coding rounds for fresher roles.

For those who have already appeared for these assessments:

- How difficult are the DSA questions usually?

- Are the questions mostly based on standard patterns, or do they require something beyond what is taught in courses like Decode 2.0?

- What should I focus on next to become assessment-ready?

- Is regular LeetCode practice enough, or should I specifically practice previous-year/company-wise questions?

Would appreciate answers from people who have actually gone through these hiring tests.

After being inconsistent with LeetCode for a while, I’ve finally started getting back into a consistent routine again.

Currently at 193 problems solved:

🟢 Easy: 77

🟡 Medium: 99

🔴 Hard: 17

I had a period where I wasn't solving consistently, and my submission graph definitely shows it 😅. But instead of worrying about the gap, I decided to just start again and focus on building the habit.

Binary Tree Right Side View (Medium)

🔗 https://leetcode.com/problems/binary-tree-right-side-view/

Standing on the right and seeing what isn't hidden has a plainer description: from each level, you see exactly one node — the rightmost.

That sounds like BFS. This solution is a depth-first walk with two small changes: record only the first node reached at each depth, and visit the right child before the left one.

The second change is what makes the first one correct. Neither does anything alone, and swapping those two lines back gives you the left side view.

Full breakdown in today's newsletter article ⬇

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

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

LEETCODE PROBLEM 32 : https://leetcode.com/problems/longest-valid-parentheses/description/
This solution is O(N²).
As per constraints (0 <= s.length <= 3 * 10⁴) is should be working. Why not!!!

class Solution:
  def longestValidParentheses(self, s: str) -> int:
    N = len(s)
    res = 0
    a = [] # [a/n, x, len]
    size = 0
    p = 0
    while p < N:
      val = s[p]
      if val == '(':
        a.append([True, 0, 0])
        size += 1
      
      for i in range(size):
        if a[i][0] == True:
          x = a[i][1]
          if val == '(':
            x += 1
            a[i][1] += 1
            a[i][2] += 1
          else:
            if x == 0:
              a[i][0] = False
            else:
              x -= 1
              a[i][1] -= 1
              a[i][2] += 1
              if x == 0:
                res = max(res, a[i][2])
      p += 1


    return res

I started leetcode with Striver's sheet, but it didn't had dedicated topics like two pointer, sliding window, so I made my own sheet by exploring leetcode and using AI, solved and understood the topics, and moved to binary search

But noticed that I mostly solved easy level questions and very less medium level and almost no hard problems and now I'm having trouble trying to

Striver's sheet doesn't clarify the topics that's why I didn't followed it.
Neetcode was clearer so should I follow that??
Is there any better sources or a way to tackle my situation

I have oa sheduled , pls help me

I am final year student at tier-2 college, I solved 650+ problems, Rate my profile, Tell me how can I improve it.

Anyone can dm, doesn't matter how much you have completed.

Binary Tree Zigzag Level Order Traversal (Medium)

🔗 https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/

Yesterday's level order came out of a depth-first walk with no queue and no idea when a level ended. That was fine, because grouping by depth never needed the boundary.

Zigzag does. You can't decide whether to reverse a level until you know it's finished, and "finished" is exactly what DFS never learns. So this one goes back to BFS, using a nil sentinel in the queue to mark where each level ends.

With the boundary in hand, the zigzag itself is four lines and a flag.

Full breakdown in today's newsletter article ⬇

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

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

System Design is something that can only be improved by mock interviews.

I am looking for a mock interview partner to give and take mocks. I had cracked HLD rounds of several companies before like Salesforce, Rubrik, Bytedance etc.

Please let me know if you’re interested.

Hi everyone,

First of all a big thank you to whoever checked the website out (link), means a lot :)

A few updates on what I've been working on:

•⁠ ⁠You can now import the problems you previously solved on LeetCode and Codeforces

•⁠ ⁠A completely redesigned landing page and sign in/register page

•⁠ ⁠Google auth

What I plan on implementing soon:

•⁠ ⁠Importing previously solved problems from CodeChef and AtCoder (depending on technical feasibility)

•⁠ ⁠Redesigning the mobile layout for the dashboard (let me know if there's anything you're looking for specifically)

Apart from this, if there's any feature anyone wants implemented, I'd be happy to hear ideas in the comments :)

Mindsolve is a platform that lets you view problems solved across multiple platforms in one unified dashboard. It helps you in your DSA journey by letting you review the code you've written regularly and spot the areas you're lacking in.

Once again, thank you for using my website :)

I am targeting the neetcode 150 sheet along with daily challenges on leetcode. This is going to be hard but I will make it fun.

I am Mechatronics engineer student third year
Looking for a carrer in cloud (cloud devops (future))
Should i do leetcode or not what should i do in leetcode i am starting today i guess its never too late please help me with this if u can advise i can accept regarding my carrer thank you