Scribd Logo
Upload

Welcome to Scribd!

  • Problem Sleet Code

    Uploaded by

    Елизавета Баркарь
    15 views1 page
    This document discusses using hash maps to solve four problems: contains duplicates, valid anagram, two sums, and group anagrams. It notes hash maps can be used to check for duplicate elements, determine if two strings are anagrams by comparing their character counts, find pairs of elements that sum to a target value, and group anagrams by counting letter occurrences and grouping words with the same counts.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    ODT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses using hash maps to solve four problems: contains duplicates, valid anagram, two sums, and group anagrams. It notes hash maps can be used to check for duplicate elements, determine if two strings are anagrams by comparing their character counts, find pairs of elements that sum to a target value, and group anagrams by counting letter occurrences and grouping words with the same counts.

    Copyright:

    © All Rights Reserved
    Download as ODT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    15 views1 page

    Problem Sleet Code

    Uploaded by

    Елизавета Баркарь
    This document discusses using hash maps to solve four problems: contains duplicates, valid anagram, two sums, and group anagrams. It notes hash maps can be used to check for duplicate elements, determine if two strings are anagrams by comparing their character counts, find pairs of elements that sum to a target value, and group anagrams by counting letter occurrences and grouping words with the same counts.

    Copyright:

    © All Rights Reserved
    Download as ODT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Problem Algorithm

    Contains duplicates Hash map


    Valid anagram Hash maps
    Two sums Hash map
    Group anagram Count number of letter occurrences and group
    words by number of letters

    You might also like