i
Profinch Solutions
Filter interviews by
I applied via Referral and was interviewed in Mar 2021. There were 3 interview rounds.
Top trending discussions
I applied via Company Website and was interviewed in Jan 2021. There were 5 interview rounds.
I appeared for an interview before Sep 2020.
Round duration - 90 mins
Round difficulty - Hard
There were questions related to DP and DFS.
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.
Round duration - 60 mins
Round difficulty - Medium
At first, I was asked about the different projects that I have done so far. We had a detailed discussion on the same.
He also checked my OOP concepts
Designing an LRU Cache involves implementing a data structure that stores a fixed number of items and removes the least recently used item when full.
Start by defining the data structure for the cache, typically using a combination of a hashmap and a doubly linked list.
Implement methods for getting and setting key-value pairs in the cache.
When a new item is added to the cache, check if it exceeds the maximum capacity. I...
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...
Return the middle element of a singly linked list, or the one farther from the head if there are even elements.
Traverse the linked list with two pointers, one moving twice as fast as the other
When the fast pointer reaches the end, the slow pointer will be at the middle
If there are even elements, return the one that is farther from the head node
Handle edge cases like linked list of size 1 or empty list
Round duration - 60 mins
Round difficulty - Medium
It is HR + Technical round
asked about the Behavioural questions and how you justify yourself in an argument .questions related to current technology.
They gave me feedback on how well I had performed so far and gave me suggestions on what more can I do to further improve myself.
Tip 1 : Be thorough about your projects
Tip 2 : Prepare Ds and Algo and Practice all standard questions
Tip 3 : Know the complexities of the code that you’ve written.
Tip 1 : Mention at least 2 projects.
Tip 2 : Don't make any silly spelling mistakes on resume
I appeared for an interview in Apr 2021.
Round duration - 90 minutes
Round difficulty - Medium
Timing was 9 PM. Platform was not good. Platform was very lagging so overall it was bad experience.
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
The first line contains a single integer 'T' representing the numb...
Find the third largest element in an array of distinct integers.
Sort the array in descending order and return the element at index 2.
Handle cases where the array has less than 3 elements separately.
Use a set to store distinct elements for efficient processing.
You are provided with a string STR
of length N. The task is to find the longest palindromic substring within STR
. If there are several palindromic substring...
Find the longest palindromic substring in a given string.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found so far
Return the longest palindromic substring
In this problem, Ninja is provided with two lines on a 2D plane. The first line 'AB' is determined by two points A and B. The second line 'PQ' is determined by two poi...
Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.
Implement a function to calculate the intersection point of two lines on a 2D plane
Handle precision up to six decimal places in the output
Return -1.000000 -1.000000 if the lines do not intersect
Ensure the lines 'AB' and 'PQ' are distinct
Tip 1 : Have some projects.
Tip 2 : Do a course from Coding Ninjas.
Tip 1 : Keep it short
Tip 2 : Add skills iff you are sure
I appeared for an interview in Apr 2021.
Round duration - 90 minutes
Round difficulty - Medium
Timing was 9 PM. Platform was not good. Platform was very lagging so overall it was bad experience.
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
The first line contains a single integer 'T' representing the numb...
Find the third largest element in an array of distinct integers.
Sort the array in descending order and return the element at index 2.
Handle cases where there are less than 3 elements in the array.
Consider edge cases like negative integers and duplicates.
You are provided with a string STR
of length N
. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...
Identify the longest palindromic substring in a given string.
Iterate through each character in the string and expand around it to find palindromes
Keep track of the longest palindrome found so far
Return the longest palindromic substring with the smallest start index
In this problem, Ninja is provided with two lines on a 2D plane. The first line 'AB' is determined by two points A and B. The second line 'PQ' is determined by two poi...
Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.
Implement a function to calculate the intersection point of two lines on a 2D plane
Handle precision up to six decimal places in the output
Return -1.000000 -1.000000 if the lines do not intersect
Ensure the lines 'AB' and 'PQ' are distinct
Tip 1 : Have some projects.
Tip 2 : Do a course from Coding Ninjas.
Tip 1 : Keep it short.
Tip 2 : Do not put false things.
I appeared for an interview in Apr 2021.
Round duration - 90 minutes
Round difficulty - Hard
Timing was 9 PM. Platform was not good. Platform was very lagging so overall it was bad experience.
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
The first line contains a single integer 'T' representing the numb...
Find the third largest element in an array of distinct integers.
Sort the array in descending order and return the element at index 2.
Handle cases where the array has less than 3 elements separately.
Consider using a set to ensure distinct elements in the array.
You are provided with a string STR
of length N
. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...
Identify the longest palindromic substring in a given string.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found
Return the longest palindromic substring with the smallest start index
In this problem, Ninja is provided with two lines on a 2D plane. The first line 'AB' is determined by two points A and B. The second line 'PQ' is determined by two poi...
Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.
Use the formula for finding the intersection point of two lines in 2D space.
Handle precision issues that may arise due to floating-point arithmetic.
Return -1.000000 -1.000000 if the lines do not intersect.
Ensure the lines 'AB' and 'PQ' are distinct.
Tip 1 : Have some projects.
Tip 2 : Do a course from Coding Ninjas.
Tip 1 : Keep it short.
Tip 2 : Do not put false things.
I appeared for an interview in Dec 2021.
Round duration - 90 Minutes
Round difficulty - Easy
Problem solving using SQL questions
Round duration - 90 Minutes
Round difficulty - Easy
A marketing campaign is run, how will you decide metrics to be tracked. Techincaly a KPI round
Metrics selection based on campaign objectives, target audience, and key performance indicators.
Identify campaign objectives and goals
Consider target audience and their behavior
Select key performance indicators (KPIs) relevant to the campaign
Track metrics such as conversion rate, click-through rate, ROI, customer acquisition cost
Analyze data to measure success and make data-driven decisions
Round duration - 30 Minutes
Round difficulty - Easy
Social empathatic fit round
Tip 1 : SQL logics to be understood completely
Tip 2 : A good running working logic of Python
Tip 3 : Basics of Dashboarding
Tip 1 : One pager , single column resume which shows all your skills
Tip 2 : Mention all things that make you relevant for the job
I applied via Referral and was interviewed before Mar 2022. There were 6 interview rounds.
Basic aptitude test to check the right skill set
I applied via Company Website and was interviewed in Aug 2023. There were 4 interview rounds.
I applied via Referral and was interviewed before May 2023. There was 1 interview round.
based on 1 interview
Interview experience
based on 12 reviews
Rating in categories
Software Engineer
178
salaries
| ₹2.8 L/yr - ₹10.5 L/yr |
Technical Architect
110
salaries
| ₹11 L/yr - ₹37 L/yr |
Consultant
100
salaries
| ₹3.6 L/yr - ₹8.8 L/yr |
Senior Software Engineer
59
salaries
| ₹7.1 L/yr - ₹19 L/yr |
Senior Consultant
50
salaries
| ₹7 L/yr - ₹19 L/yr |
Rupeek
Razorpay
ACKO
Kissht Finance