JobsJob TrackerJob alerts

Boomerang ยท 8 questions

All 8Coding 6System Design 1Low-Level Design 1
  • Modify boolean matrix for rows and columns of onesCoding
  • Check if a binary tree is a BSTCoding
  • Count words in a file without standard tokenizersCoding
  • Minimum number in a sliding window of size wCoding
  • Check related elements across set streamsCoding
  • Design e-commerce category hierarchy databaseSystem Design
  • Minimum platforms needed for bus schedulesCoding
  • AWS machine setup with Erlang and Web ServerLow-Level Design
โ† Boomerang questions
  1. Interview questions
  2. Boomerang
  3. Count words in a file without standard tokenizers
Coding

Count words in a file without standard tokenizers

Filed under Boomerang

The question

Write a program to count the number of words in a file without using any standard tokenizing APIs.

No write-up yet. Related questions below have one.

Related Boomerang questions

  • Modify boolean matrix for rows and columns of ones
  • Minimum number in a sliding window of size w
  • Check related elements across set streams
  • Minimum platforms needed for bus schedules
โ† Check if a binary tree is a BSTMinimum number in a sliding window of size w โ†’

Collected from public candidate posts and coding forums. Updated Nov 2026.