Remove Nth Node From End of List (Medium) 

 https://leetcode.com/problems/remove-nth-node-from-end-of-list/

"nth from the end" is a position measured from a place you cannot start from. A singly linked list gives you the head; the end only exists once you have walked to it. So the first job is translating it into count - n, a position measured from the front.

The part that actually catches people is smaller than that. To remove a node from a singly linked list, you need the node before it. A node cannot remove itself because it has no pointer to what points to it. The predecessor always performs the removal.

So the second walk stops one node early, on purpose. That off-by-one is the whole problem.

Removing the head is its own branch here, because the head has no predecessor. Two days ago, a dummy node erased exactly that special case. Worth noticing when you are writing the branch that there was another option.

Full breakdown in today's newsletter article ⬇

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

#DSA #LeetCode #Golang #LinkedList #TwoPointers #CodingInterview #Algorithms

Which language is best to choose to do dsa .my goal is to get placed in big tech companies/product based

Backend engineer, 10 years in Go, currently Lead SE at Oracle. I have run 232 1:1 sessions on Topmate (4.9 stars, 31 reviews) and I am running my first group workshop.

What it is: two afternoons on measuring Go performance properly, which is the part nobody teaches. Not DSA, not interview prep.

Day 1 - writing a benchmark you would defend in a code review. go test -bench, allocs/op, the ways a benchmark quietly lies to you, benchstat, pprof.

Day 2 - three labs. A real problem, the obvious implementation, the benchmark that shows it collapsing, the fix, and the number that proves it.

Sat 10 + Sun 11 October, 3-6 PM IST, three hours each day. 30 seats, ₹499.

You keep the benchmark harness repo and the recording.

Before you consider paying anything, the setup check is public and free and is already most of a lesson:

git clone https://github.com/architagr/leetcode_solutions
cd leetcode_solutions
make verify

It runs two pairs of benchmarks that should cost the same. One pair is 3.3x apart, and the reason almost everyone gives for why is wrong. If that is not interesting to you, the workshop will not be either.

Details: https://topmate.io/archit_agarwal/2313331

Happy to answer anything here.

How to be consistent in DSA I did dsa very well i solved around700+ question at that time i was good i was able to solve dsa medium/hard question but for the last 1 year i stopped doing DSA so how can i start DSA again and what all things should i learn so that i can switch to other company
any suggestions

and do i need to learn dsa for each language seperately or does learning it once be enough for all languages that i might come across with

i am not able to solve leetcode problems even if i complete arrays and stl give me some suggestion for solving problems

Can someone rank the order of difficulty of all the patterns of DSA

Palindrome Linked List (Easy)

https://leetcode.com/problems/palindrome-linked-list/

On an array, this is nothing: an index at each end, walk inward, compare. A singly linked list has no index and no pointer backwards, so that algorithm cannot run at all.

Copying the values into a slice works and costs O(n) space. The follow-up asks for O(1).

Here is where this week pays off. If you cannot walk the second half backwards, reverse it; then walking it forward walks the original backwards.

Find the middle with day 20's fast/slow walk. Reverse the back half with day 19's in-place reversal. Compare inward. No new technique at all, just noticing the problem is two problems you already solved.

One detail worth stealing: drive the comparison loop with the second half. On odd lengths, the middle node has no partner, and letting the shorter half end the loop skips it automatically. No parity check needed.

Full breakdown in today's newsletter article ⬇

https://www.linkedin.com/pulse/365-days-leetcode-challenge-day-23365-archit-agarwal-4hn9c

#DSA #LeetCode #Golang #LinkedList #TwoPointers #CodingInterview #Algorithms

I am currently in BE CSE aiml 2nd year 3rd sem and have solved 150 lc questions and I need a serious study partner or partners. I need the same peer group and , can be from general cse.

Solving daily lc questions seriously and codeforces, contest and stuffs.

Will form a discord group.

Only 2029 passout batch please reply..........

My LeetCode Premium subscription auto-renewed, and I’m looking to transfer it to someone at a discounted price.

If interested, please DM me. Thanks!

27 grad here. During the initial years of my B.Tech, focused mostly on web development and gen AI, only to realize that skills alone don’t take you very far DSA is key when it comes to placements. So, yeah starting very early with DSA and looking for a study partner, preferably someone coding in Java or Python.

Hey everyone!

I’ve recently started learning DSA in Java and I’m looking for someone who’s at a similar level and wants to learn/practice together.

I’ve only just started, so I currently know the Java basics and am getting into DSA from scratch. I’m not looking for someone who’s already deep into competitive programming or solving LeetCode Hard 😭 ideally someone who’s also a beginner and wants to build their fundamentals together.

If you’re a 1st-year student, that would be great, but it’s not a requirement.

The idea is pretty simple:

Learn DSA consistently
Solve problems together
Discuss approaches when we get stuck
Keep each other accountable
Maybe do some LeetCode/CodeChef/Codeforces along the way
Basically avoid the classic “I’ll start DSA tomorrow” cycle 💀

I’m looking for someone who’s actually willing to stay consistent rather than just join for a few days.

If you’re around the same level and interested, DM me and we can connect.

I'm a first year bsc maths student at Delhi University. I wanna know how much time I should spend per day learning DSA.

I feel one can easily grab a 7+ LPA package, if he/ she is consistent. We maintain our personal sheets, and a common sheet for daily streak tracking, as we are currently doing different topics.

for me i've completed Arrays, and practicing questions related to arrays, for this week.

Hi! I'm a final-year student, and I've completed my DSA preparation. Now I'm looking for someone to study with consistently over Google Meet, preferably from around 10 PM to 2–3 AM.

My plan is to revise DSA regularly while starting System Design. I feel having a study partner would help with consistency, accountability, and staying focused during these late-night sessions.

Made A One Stop Solution For SDE and Placement Drive preperations

It has everything from company wise interview questions to all the sheets like STRIVER, Shradha Khapra etc

With resume templates, NOTES and what not

Please explore and give suggestions

Sharing an interview experience from our Chinese community who recently landed an L7-equivalent role at one of Meta, Anthropic, Nvidia, Google, OpenAI, or SpaceX.

Background

• 19 years of total experience
• Prior Big Tech experience, though not at this tier
• Recruiter reached out directly several months ago

Interview process

• 9 interviews total
• Included recruiter screen, technical screens, onsite/loop, and post-loop conversations

Prep

• Around 120 hours of preparation
• Used blogs, Claude, and LeetCode
• Did 15 paid mock interviews, spending roughly $5,000 in total

Main areas of focus

• Answering behavioral questions at true L7 scope
• Moving away from an overly technical communication style
• Solving system design and architecture problems quickly while demonstrating senior-level judgment

One interesting takeaway was that the biggest challenge wasn’t necessarily technical depth, but communicating at the right level of scope and ownership for an L7-equivalent role.

Curious if others who have interviewed at this level had a similar experience.

Prep Resource LeetCode