Freshworks, the Chennai-born global SaaS company, runs technical rounds that favour clean, practical data-structures and algorithms over exotic tricks.
In 2026 expect problems framed around product data: single-pass per-account aggregation over a large stream with bounded memory, prefix-based autocomplete or ticket search, and traversal of nested comment threads with cycle detection. Interviewers want correct code, sensible data-structure choices (hashing, tries, BFS or DFS), and a clear complexity analysis. Cleanliness and clarity matter as much as raw cleverness.
About Freshworks
SaaS company building cloud-based customer-experience and IT-service-management software.
Online coding assessment
Technical coding round one on DSA
Technical coding round two plus low-level design
Hiring-manager round, then offer
Round 1 (60-90 min)
online assessment with DSA problems.
Round 2 (60 min)
live coding on hashing, tries, or traversal problems.
Round 3 (60 min)
harder coding plus low-level design with complexity discussion.
Sourced from 2+ candidate post-mortems. Hit Practice to answer any one with AI voice feedback.
2 more questions. Sign up to unlock all
Sign up free: unlock all questionsThe typical Freshworks recruitment process has 4 stages: Online coding assessment → Technical coding round one on DSA → Technical coding round two plus low-level design → Hiring-manager round, then offer.
Freshworks typically conducts 3 interview rounds: Round 1 (60-90 min): online assessment with DSA problems.; Round 2 (60 min): live coding on hashing, tries, or traversal problems.; Round 3 (60 min): harder coding plus low-level design with complexity discussion..
HireStepX recommends the Practical DSA framework for this type of interview: Pick the simplest data structure that fits (hash map, trie, queue), implement it cleanly, and defend the time and space complexity out loud
To answer this question well, HireStepX recommends the Practical DSA approach: Pick the simplest data structure that fits (hash map, trie, queue), implement it cleanly, and defend the time and space complexity out loud Ground your answer in a specific real example from your own experience.
To answer this question well, HireStepX recommends the Practical DSA approach: Pick the simplest data structure that fits (hash map, trie, queue), implement it cleanly, and defend the time and space complexity out loud Ground your answer in a specific real example from your own experience.
To answer this question well, HireStepX recommends the Practical DSA approach: Pick the simplest data structure that fits (hash map, trie, queue), implement it cleanly, and defend the time and space complexity out loud Ground your answer in a specific real example from your own experience.
To answer this question well, HireStepX recommends the Practical DSA approach: Pick the simplest data structure that fits (hash map, trie, queue), implement it cleanly, and defend the time and space complexity out loud Ground your answer in a specific real example from your own experience.
To answer this question well, HireStepX recommends the Practical DSA approach: Pick the simplest data structure that fits (hash map, trie, queue), implement it cleanly, and defend the time and space complexity out loud Ground your answer in a specific real example from your own experience.