sprinklr logo
Sprinklr· intern

Sprinklr Online Assessment intern (2026)

Posted
18 Jul 2025
400 reads

Summary

I participated in the Sprinklr Online Assessment for an intern position, which featured three distinct algorithmic challenges.

How it went

Question 1 :

You are given two strings s and t, both of the same length. You can transform string s into string t by mapping each character in s to only one character in t. However, this mapping must be consistent: Each character in s must map to exactly one character in t. Two different characters in s cannot map to the same character in t. Your task is to determine whether such a transformation is possible.

Question 2 :

You are given: A list of digits (from '1' to '9', inclusive), where each digit can be used only once. A list of arithmetic operators consisting of '+' and '-'. Your task is to place all operators between digits (or groups of digits) to form a valid arithmetic expression such that: Each operator is used exactly once and placed between two numbers. All digits must be used exactly once (no repetition). You may combine adjacent digits to form multi-digit numbers (e.g., '1' and '5' can form '15' or '51'). You must find and return the maximum and minimum possible values of the resulting expressions.

Question 3

You are given a task to generate all possible attendance records for a student over n days. Each day's record can be one of the following:

'P' — Present

'L' — Late

'A' — Absent

However, the record must follow these two rules:

At most one 'A' (Absent) is allowed in the entire record.

No three consecutive 'L' (Late) entries are allowed.

Your task is to count the total number of possible valid attendance strings of length n that follow these rules.

n <= 10^5

Questions asked (3)

  1. 01

    Isomorphic Strings Transformation Check

    Data Structures & Algorithms · Medium

    You are given two strings s and t, both of the same length. You can transform string s into string t by mapping each character in s to only one character in t. However, this mapping must be consistent: Each character in s must map to exactly one character in t. Two different characters in s cannot map to the same character in t. Your task is to determine whether such a transformation is possible.

  2. 02

    Maximize/Minimize Arithmetic Expression from Digits and Operators

    Data Structures & Algorithms · Hard

    You are given: A list of digits (from '1' to '9', inclusive), where each digit can be used only once. A list of arithmetic operators consisting of '+' and '-'. Your task is to place all operators between digits (or groups of digits) to form a valid arithmetic expression such that: Each operator is used exactly once and placed between two numbers. All digits must be used exactly once (no repetition). You may combine adjacent digits to form multi-digit numbers (e.g., '1' and '5' can form '15' or '51'). You must find and return the maximum and minimum possible values of the resulting expressions.

  3. 03

    Valid Attendance Records Count

    Data Structures & Algorithms · Hard

    You are given a task to generate all possible attendance records for a student over n days. Each day's record can be one of the following: 'P' — Present 'L' — Late 'A' — Absent However, the record must follow these two rules: At most one 'A' (Absent) is allowed in the entire record. No three consecutive 'L' (Late) entries are allowed. Your task is to count the total number of possible valid attendance strings of length n that follow these rules. n <= 10^5

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Sprinklr recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!