HackerRank - Making Anagrams | Full Solution with Simplified Examples and Visuals | Study Algorithms
Two Strings are said to be anagrams if they have the exact same characters and their frequency. In this problem you are given two strings, and you need to determine the minimum number of characters to be deleted, so that they become anagrams. Watch the video to understand the problem correctly and work with me to find an efficient solution. All along with visuals and explanations.
Chapters:
00:00 - Intro
00:58 - Problem statement and description
02:58 - Brute Force Solution
05:03 - Efficient Solution
09:20 - Dry-run of code
11:28 - Final Thoughts
📚 Links to topics I talk about in the video:
Brute Force Solution: • Brute Force algorithms with real life...
Determine valid anagrams: • Determine if two strings/phrases are ...
What is Big O?: • Big O Notation Simplified to the MAX ...
Time Complexity of an Algorithm: • What is the Time Complexity of an Alg...
📘 A text based explanation is available at: https://studyalgorithms.com/string/ha...
Code on Github: https://github.com/nikoo28/java-solut...
Test-cases on Github: https://github.com/nikoo28/java-solut...
📖 Reference Books:
Starting Learn to Code: https://amzn.to/36pU0JO
Favorite book to understand algorithms: https://amzn.to/39w3YLS
Favorite book for data structures: https://amzn.to/3oAVBTk
Get started for interview preparation: https://amzn.to/39ysbkJ
🔗 To see more videos like this, you can show your support on: https://www.buymeacoffee.com/studyalg...
🎥 My Recording Gear:
Recording Light: https://amzn.to/3pAqh8O
Microphone: https://amzn.to/2MCX7qU
Recording Camera: https://amzn.to/3alg9Ky
Tablet to sketch and draw: https://amzn.to/3pM6Bi4
Surface Pen: https://amzn.to/3pv6tTs
Laptop to edit videos: https://amzn.to/2LYpMqn
💻 Get Social 💻
Follow on Facebook at: / studyalgos
Follow on Twitter at: / studyalgorithms
Follow on Tumblr at: / studyalgos
Subscribe to RSS feeds: https://studyalgorithms.com/feed/
Join fan mail: http://eepurl.com/g9Dadv
#hackerrank #programming #interview