← F5 Interview Insights

F5·Mobile Engineer·Online Assessment (OA)·Intermediate

Intermediate
Jun 2026

Summary

F5 Networks OA for a Mobile Engineer role, one coding problem, 40 minutes. Pretty focused scope but the problem had enough moving parts to keep you on your toes.

Questions Asked (1)

Q1

You're given two arrays of length n: one with tweet content as strings, and one with publication timestamps as integers. You also receive a currentTime and a timeWindow. Find the top 3 most popular hashtags among tweets published within the interval [currentTime - timeWindow, currentTime].

Algorithms & Data Structures
Author's notes

First instinct was to just filter by time and then parse hashtags out of each tweet string.

Create a free account to read the full note

AI HintsAI Generated

Suggested Approach

First, filter tweets by timestamp within the given window, then extract and count hashtags from the filtered tweets. Finally, return the top 3 hashtags by frequency, handling ties and edge cases appropriately.

Pro tip: Clarify assumptions upfront: ask about tie-breaking rules, case sensitivity, and whether hashtags can contain special characters. This shows attention to detail and avoids incorrect assumptions.

1. Clarify requirements and edge cases

Ask about tie-breaking, case sensitivity, hashtag definition, and what to return if fewer than 3 hashtags exist. This ensures alignment with the interviewer.

2. Filter tweets by time window

Iterate through the timestamps and select tweets where timestamp is between currentTime - timeWindow and currentTime, inclusive.

3. Extract and count hashtags

For each filtered tweet, parse the content to extract hashtags (e.g., words starting with '#') and increment their counts in a hash map.

4. Find top 3 hashtags

Use a min-heap of size 3 or sort the counts to retrieve the top 3 most frequent hashtags, applying tie-breaking rules if specified.

5. Return result and analyze complexity

Return the top 3 hashtags and state the time and space complexity (e.g., O(n + m log 3) where m is number of unique hashtags).

Key Points to Mention

  • Time complexity: O(n) to filter and count, plus O(m log 3) for top-k selection, where n is number of tweets and m is unique hashtags.
  • Space complexity: O(m) for the hash map, which is optimal.
  • Edge cases: empty arrays, no tweets in window, fewer than 3 hashtags, ties in frequency.
  • Hashtag extraction: consider regex or splitting on whitespace and checking for '#' prefix; handle punctuation.
  • Tie-breaking: if not specified, mention that you would assume any order or ask for clarification.
  • Scalability: for large n, consider streaming or distributed counting if needed.

AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.