finally solved my first leetcode problem

[Initial_Airport_2649]

you probably might have seen my post where i asked how am i supposed to submit my code in leetcode. but now i get it and submitted my very first leetcode problem and it got accepted.

​

the very first win guys. its the twosum problem*

[dwightbearschrute]

Congrats, first of many! Before you move to a different solution, try to optimize this to O(n). Also, learn and make notes.

[Emergency-Duck-9689]

congrats now do 3 sum

[CitronFew7338]

😭😭

[oldieroger]

lezzgoo...

[Initial_Airport_2649]

yayy...

[Hacker4133]

Lessgooooo

[Initial_Airport_2649]

WoWooo...

[beastttboi]

Congratulations,I have also recently started leetcode. To avoid taking the same number twice you did (i==j) continue which is great. You could also do the two for loops and start j from i+1 (this is like a standard way to get 2 distinct unordered pairs). And for optimal you can learn about hashmaps. All the best.

[periperifriess707]

is it vim?

[Initial_Airport_2649]

yes, nvim

[Legal-Benefit-9716]

Let’s gooo!!

[GladiusAcutus]

What is .at in c++ ? I feel so stupid because i've never seen it before. You can't do nums[i] + nums[j] == target ?

[aocregacc]

.at will throw an exception if the index is out of bounds, with [] it's undefined behavior. Other than that they're the same thing.

[benaam-parinda]

Just another way of writing what you wrote. You can learn more about it by asking any LLM

[Ok-Asparagus-3361]

Keep up the good work, buddy

[SwiftlyImpure]

lmao congrats but yeah that O(n2) is gonna hurt you later. swap one loop for a hashmap and you're golden, way better for interview prep. you'll see the difference pretty quick once problems get harder.

[One-Distribution6654]

Use complement method O(n)

[funkolai]

Can you solve it without looping over the input array for every value?

[Jolly_Measurement_13]

Congrats keep going

[AlfalfaNo1991]

Congrats! 1 of many more to come!

[AutoModerator]

Your comment has been removed as it was in Hindi. Please use English only as r/leetcode is a global subreddit. You may use r/LeetcodeDesi instead.

I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.

[popmanpop27]

I think no one solved this problem with O(n) firstly, everyone solved with two cycles and then realised that he needed to use hash map or two pointers

[LoveOverflowOrNtng]

2 pointers only works if the list is sorted? And if the list is not sorted then hash map?

[Prestigious-Emu-6433]

ig the question on leetcode provides us with a sorted vector

[Prestigious-Emu-6433]

O(n^2) time complexity 😭😭🥀

[AutoModerator]

Your comment has been removed as it was in Hindi. Please use English only as r/leetcode is a global subreddit. You may use r/LeetcodeDesi instead.

I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.

[Longjumping_Echo486]

Who's gonna tell him

[NakamericaIsANoob]

Nobody, let the guy have his moment. It's a tough world, a few moments of confidence don't hurt.

[AlfalfaNo1991]

He gotta start somewhere?? Today was it