Company: COGNIZANT

On a popular discussion platform, some users with harmful intentions use anagram-based methods to hide certain banned terms. An anagram is a word or phrase created by rearranging the letters of another word or phrase, using all the original letters exactly once. Implement a function to identify and group anagrams within the network's data log to detect these concealment attempts.

Write a Python function named groupAnagrams that takes a list of words (network log entries) as input and groups them into sets of anagrams.

Example: word_list = ['debitcard', 'badcred[s', 'cat', 'tac', 'act']

After grouping the anagrams, return [['debitcard', 'badcredit'], ['cat', 'tac', 'act']]. The provided code sorts the results and prints [['act', 'cat', 'tac'], ['badcredit', 'debitcard']].

Function Description: Complete the function group_anagrams in the editor with the following parameter(s): string words_list[n]: a list of words to group

Constraints: Each word_list[i] consists only of characters in the range ascii[a-z].

Input Format For Custom Testing:

Sample Case 0

Sample Input For Custom Testing:
2
act kitchen ran cat
listen silent enlist heart earth hater
good dog

Sample Output:
[['act', 'cat'], ['kitchen'], ['ran']]
[['dog'], ['good'], ['earth', 'hater', 'heart'], ['enlist', 'listen', 'silent']]

Explanation: Words that are anagrams are grouped into lists, e.g., 'act' and 'cat' in the first list of words. Note that 'dog' and 'good' do not have anagrams.

Sample Case 1

Sample Input For Custom Testing Show More

Stemming is the process of extracting the base word from a word. For instance, the base for "worked" is "work". Use the following algorithm to stem a word: 1. If the word ends in 'ed', 'ly', or 'ing', remove the suffix. 2. If the resulting word is longer than 8 letters, keep the first 8 letters. Implement a function that takes a string of space-separated words and returns its stemmed counterpart.


Example: text = 'an extremely dangerous dog is barking'

'an' does not end in one of the suffixes and is less than 8 letters. 'extremely' is 'extreme' after removing the suffix. 'extreme' is less than 8 letters. 'dangerous' is 9 letters long, so reduce it to 8 letters: 'dangerou'. 'dog' and 'is' are unchanged. 'barking' is 'bark' after removing the suffix, and is. Return 'an extreme dangerou dog is bark'.

Function Description: Complete the function stemmer in the editor below.

stemmer has the following parameter(s): string text: the input text

Returns: string: the input text with each of the words replaced by its stem

Constraints: Every character in text is either an English lowercase letter or a space character. text starts and ends with a letter. No two consecutive characters are spaces. text contains at most 100 words. No word is longer than 18 letters.

Function Input Format Format for Custom Testing

Sample Case 0

Sample Input 0

STDIN Show More

A substring is a group of contiguous characters in a string. For instance, all substrings of abc are [a, b, c, ab, bc, abc].

Given a binary representation of a number, determine the total number of substrings present that match the following conditions:

1. The 0s and 1s are grouped consecutively (e.g., 01, 10, 0011, 1100, 000111, etc.).
2. The number of 0s in the substring is equal to the n umber of 1s in the substring.

Example:
s = 001101

The 4 substrings matching the two conditions include [0011, 01, 10, 01]. Note that 01 appears twice, from indices 1-2 and 4-5. There are other substrings, e.g., 001 and 011 that match the first condition but not the second.

Function Description:
Complete the function `counting` in the editor below.

counting has the following parameter(s):
string s: a string representation of a binary integer Show More