CRED Placement Papers 2025

Overview

This page is a working set of CRED placement papers from 2025: from student reports questions, the 2025 online assessment pattern, and step-by-step solutions. Use it to see what CRED actually asked in the latest cycle, how hard the rounds were, and which themes (DSA, system design, aptitude, or role-specific topics) mattered most. Practice the problems below under timed conditions, then cross-check with the interview and preparation guides if you are targeting an upcoming CRED drive.

2025 Updates

The 2025 CRED OA maintains focus on DSA and system design with enhanced emphasis on optimal solutions.

CRED Online Assessment 2025 pattern

Section	Questions	Time	Difficulty	Focus Areas
Coding Problems	2-3	90 min	Medium-Hard	Arrays, trees, graphs, DP

Total: 2-3 problems, 90 minutes
Platform: HackerRank or similar
Languages Allowed: Python, Java, JavaScript
Success Rate: ~15-20% cleared OA and advanced to interviews

CRED Placement Papers 2025 - actual questions & solutions

This section contains practice questions styled on CRED placement papers 2025 (recent-cycle 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: check palindrome

Show solution

Problem Statement: Return true if the string reads the same forward and backward (ignore case).

Example:

Input: "Level"
Output: true

Solution (Java):

public boolean isPalindrome(String s) {
    s = s.toLowerCase();
    int i = 0, j = s.length() - 1;
    while (i < j) {
        if (s.charAt(i++) != s.charAt(j--)) return false;
    }
    return true;
}

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

Question 2: 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 3: 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 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: merge two sorted lists

Show solution

Problem Statement: Merge two sorted linked lists and return a new sorted list.

Example:

Input: 1→2→4 , 1→3→4
Output: 1→1→2→3→4→4

Solution (Java):

public ListNode mergeTwoLists(ListNode a, ListNode b) {
    ListNode dummy = new ListNode(0), cur = dummy;
    while (a != null && b != null) {
        if (a.val <= b.val) { cur.next = a; a = a.next; }
        else { cur.next = b; b = b.next; }
        cur = cur.next;
    }
    cur.next = (a != null) ? a : b;
    return dummy.next;
}

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

Question 6: 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 7: first non-repeating character

Show solution

Problem Statement: Return the first non-repeating character in a string, or ‘_’ if none.

Example:

Input: "swiss"
Output: 'w'

Solution (Java):

public char firstUnique(String s) {
    int[] freq = new int[256];
    for (char c : s.toCharArray()) freq[c]++;
    for (char c : s.toCharArray()) if (freq[c] == 1) return c;
    return '_';
}

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

Question 8

Q8: In OOP, hiding internal details and showing only essential features is called?

Solution:

This is the definition of Encapsulation (often paired with abstraction in interviews).

Answer: Encapsulation

Question 9

Q9: Which normal form removes transitive dependency?

Solution:

1NF: atomic values. 2NF: no partial dependency. 3NF: no transitive dependency.

Answer: 3NF

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 2025 CRED Online Assessment

1. Coding Section is Critical: Must solve 2-3 coding problems correctly to advance
2. DSA Focus: Strong emphasis on arrays, strings, trees, graphs, and dynamic programming
3. Time Management: 2-3 problems in 90 minutes requires excellent speed and accuracy
4. Fintech Focus: Problems often relate to credit card rewards, payment systems, gamification, AI-powered features
5. System Design: Asked for SDE-1/2 roles, fintech system design for credit/rewards roles
6. Success Rate: Only 15-20% cleared OA and advanced to interviews
7. Platform: HackerRank or CRED’s internal platform
8. Focus Areas: Arrays, trees, graphs, dynamic programming, fintech systems, gamification, AI/ML
9. Enhanced Emphasis: Optimal solutions, AI-powered rewards systems, and cloud-native fintech platforms

CRED 2025 interview experiences

Based on recent candidate experiences from 2025 CRED interviews:

2025 Interview Process:

1. Online Assessment (90 minutes): 2-3 coding problems
2. Technical Phone Screen (45-60 minutes): Coding problems, algorithm discussions, fintech concepts, AI/ML
3. Onsite/Virtual Interviews (4-5 rounds, 45-60 minutes each):

• Coding rounds (2-3): Algorithms, data structures, problem-solving
• System Design rounds: AI-powered credit card rewards systems, payment processing, gamification platforms, cloud-native architecture
• Behavioral rounds: Problem-solving approach, innovation, impact, AI/ML passion

2025 Interview Trends:

• Increased emphasis on AI-powered rewards systems and cloud-native fintech platforms
• More focus on optimal solutions and gamification algorithms
• Enhanced behavioral questions about innovation and impact
• Questions about AI/ML applications in credit card rewards and gamification

Common 2025 Interview Topics:

• Coding: Arrays, strings, trees, graphs, dynamic programming, fintech algorithms, gamification
• System Design: AI-powered credit card rewards systems, payment processing, gamification platforms, cloud-native fintech architecture
• Behavioral: Problem-solving, innovation, teamwork, impact, AI/ML passion
• CRED Technologies: Credit card rewards, AI-powered features, payment systems, gamification, cloud-native platforms

Success Tips:

• Strong coding performance is essential - solve problems optimally
• Understand credit card rewards, AI-powered gamification, and cloud-native fintech systems
• Practice system design for AI-powered rewards systems and payment processing
• Prepare examples demonstrating innovation and problem-solving
• Learn CRED’s products, AI features, and fintech technologies
• Practice explaining your thought process clearly

For detailed interview experiences from 2025, visit CRED Interview Experience page.

Preparation tips for CRED 2025 pattern

1. Master Coding Fundamentals: Focus on solving 2-3 coding problems correctly - arrays, trees, graphs, DP
2. Fintech Expertise: Strong understanding of credit card rewards, AI-powered gamification, cloud-native fintech systems
3. Practice Previous Year Papers: Solve CRED OA papers from 2020-2025 to understand evolving 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. Fintech Focus: Practice problems related to credit card rewards, payment systems, gamification, AI/ML in fintech
7. System Design Mastery: Learn AI-powered rewards system design, payment processing, gamification platforms, cloud-native architecture
8. CRED Technologies: Learn credit card rewards, AI-powered features, payment systems, gamification, cloud-native platforms
9. Behavioral Preparation: Prepare examples using STAR format - innovation, problem-solving, AI/ML passion
10. Mock Tests: Take timed practice tests to improve speed and accuracy
11. AI/ML in Fintech: Understand AI/ML applications in credit card rewards and gamification

Comments & Suggestions

Related resources

2024 papers→

Coding questions→

Interview experience→

Preparation guide→

CRED hub→

Similar companies

Razorpay · PhonePe · Paytm · Flipkart · Swiggy · Zomato