To see more videos like this, you can buy me a coffee: [ Ссылка ]
You are given an array of integers that have some values that appear twice and others appear once. Return a list of all the duplicate elements. Watch this video to learn 3 methods of solving this question. A Brute Force method, using a Hash-set with extra space and a trick to where you do not need any extra space. The biggest hint is that all the elements of the array are greater than equal to 1 and less than equal to the length of the array. Learn with great animations and visuals of what happens behind the scenes.
00:00 - Intro
01:19 - Problem Statement and description
03:24 - Method 1: Using HashSet
06:07 - Method 2: Without Extra Space
12:25 - Dry-run of Code
14:53 - Final Thoughts
📚 Links to topics I talk about in the video:
Brute Force Algorithm: [ Ссылка ]
Time Complexity of an Algorithm: [ Ссылка ]
Actual problem on LeetCode: [ Ссылка ]
📘 A text based explanation is available at: [ Ссылка ]
Code on Github: [ Ссылка ]
Test-cases on Github: [ Ссылка ]
📖 Reference Books:
Starting Learn to Code: [ Ссылка ]
Favorite book to learn algorithms: [ Ссылка ]
Favorite book for data structures: [ Ссылка ]
Get started for interview preparation: [ Ссылка ]
🔗 To see more videos like this, you can show your support on: [ Ссылка ]
🎥 My Recording Gear:
Recording Light: [ Ссылка ]
Microphone: [ Ссылка ]
Recording Camera: [ Ссылка ]
Tablet to sketch and draw: [ Ссылка ]
💻 Get Social 💻
Follow on Facebook at: [ Ссылка ]
Follow on Twitter at: [ Ссылка ]
Follow on Tumblr at: [ Ссылка ]
Subscribe to RSS feeds: [ Ссылка ]
Join fan mail: [ Ссылка ]
#leetcode #programming #interview
