PracHub
QuestionsLearningGuidesInterview Prep

Quick Overview

Count case-insensitive ASCII words in a paragraph and return deterministic frequency rankings. Tokenize maximal letter runs, normalize to lowercase, sort by descending count then ascending word, and handle punctuation, repeated delimiters, empty input, and very large text in one scan.

  • medium
  • Robinhood
  • Coding & Algorithms
  • Backend Engineer

Count and Rank Words in a Paragraph

Company: Robinhood

Role: Backend Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Quick Answer: Count case-insensitive ASCII words in a paragraph and return deterministic frequency rankings. Tokenize maximal letter runs, normalize to lowercase, sort by descending count then ascending word, and handle punctuation, repeated delimiters, empty input, and very large text in one scan.

Last updated: Jul 15, 2026
Loading…
PracHub

Master your tech interviews with 8,500+ real questions from top companies.

Product

  • Questions
  • Learning Tracks
  • Interview Guides
  • Resources
  • Premium
  • For Universities

Browse

  • By Company
  • By Role
  • By Category
  • Topic Hubs
  • SQL Questions
  • AI Coding Questions
  • Compare Platforms
  • Discord Community

Support

  • support@prachub.com
  • (916) 541-4762

Legal

  • Privacy Policy
  • Terms of Service
  • About Us

© 2026 PracHub. All rights reserved.

Related Coding Questions

  • Produce a Deterministic Course Plan - Robinhood (medium)
  • Build a Weekly Calendar - Robinhood (medium)
  • Solve path and inventory problems - Robinhood (medium)
  • Implement Calendar Layout and String Packing - Robinhood (medium)