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 10 problems of 25
- #1easyfoundational
1. Two Sum
Find two indices in an array whose values sum to a target.
- #2easyfoundational
2. Valid Parentheses
Determine if a string of brackets is correctly opened and closed.
- #3easyfoundational
3. Merge Two Sorted Lists
Merge two sorted linked lists into one sorted list.
- #4easyfoundational
4. Remove Duplicates from Sorted Array
Deduplicate ticket IDs streaming in sorted order without allocating a second buffer.
- #5easyfoundational
5. Merge Sorted Array
Merge two sorted ticket buffers in place, mirroring how Freshdesk consolidates queues from primary and replica shards.
- #6easyfoundational
6. Best Time to Buy and Sell Stock
Find the max single-pass profit — Freshworks dresses this up as 'lowest SLA breach risk window' across a day of ticket resolution times.
- #7easyfoundational
7. Single Number
Find the one un-paired ticket ID in a batch where every other ID was acknowledged twice — a classic XOR trick framed as Freshdesk audit reconciliation.
- #8easyfoundational
8. Min Stack
Design a stack with O(1) push, pop, top, and getMin — Freshworks frames it as 'lowest open-ticket priority' at any point in an undo history.
- #9easyfoundational
9. Majority Element
Find the agent ID assigned to more than half the open tickets — a Boyer-Moore voting drill that Freshworks dresses up as automation-rule triage.
- #10easyfoundational
10. Reverse Linked List
Reverse a singly-linked list iteratively — the warm-up Freshworks asks before any deeper linked-list problem like ticket-queue rotation.