Problem database last updated: June 20, 2025
9 problems · 4 Easy, 5 Medium, 0 Hard · Ranked #150 of 458
4 Easy
44% · avg 23%
5 Medium
56% · avg 59%
0 Hard
0% · avg 18%
Based on 9 reported problems, FreshWorks interviews are easier than average - only 0% Hard compared to 18% across all companies. The majority (56%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, FreshWorks puts unusual emphasis on backtracking (22.2% of problems, 4.3x the industry average), string (44.4% of problems, 1.6x the industry average), hash-table (33.3% of problems, 1.5x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (55.6%), string (44.4%), hash-table (33.3%), backtracking (22.2%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Two Sum Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. | Easy | Very Likely | arrayhash-map | Solve |
Valid Parentheses Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. | Easy | Very Likely | stringstack | Solve |
Longest Substring Without Repeating Characters Given a string s, find the length of the longest substring without duplicate characters. | Medium | Very Likely | hash-tablestringsliding-window | Solve |
Word Search Given an m x n grid of characters board and a string word, return true if word exists in the grid. | Medium | Very Likely | arraystringbacktracking | Solve |
LRU Cache Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. | Medium | Very Likely | hash-tablelinked-listdesign | Solve |
Find Minimum in Rotated Sorted Array Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become: | Medium | Very Likely | arraybinary-search | Solve |
Maximum Product of Three Numbers Given an integer array nums, find three numbers whose product is maximum and return the maximum product. | Easy | Very Likely | arraymathsorting | Solve |
Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a given stock on the ith day. | Easy | Very Likely | arraydynamic-programming | Solve |
Letter Combinations of a Phone Number Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order. | Medium | Very Likely | hash-tablestringbacktracking | Solve |
Two Sum
SolveGiven an array of integers nums and an integer target, return the indices of the two numbers that add up to target.
Valid Parentheses
SolveGiven a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
Longest Substring Without Repeating Characters
SolveGiven a string s, find the length of the longest substring without duplicate characters.
Word Search
SolveGiven an m x n grid of characters board and a string word, return true if word exists in the grid.
LRU Cache
SolveDesign a data structure that follows the constraints of a Least Recently Used (LRU) cache.
Find Minimum in Rotated Sorted Array
SolveSuppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become:
Maximum Product of Three Numbers
SolveGiven an integer array nums, find three numbers whose product is maximum and return the maximum product.
Best Time to Buy and Sell Stock
SolveYou are given an array prices where prices[i] is the price of a given stock on the ith day.
Letter Combinations of a Phone Number
SolveGiven a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent FreshWorks interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
FreshWorks interviews focus heavily on array, string, hash-table problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. FreshWorks interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
FreshWorks has been reported to ask 9 distinct coding problems. The most common topics are array, string, hash-table. 4 are Easy difficulty, 5 are Medium, and 0 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 9 reported problems, FreshWorks interviews are easier than average - only 0% Hard compared to 18% across all companies. 56% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, hash-table. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real FreshWorks coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a FreshWorks interview with AIarrow_forward
