Skip to content
Placement Papers - Free Placement Papers for Top CompaniesPlacement Papers - Free Placement Papers for Top CompaniesPlacement Papers

Freshworks Placement Papers 2024

Overview

This page collects Freshworks placement papers from 2024 with previous-year questions, solutions, and the 2024 exam pattern. It is useful when you want real drive history: what the OA looked like, which question types repeated, and how solutions were approached. Work through the papers below to build speed and accuracy, then compare against newer 2025 material so your prep matches both established Freshworks patterns and the latest shifts.

Freshworks Online Assessment 2024 pattern

Section Questions Time Difficulty
Coding Problems 2-3 90 min Medium-Hard

Freshworks Placement Papers 2024 - actual questions & solutions

This section contains practice questions styled on Freshworks placement papers 2024 (previous-year pattern), with worked solutions. Use them as timed sectional drills - from student reports drives vary by college and role, so treat this as a high-signal practice bank, not an official paper dump.

Question 1: rotate array right by k

Show solution

Problem Statement: Rotate the array to the right by k steps.

Example:

Input: [1,2,3,4,5,6,7], k = 3
Output: [5,6,7,1,2,3,4]

Solution (Java):

public void rotate(int[] nums, int k) {
    k %= nums.length;
    reverse(nums, 0, nums.length - 1);
    reverse(nums, 0, k - 1);
    reverse(nums, k, nums.length - 1);
}
void reverse(int[] a, int l, int r) {
    while (l < r) { int t = a[l]; a[l++] = a[r]; a[r--] = t; }
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 2: longest common prefix

Show solution

Problem Statement: Find the longest common prefix string amongst an array of strings.

Example:

Input: ["flower","flow","flight"]
Output: "fl"

Solution (Java):

public String longestCommonPrefix(String[] strs) {
    if (strs.length == 0) return "";
    String pref = strs[0];
    for (int i = 1; i < strs.length; i++) {
        while (!strs[i].startsWith(pref)) {
            pref = pref.substring(0, pref.length() - 1);
            if (pref.isEmpty()) return "";
        }
    }
    return pref;
}

Time Complexity: O(S)
Space Complexity: O(1)

Question 3: two sum

Show solution

Problem Statement: Given an array of integers and a target, return indices of two numbers that add up to target.

Example:

Input: nums = [2, 7, 11, 15], target = 9
Output: [0, 1]

Solution (Java):

public int[] twoSum(int[] nums, int target) {
    Map<Integer, Integer> map = new HashMap<>();
    for (int i = 0; i < nums.length; i++) {
        int need = target - nums[i];
        if (map.containsKey(need)) return new int[]{map.get(need), i};
        map.put(nums[i], i);
    }
    return new int[]{};
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 4: climbing stairs

Show solution

Problem Statement: You can climb 1 or 2 steps. How many distinct ways to climb n stairs?

Example:

Input: n = 4
Output: 5

Solution (Java):

public int climbStairs(int n) {
    if (n <= 2) return n;
    int a = 1, b = 2;
    for (int i = 3; i <= n; i++) {
        int c = a + b; a = b; b = c;
    }
    return b;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 5: maximum subarray sum

Show solution

Problem Statement: Find the contiguous subarray with the largest sum.

Example:

Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4]
Output: 6  // [4, -1, 2, 1]

Solution (Java):

public int maxSubArray(int[] nums) {
    int best = nums[0], cur = nums[0];
    for (int i = 1; i < nums.length; i++) {
        cur = Math.max(nums[i], cur + nums[i]);
        best = Math.max(best, cur);
    }
    return best;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 6: valid parentheses

Show solution

Problem Statement: Given a string of brackets, determine if it is valid.

Example:

Input: "()[]{}"
Output: true

Solution (Java):

public boolean isValid(String s) {
    Deque<Character> st = new ArrayDeque<>();
    Map<Character, Character> pair = Map.of(')', '(', ']', '[', '}', '{');
    for (char c : s.toCharArray()) {
        if (pair.containsValue(c)) st.push(c);
        else if (st.isEmpty() || st.pop() != pair.get(c)) return false;
    }
    return st.isEmpty();
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 7: detect cycle in linked list

Show solution

Problem Statement: Return true if the linked list has a cycle.

Example:

Input: 3→2→0→-4→(back to 2)
Output: true

Solution (Java):

public boolean hasCycle(ListNode head) {
    ListNode slow = head, fast = head;
    while (fast != null && fast.next != null) {
        slow = slow.next;
        fast = fast.next.next;
        if (slow == fast) return true;
    }
    return false;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 8

Q8: Which data structure uses FIFO order?

Solution:

FIFO = First In First Out → Queue. Stack is LIFO.

Answer: Queue

Question 9

Q9: Virtual memory is typically implemented using?

Solution:

OS uses demand paging (and sometimes segmentation) to implement virtual memory.

Answer: Demand paging

Question 10

Q10: Time complexity of binary search on a sorted array of n elements is?

Solution:

Each step halves the search space → O(log n).

Answer: O(log n)

Question 11

Q11: Worst-case time complexity of quicksort is?

Solution:

Unbalanced partitions (already sorted with bad pivot) → O(n²).

Answer: O(n²)

Key insights from 2024 Freshworks Online Assessment

  1. Coding Section is Critical: Must solve 2-3 coding problems correctly to advance
  2. SaaS System Design: Strong emphasis on SaaS system design and customer data management
  3. Time Management: 2-3 coding problems in 90 minutes requires excellent speed
  4. Success Rate: Only 10-15% cleared OA and advanced to interviews
  5. Platform: Freshworks’ assessment platform or HackerRank
  6. Focus Areas: Arrays, trees, graphs, dynamic programming, SaaS systems, customer data management

Freshworks 2024 interview experiences

Based on candidate experiences from 2024 Freshworks interviews:

2024 Interview Process:

  1. Online Assessment (90 minutes): 2-3 coding problems
  2. Technical Phone Screen (45-60 minutes): Coding problems, algorithm discussions, SaaS concepts
  3. Onsite Interviews (4-5 rounds, 45-60 minutes each):
  • Coding rounds (2-3): Algorithms, data structures, problem-solving
  • System Design rounds: SaaS platforms, customer data management, CRM systems
  • Behavioral rounds: Problem-solving approach, innovation, customer focus

Common 2024 Interview Topics:

  • Coding: Arrays, strings, trees, graphs, dynamic programming, customer data algorithms
  • System Design: SaaS platforms, customer data management, CRM systems, scalable systems
  • Behavioral: Problem-solving, innovation, customer focus, impact
  • Freshworks Technologies: Freshdesk, Freshservice, SaaS platforms, customer support systems

2024 Interview Questions Examples:

  • Customer Data Management
  • Design Freshworks’ customer support system (System Design)
  • Design Freshworks’ SaaS platform (System Design)
  • Customer data processing algorithms

Success Tips:

  • Strong coding performance is essential - solve problems optimally
  • Understand SaaS platforms and customer data management concepts
  • Practice system design for SaaS systems and CRM platforms
  • Prepare examples demonstrating innovation and customer focus
  • Learn Freshworks’ products and SaaS technologies
  • Practice explaining your thought process clearly

For detailed interview experiences, visit Freshworks Interview Experience page.

Preparation tips for Freshworks 2024 pattern

  1. Master Coding Fundamentals: Focus on solving 2-3 coding problems correctly - arrays, trees, graphs, DP
  2. SaaS Knowledge: Strong understanding of SaaS platforms, customer data management, CRM systems
  3. Practice Previous Year Papers: Solve Freshworks OA papers from 2020-2024 to understand patterns
  4. Time Management: Practice completing 2-3 coding problems in 90 minutes
  5. LeetCode Practice: Solve 200+ LeetCode problems focusing on arrays, strings, trees, graphs (medium-hard difficulty)
  6. SaaS Focus: Practice problems related to SaaS systems and customer data management
  7. System Design Mastery: Learn SaaS platform design, customer data management, CRM systems
  8. Freshworks Technologies: Learn Freshdesk, Freshservice, SaaS platforms, customer support systems
  9. Behavioral Preparation: Prepare examples using STAR format - innovation, customer focus, problem-solving
  10. Mock Tests: Take timed practice tests to improve speed and accuracy

Comments & Suggestions

2025 papers

Coding questions

Interview experience

Preparation guide

Freshworks hub

Similar companies

Zoho · Salesforce · ServiceNow · Flipkart · Zomato · Swiggy