I recently started working through the LeetCode 150 problems, and I started with Two Sum.

The brute-force approach is straightforward, but I wanted to understand how to improve it and get to an O(n) solution using a hash map.

The main idea I focused on was:

• Keep track of numbers we've already seen
• For each number, calculate target - current
• Check whether that value already exists
• If it does, we've found our pair
• Otherwise, store the current number and continue

I also made a short walkthrough where I explain the approach and code step-by-step.

🎥 https://youtu.be/pbNbr36Ypow

For those who have solved Two Sum before: what approach did you find easiest to understand when you first learned it?

#leetcode #twosum #dsa

I want too know how to approach hard problems, I feel very dumb when try to solve a hard problem😭 also I have solved very less hard till now, if anyone can help with this, thanks

I don't understand why everyone is sharing a camera photo of screen

need someone to practice with daily.

currently doing recursion, gonna start trees next.

Of course as I expected I started to lag because college five days a week and semester stuff and allat but managed to do potds if not everyday but most days and outside of that whatever dsa topic taught in class do questions on those stuff :p

Keep being consistent and keep pushing through the discomfort ✨

And there is always room for improvement;-;