Protium finance interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

Protium finance
upvote
share-icon
3 rounds | 8 Coding problems

Interview preparation journey

expand-icon
Journey
My journey started with building a strong foundation in programming and Data Structures & Algorithms during my time at Motilal Nehru National Institute of Technology Allahabad. I practiced consistently on coding platforms, solving 1100+ problems and achieving good ratings in competitive programming. Alongside this, I built full-stack projects such as an AI mock interview platform and a blogging platform using React, Node.js, and MongoDB, which helped me gain practical development experience. With consistent problem-solving, project building, and revision of core CS subjects, I was able to crack the interview and secure the opportunity at Protium Finance.
Application story
I applied for the SDE internship opportunity at Protium Finance through the campus placement process at Motilal Nehru National Institute of Technology Allahabad. After submitting my application and resume, I was shortlisted for the subsequent stages of the selection process. The overall process included an initial screening followed by technical evaluations and interview rounds. The interviews mainly focused on problem-solving ability, understanding of Data Structures and Algorithms, core CS fundamentals, and discussions about my projects and development experience. The entire process was smooth and well-structured, and after successfully clearing all the stages, I was selected for the role.
Why selected/rejected for the role?
I was selected for this role because of my strong problem-solving skills, solid understanding of Data Structures and Algorithms, and consistent performance on coding platforms. Additionally, my full-stack development experience through projects using React, Node.js, and MongoDB, along with my ability to explain concepts clearly and approach problems logically, helped me stand out during the selection process at Protium Finance.
Preparation
Duration: 14 Months
Topics: Data Structures and Algorithms, Object-Oriented Programming, Operating Systems, Database Management Systems, Computer Networks, Web Development, System Design
Tip
Tip

Tip 1: Practice Data Structures and Algorithms consistently and solve problems on coding platforms.

Tip 2: Build at least 2–3 real-world projects using technologies like React and Node.js to gain practical experience.

Tip 3: Revise core CS subjects regularly, such as Operating Systems, DBMS, and OOPs, before interviews.

Application process
Where: Campus
Eligibility: Above 7 CGPA, (Salary Package: 3.6 LPA)
Resume Tip
Resume tip

Tip 1: Include strong projects that clearly demonstrate your skills in technology and problem-solving.

Tip 2: Keep your resume concise (one page) and highlight measurable achievements such as coding ratings, rankings, or the impact of your projects.

Interview rounds

01
Round
Easy
Online Coding Interview
Duration45 minutes
Interview date20 Sep 2025
Coding problem3

1. Isomorphic Strings

Easy
15m average time
85% success
0/40
Asked in companies
BarclaysCGIVMware Inc

You have been given two strings, 'str1' and 'str2'.


Your task is to return true if the given two strings are isomorphic to each other, else return false.


Note :
Two strings are isomorphic if a one-to-one mapping is possible for every character of the first string ‘str1’ to every character of the second string ‘str2’ while preserving the order of the characters.

All occurrences of every character in the first string ‘str1’ should map to the same character in the second string, ‘str2’.
For example :
If str1 = “aab” and str2 = “xxy” then the output will be 1. ‘a’ maps to ‘x’ and ‘b’ maps to ‘y’.

If str1 = “aab” and str2 = “xyz” then the output will be 0. There are two different characters in 'str1', while there are three different characters in 'str2'. So there won't be one to one mapping between 'str1' and 'str2'.
Problem approach

Step 1: I first clarified the concept of isomorphic strings with examples and understood that each character must map uniquely to another character.

Step 2: My initial idea was to track character mappings using a data structure to ensure one-to-one mapping between characters of both strings.

Step 3: I used a mapping approach to store relationships between characters of the two strings while iterating through t   hem simultaneously.

Step 4: During traversal, I checked whether an existing mapping was consistent and ensured no two characters mapped to the same character.

Step 5: If all mappings remained consistent throughout the iteration, I concluded that the strings are isomorphic; otherwise, they are not.

Try solving now

2. Subarrays With ‘K’ Distinct Values

Moderate
15m average time
85% success
0/80
Asked in companies
Goldman SachsVMware IncD.E.Shaw

You are given an array ‘ARR’ having ‘N’ integers. You are also given an integer ‘K’. The task is to count the number of subarrays that have ‘K’ distinct values.


Subarray: A consecutive sequence of one or more values taken from an array.


For Example :
‘N’ = 4, ‘K’ = 2
‘ARR’ = [1, 1, 2, 3]

There are ‘3’ subarrays with ‘2’ distinct elements, which are as follows: [1, 2], [2, 3], [1, 1, 2].
Thus, you should return ‘3’ as the answer.
Problem approach

Step 1: I first discussed the brute-force approach of checking all possible subarrays and counting distinct elements, but it would take O(N²) time, which is inefficient.

Step 2: The interviewer hinted at using a sliding window technique to optimize the solution.

Step 3: I used the idea that the number of subarrays with exactly K distinct elements equals the number of subarrays with at most K distinct elements minus those with at most (K−1) distinct elements.

Step 4: I then implemented a sliding window with a hashmap to maintain the frequency of elements within the window and track the number of distinct elements.

