Cashify interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Cashify
2 rounds | 3 Coding
problems
Rejected
Interview preparation journey
Journey
I participated actively in our college in various coding competitions and practised a lot of Questions on various competitive programming sites. Although I got placed very early during college time so was not allowed in other companies so kept working hard for various off-campus opportunities available.
Application story
Cashify visited our campus for hiring. I applied for it passed the preliminary test and moved to the interview rounds.
Why selected/rejected for the role?
I was rejected because I already received a similar offer in the same pay range, so I could not participate in the final HR round.
Preparation
Duration: 8 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Computer Networking, Object Oriented Programming, ML
Tip 1: Never leave any topic from any chapter/subject.
Tip 2: Learn to explain your thoughts well.
Tip 3: Learn from previous experiences, interviews, and problems asked.
Tip 4: Include at least four projects in your resume.
Application process
Where: Campus
Eligibility: 60% Marks in 10th, 12th and CGPA of 6.0 and above with no active backlog(s) and pursuing a regular semester.
Tip 1: Include at least four projects on your resume.
Tip 2: Do not write false information. You will always get caught. Be genuine.
Interview rounds
01
Round
Easy
Video Call
Duration60 minutes
Interview date22 Apr 2022
Coding problem2
This round was taken by a very polite interviewer. He asked some good questions on DSA concepts like the implementation difference between stack and queue and some concepts of pointers. Then he asked 2 DSA questions.
1. Longest Substring Without Repeating Characters
Moderate
20m average time
80% success
0/80
Asked in companies
Given a string 'S' of length 'L', return the length of the longest substring without repeating characters.
Example:
Suppose given input is "abacb", then the length of the longest substring without repeating characters will be 3 ("acb").
Problem approach
Maintain an Unordered Set to keep track of the maximum non-repeating char substring (Instead of the standard LPS array of KMP). Whenever we find a repeating char, then we clear the Set and reset len to zero. Rest everything is almost similar to KMP.
2. Reverse Linked List
Moderate
15m average time
85% success
0/80
Asked in companies
Given a singly linked list of integers. Your task is to return the head of the reversed linked list.
For example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Follow Up :
Can you solve this problem in O(N) time and O(1) space complexity?
Problem approach
initialize three pointers prev as NULL, curr as head, and next as NULL.
Iterate through the linked list. In a loop, do the following:
Before changing the next of curr, store the next node
next = curr -> next
Now update the next pointer of curr to the prev
curr -> next = prev
Update prev as curr and curr as next
prev = curr
curr = next
02
Round
Easy
Video Call
Duration60 minutes
Interview date29 Apr 2022
Coding problem1
This round was intended to assess my projects and technical stack knowledge. After discussing these, the interviewer inquired about my previous internship experience and the work I had done there. Additionally, he posed a challenging question related to Data Structures and Algorithms.
1. Trapping Rain Water
Moderate
15m average time
80% success
0/80
Asked in companies
You have been given a long type array/list 'arr’ of size 'n’.
It represents an elevation map wherein 'arr[i]’ denotes the elevation of the 'ith' bar.
Print the total amount of rainwater that can be trapped in these elevations.
Note :
The width of each bar is the same and is equal to 1.
Example:
Input: ‘n’ = 6, ‘arr’ = [3, 0, 0, 2, 0, 4].
Output: 10
Explanation: Refer to the image for better comprehension:
Note :
You don't need to print anything. It has already been taken care of. Just implement the given function.
Problem approach
Find the total number of blocks, i.e., the sum of the heights array, num_blocks
Find the maximum height, max_height
Store total water in a variable, total = 0
Keep two pointers, left = 0 and right = N -1, to store the leftmost and the rightmost boundaries for each unit of height
For each height, i from 1 to max_height, do the following
Find the leftmost and the rightmost boundary for the current height.
As mentioned earlier we can consider all the blocks in between these to have at least i unit of water.
Add this amount of water to the total trapped water.
After the iteration, subtract num_blocks from the total as we have considered them as water height during calculation.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is the purpose of the return keyword?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
Selected 
4782 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
Rejected
1012 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
Rejected
6543 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3567 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
Selected 6315 views
3 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by BNY Mellon
Selected 0 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by CIS - Cyber Infrastructure
Selected 2179 views
0 comments
0 upvotes