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 4 problems of 25
- #22hardfoundational
22. Median of Two Sorted Arrays
Find the median across two sorted arrays in O(log min(m, n)) — Freshworks asks this to probe binary-search fluency over a partitioned domain.
- #23hardfoundational
23. Trapping Rain Water
Compute trapped water over an elevation histogram — Freshworks asks it to probe whether you can derive two-pointer invariants under pressure.
- #24hardfoundational
24. Merge k Sorted Lists
Merge k sorted linked lists into one — Freshworks frames it directly as merging k per-shard ticket queues into one global SLA-sorted stream.
- #25hardfoundational
25. Minimum Window Substring
Find the smallest window containing every required character — Freshworks frames it as finding the shortest ticket-history window covering every required SLA-breach tag.