FreshWorks coding interview
questions, leaked.
9 problems reported across recent FreshWorks interviews. Top patterns: array, hash table, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
FreshWorks interviews are lean but dense. Nine problems reported across their OA, and four of them are easy, so you can't coast. Arrays and hash tables dominate the list, with strings and backtracking filling gaps. You're looking at the classic LeetCode medium tier: Longest Substring Without Repeating Characters, Two Sum, Find Minimum in Rotated Sorted Array, LRU Cache. No hard problems reported, but the mediums are interview staples and the time crunch is real. Study the array and hash-table patterns first, then drill the backtracking ones. If you blank mid-OA, StealthCoder runs invisible during screen share and surfaces a working solution in seconds.
Top problems at FreshWorks
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Longest Substring Without Repeating Characters | MEDIUM | 100.0 | 37% | Hash Table · String · Sliding Window |
| 02 | Two Sum | EASY | 100.0 | 56% | Array · Hash Table |
| 03 | Valid Parentheses | EASY | 100.0 | 42% | String · Stack |
| 04 | Best Time to Buy and Sell Stock | EASY | 87.8 | 55% | Array · Dynamic Programming |
| 05 | Find Minimum in Rotated Sorted Array | MEDIUM | 87.8 | 53% | Array · Binary Search |
| 06 | Letter Combinations of a Phone Number | MEDIUM | 87.8 | 64% | Hash Table · String · Backtracking |
| 07 | Maximum Product of Three Numbers | EASY | 87.8 | 45% | Array · Math · Sorting |
| 08 | LRU Cache | MEDIUM | 87.8 | 45% | Hash Table · Linked List · Design |
| 09 | Word Search | MEDIUM | 87.8 | 45% | Array · String · Backtracking |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual FreshWorks OA. The proctor cannot see it. Screen share cannot detect it. Made by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too.
Get StealthCoder- array5 · 56%
- hash table4 · 44%
- string4 · 44%
- backtracking2 · 22%
- sliding window1 · 11%
- dynamic programming1 · 11%
- binary search1 · 11%
- stack1 · 11%
- math1 · 11%
- sorting1 · 11%
The distribution leans heavy on arrays (five problems) and hash tables (four), so your preparation should front-load those two topics. Strings appear four times but usually paired with hash tables or backtracking, so you're not learning string manipulation in isolation. Backtracking shows up twice (Letter Combinations, Word Search) and those are medium difficulty, so they're gating problems. The one hard problem is missing from reports, which means either it's rare or nobody reports it. Four easy problems is unusual for a tech OA, so you can build confidence fast. Difficulty is skewed easy-to-medium overall, which means the mediums will carry your performance. Practice Two Sum and Maximum Product of Three Numbers as warm-ups, then spend time on LRU Cache and the two backtracking problems. If you hit a wall on Word Search or Letter Combinations live, StealthCoder is your hedge for the pattern you didn't have time to internalize.
Companies with similar patterns
If you prepped for FreshWorks, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass FreshWorks.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too. Works on HackerRank, CodeSignal, CoderPad, and Karat.
FreshWorks interview FAQ
Should I prioritize arrays or hash tables first for FreshWorks?+
Arrays. Five out of nine problems touch arrays, and two of the easiest ones (Two Sum, Maximum Product of Three Numbers) are array-first. Hash tables come second because they're woven into mediums like Longest Substring and LRU Cache. Don't skip them, but drill arrays first to build momentum.
Is one week enough to prepare for FreshWorks if I know the basics?+
Yes, if you focus. The nine-problem dataset is small and four are easy. Hit Two Sum and Valid Parentheses for warm-ups. Spend days two and three on Find Minimum and Longest Substring. Days four and five on the backtracking problems. Day six on LRU Cache. Day seven, review and sleep.
How much time should I spend on LRU Cache versus the easier problems?+
LRU Cache is one problem but it's medium difficulty and tests design thinking plus hash tables plus linked lists. Spend two full days on it. It's worth more than two easy problems because it shows you understand data structure tradeoffs. The easy ones you should solve in 15-20 minutes each.
Why are there two backtracking problems and no hard ones reported?+
Backtracking is a medium-difficulty pattern that filters candidates without being brute-force hard. Letter Combinations and Word Search are gating problems because they require recursion practice. No hard problems might mean FreshWorks doesn't include them, or they're rare enough that they're not in this dataset.
What's the biggest gap I might hit on the FreshWorks OA?+
LRU Cache design combined with backtracking. If you haven't built a doubly-linked-list cache before, it will stall you mid-interview. Word Search requires tight DFS logic. Both are medium and both require calm, careful code. Practice them multiple times until you can trace the logic without hesitation.