i
Rcube
Planet
Filter interviews by
Be the first one to contribute and help others!
I applied via Job Portal and was interviewed before Mar 2023. There was 1 interview round.
Technical round 2 questions
posted on 11 Feb 2024
I applied via Walk-in and was interviewed before Feb 2023. There was 1 interview round.
posted on 26 Dec 2024
I applied via Campus Placement
Three fundamental questions related to Data Structures and Algorithms.
I applied via Referral and was interviewed before Feb 2023. There were 3 interview rounds.
Hackerank test with 2 questions
Splitvise is a software design for splitting expenses among a group of people.
Splitvise helps in calculating and tracking shared expenses among a group.
It allows users to input expenses and automatically calculates each person's share.
Users can view detailed reports and summaries of expenses.
Splitvise can handle various types of expenses like bills, groceries, travel expenses, etc.
It provides features like splitting eq...
posted on 13 Nov 2024
I applied via Naukri.com and was interviewed before Nov 2023. There were 3 interview rounds.
2Sum problem involves finding two numbers in an array that add up to a specific target.
Use a hashmap to store the difference between the target and each element in the array.
Iterate through the array and check if the current element's complement exists in the hashmap.
Return the indices of the two numbers that add up to the target.
Spiral traversal of a Binary tree involves visiting nodes level by level alternating between left to right and right to left.
Start by pushing the root node into a queue.
While the queue is not empty, pop a node, print its value, and push its children into the queue.
Alternate between popping nodes from the queue and printing their values in a spiral manner.
The coin change problem involves finding the number of ways to make a certain amount using given coin denominations.
Dynamic Programming Approach: Use an array to store the number of ways to make each amount up to the target.
Example: For coins [1, 2, 5] and target 5, ways are: 5 (1x5), 2+2+1, 2+1+1+1, 1+1+1+1+1.
Base Case: Initialize dp[0] = 1, as there's one way to make 0 amount (using no coins).
Iterate through each coi...
The aggressive cows problem involves finding the maximum distance between cows in a field while ensuring they are not too close to each other.
Use binary search to find the maximum distance between cows.
Sort the cows' positions and check if a certain distance is feasible.
Consider the constraints of the problem such as the number of cows and the size of the field.
I applied via Referral and was interviewed before May 2023. There were 4 interview rounds.
I appeared for an interview in Dec 2024, where I was asked the following questions.
posted on 7 Apr 2024
I appeared for an interview before Apr 2023.
I once mismanaged a project timeline, leading to delays, but learned the importance of communication and proactive planning.
Underestimated project complexity, resulting in missed deadlines.
Failed to communicate effectively with team members about progress.
Learned to set realistic timelines and involve the team in planning.
Implemented regular check-ins to monitor progress and address issues early.
Developed a more collab...
In five years, I envision myself as a strategic leader, driving team success and fostering innovation in our projects.
Leading a high-performing team that consistently meets and exceeds project goals.
Implementing innovative strategies that enhance productivity and collaboration, such as agile methodologies.
Mentoring junior team members to help them grow in their careers, similar to how I was guided early on.
Contributing...
I applied via Company Website and was interviewed in May 2024. There was 1 interview round.
based on 4 reviews
Rating in categories
Front end Developer
4
salaries
| ₹3.6 L/yr - ₹7 L/yr |
Backend Developer Lead
3
salaries
| ₹6.6 L/yr - ₹9 L/yr |
Stashfin
PrimeXBT
Rupifi
WEBPLAT TECHNOLOGIES