Strings making anagrams hackerrank solution

Published: 09 August 2020
on channel: Kuldip Ghotane

3,425

In this video I have discussed String : making anagram solution from hackerrank preparation kit playlist.

Naive approach -- transverse first string and check the element exist in second string or not and we will calculate how many characters which do not make pairs

Optimized approach : we can create character frequency array (mapping char and freq value) and we can check the absolute difference for all 26 characters in two frequency array( first string ,second string )

if you are trying to solve all the problems from hackerrank interview preparation kit playlist and getting stuck anywhere or looking for optimized solution do check my playlist
• Hackerrank Interview Preparation Kit

0:00 Start
0:32 Problem Definition
2:30 Naive approach with example
5:45 Optimized approach
11:15 Writing code

On this page of the site you can watch the video online Strings making anagrams hackerrank solution with a duration of hours minute second in good quality, which was uploaded by the user Kuldip Ghotane 09 August 2020, share the link with friends and acquaintances, this video has already been watched 3,425 times on youtube and it was liked by 45 viewers. Enjoy your viewing!

72,462

2.3K