Data Structures and Algorithms

Implementing a groupAnagrams function that takes an array of strings as input and returns another array with anagrams grouped together

Implementing a twoSums(nums, targetValue) function that returns the indices of two elements in nums which could be summed up to the targetValue

Implementing an isAnagram function that returns true if its two input strings are anagrams and false otherwise

Implementing a containsDuplicate function that returns true if there are duplicate elements present in the array and false otherwise

Rabin-Karp Substring Search is an efficient algorithm to search a string within another string

Understanding basic data structures like arrays, strings, and hashmaps

The time complexity metric is used to assess an algorithm's performance on scale