Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Hashing

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Hashing

Word Frequency Top-K

intermediatelayer B3 · Hashing5 tests

Given a block of text and an integer k, return the k most frequent words, most frequent first.

  • A word is a maximal run of letters. Everything else (spaces, punctuation, digits, newlines) is a separator
  • Comparison is case-insensitive, and words are returned lowercased
  • Ordering: higher frequency first; words with the same frequency are ordered alphabetically
  • If the text has fewer than k distinct words, return all of them

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen