Practice Squarepoint Coding Question | Real Coding Interviews

Quick Summary

Count word frequencies in a text while treating uppercase and lowercase identically.
Group words by frequency, sorting groups from highest to lowest and words alphabetically within each group.
Select complete frequency groups until reaching a strict limit of three total words.

What This Tests

String parsing and normalization
Frequency counting with hash maps
Multi-level sorting and grouping
Constraint-driven selection logic

Common Patterns

Hashing

Sorting

A text analysis tool needs to report the most frequent words in a piece of text.

You are given a string text that contains English letters and spaces, where words are separated by spaces. Count every word in a case-insensitive way, then return the words that belong to the highest-frequency groups along with their frequency. You need to return an array that applies the rules below:

Test Cases

Input

Output

Expected