algorithmz 0.8.9

This is the corresponding implemenation of the python module of the same name.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

/// Group Anagrams
///
/// Given an array of strings, group anagrams together. Anagrams are words that contain the same letters in a different order.
///
/// # Examples
///
/// Basic usage:
/// ```
/// let result = algorithmz::string::group_anagrams(vec!["eat".to_string(), "tea".to_string()]);
/// assert_eq!(result, vec![vec!["eat".to_string(), "tea".to_string()]]);
/// ```
pub fn group_anagrams(strings: Vec<String>) -> Vec<Vec<String>> {
    let mut map: std::collections::HashMap<String, Vec<String>> = std::collections::HashMap::new();

    for word in strings {
        let mut chars: Vec<char> = word.chars().collect();
        chars.sort();
        let key: String = chars.into_iter().collect();

        map.entry(key).or_default().push(word);
    }

    map.into_values().collect()
}