LeetCode Notes logoLeetCode Notes

Remember how you solved it.

Write the idea, the approach and the mistakes beside every LeetCode problem. Review them before the interview.

Organized notesSorted by topic and difficulty, searchable by code.
Review queueFlag problems to revisit; they come back when it’s time.
Learning pathsBlind 75, LeetCode 150 and more, with your progress.
Now solvingSaved
Two Sum
Time
O(n)
Space
O(n)
Mistake · almost returned the same index twice when 2×nums[i] == target.

Works with the LeetCode Notes Chrome extension.

Create account

Start writing your notes.

Already have an account?

Sign in