Step 5: By calculating the count of subarrays with at most K and at most (K−1) distinct elements, I subtracted the results to get the number of subarrays with exactly K distinct integers.

Try solving now

3. Employees Earning More Than Their Manager

Find employees who earn more than their managers.

Each employee may have a manager, and the managerId refers to the id of another employee in the same table.

Write an SQL query to find the names of employees whose salary is greater than their manager’s salary. (Practice)

Problem approach

Step 1: I first observed that the manager’s information is also stored in the same table, so this problem requires a self-join.

Step 2: I joined the Employee table with itself, where the employee’s managerId matches the manager’s id.

Step 3: After joining, I compared the employee’s salary with the manager’s salary.

Step 4: I filtered the records where the employee's salary is greater than the manager's salary.

Step 5: Finally, I selected the employee names that satisfy this condition.

02
Round
Medium
Face to Face
Duration70 minutes
Interview date29 Sep 2025
Coding problem2

1. Valid Parentheses

Easy
10m average time
80% success
0/40
Asked in companies
AtlassianCultfitMeesho

You're given a string 'S' consisting of "{", "}", "(", ")", "[" and "]" .


Return true if the given string 'S' is balanced, else return false.


For example:
'S' = "{}()".

There is always an opening brace before a closing brace i.e. '{' before '}', '(' before ').
So the 'S' is Balanced.
Problem approach

Step 1: I first considered checking the brackets sequentially but realized that simple counting would not work for cases like "([)]".

Step 2: I then proposed using a stack data structure, as stacks naturally follow the Last-In-First-Out (LIFO) principle, which fits this problem.

Step 3: I traversed the string character by character. Whenever I encountered an opening bracket, I pushed it onto the stack.

Step 4: Whenever I encountered a closing bracket, I checked the top element of the stack. If it matched the corresponding opening bracket, I popped it; otherwise, the string was invalid.

Step 5: After completing the traversal, if the stack was empty, the string was valid; otherwise, it was invalid.

Try solving now

2. OOP

  • What are abstract classes, and how do they differ from interfaces? (Learn)
  • What is the difference between composition and inheritance? (Learn)
  • What is the difference between shallow copy and deep copy? (Learn)
  • What is the Rule of Three / Rule of Five in object-oriented programming?
  • What are constructors and destructors, and when are they called? (Learn)
  • What is object slicing, and when does it occur?
  • What is the difference between static binding and dynamic binding? (Learn)
  • What is the Liskov Substitution Principle (LSP) in OOP? (Learn)
  • What are the SOLID principles in object-oriented design?
03
Round
Hard
Face to Face
Duration90 minutes
Interview date29 Sep 2025
Coding problem3

1. OS Concepts

  • How do deadlock detection, prevention, and avoidance differ? Explain Banker’s Algorithm.
  • What are semaphores, and how are they used to solve the producer–consumer problem?
  • Explain the difference between a mutex, a semaphore, and a monitor.
  • What are page replacement algorithms? Explain LRU, FIFO, and Optimal. (Learn)

2. DB Concepts

  • What is the difference between a clustered index and a non-clustered index? (Learn)
  • What are B-Trees and B+ Trees, and why are they used in databases? (Learn)
  • What is the difference between horizontal and vertical partitioning?
  • What is MVCC (Multi-Version Concurrency Control), and how does it work?
  • Explain write-ahead logging (WAL) and its role in recovery.
  • What is the difference between serializable and snapshot isolation levels?

3. Median of two sorted arrays

Hard
25m average time
65% success
0/120
Asked in companies
GrabWells FargoMicrosoft

Given two sorted arrays 'a' and 'b' of size 'n' and 'm' respectively.


Find the median of the two sorted arrays.


Median is defined as the middle value of a sorted list of numbers. In case the length of list is even, median is the average of the two middle elements.


The expected time complexity is O(min(logn, logm)), where 'n' and 'm' are the sizes of arrays 'a' and 'b', respectively, and the expected space complexity is O(1).


Example:
Input: 'a' = [2, 4, 6] and 'b' = [1, 3, 5]

Output: 3.5

Explanation: The array after merging 'a' and 'b' will be { 1, 2, 3, 4, 5, 6 }. Here two medians are 3 and 4. So the median will be the average of 3 and 4, which is 3.5.
Problem approach

Step 1: I first discussed the brute-force approach of merging both arrays and then finding the median, but that would take O(m+n) time, which does not satisfy the required complexity.

Step 2: The interviewer asked me to think of a more optimal approach, leveraging the fact that both arrays are already sorted.

Step 3: I proposed using binary search on the smaller array to partition both arrays into left and right halves.

Step 4: I ensured that the largest element on the left side is less than or equal to the smallest element on the right side after partitioning.

Step 5: Once the correct partition was found, I calculated the median based on whether the total number of elements was even or odd.

Step 6: This approach satisfies the required O(log(min(m, n))) time complexity, and the interviewer was satisfied with the optimized solution.

Try solving now

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which data structure is used to implement a DFS?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
5027 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
1077 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6697 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3720 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
15659 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
15563 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
10248 views
2 comments
0 upvotes