Freshworks Coding Interview Questions
25 Freshworks coding interview problems with full optimal solutions — 10 easy, 11 medium, 4 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Freshworks interviewer values, and a FAQ section.
Showing 11 problems of 25
- #11mediumfoundational
11. Add Two Numbers
Add two big numbers stored as reverse-order linked lists — Freshworks frames it as merging two automation-rule counters that overflow Int32.
- #12mediumfoundational
12. Longest Substring Without Repeating Characters
Find the longest run of unique characters in a string — Freshworks frames it as the longest stretch of distinct tags on a ticket timeline before a rule re-fires.
- #13mediumfoundational
13. 3Sum
Find every distinct triplet that sums to zero — Freshworks dresses it as balancing three SLA-credit ledgers to net zero.
- #14mediumfoundational
14. Permutations
Generate every ordering of a small set — Freshworks asks it to probe whether you can enumerate automation-rule firing orders cleanly.
- #15mediumfoundational
15. Group Anagrams
Bucket strings by anagram equivalence — Freshworks uses this shape for grouping tickets by canonical tag combinations regardless of label order.
- #16mediumfoundational
16. Merge Intervals
Merge overlapping time intervals — Freshworks frames it directly as collapsing overlapping SLA-timer windows on a ticket's lifecycle.
- #17mediumfoundational
17. Number of Islands
Count connected components in a grid — Freshworks frames it as counting independent tenant clusters in a sharded ticket grid.
- #18mediumfoundational
18. LRU Cache
Design an O(1) least-recently-used cache — Freshworks asks this verbatim because their multi-tenant ticket cache is exactly this data structure.
- #19mediumfoundational
19. Word Search
DFS-search a 2D grid for a word — Freshworks frames it as detecting a specific automation-rule signature path across a tag adjacency grid.
- #20mediumfoundational
20. Validate Binary Search Tree
Verify a binary tree satisfies the BST property — Freshworks asks this when probing whether you can reason about a permission tree's ordering invariant.
- #21mediumfoundational
21. Binary Tree Level Order Traversal
BFS a binary tree level-by-level — Freshworks uses this as the warm-up before any multi-tenant org-tree question.