i
Wave Card
Filter interviews by
I applied via LinkedIn and was interviewed in Mar 2024. There was 1 interview round.
Wave Card Private Limited offers a dynamic work environment, opportunities for growth, and cutting-edge projects.
Dynamic work environment with opportunities for growth
Cutting-edge projects to work on
Positive company culture and values
Strong leadership team
Employee benefits and perks
I applied via Campus Placement and was interviewed before Apr 2021. There were 2 interview rounds.
I applied via Referral and was interviewed before Nov 2019. There was 1 interview round.
I applied via Recruitment Consultant and was interviewed before Jun 2020. There were 4 interview rounds.
To onboard a merchant, we need to understand their business needs and provide them with a tailored solution.
Research the merchant's business and industry to understand their pain points and needs
Provide a personalized solution that addresses their specific needs
Offer training and support to ensure a smooth onboarding process
Communicate clearly and regularly to build trust and maintain a positive relationship
Follow up r...
To pitch a merchant, understand their needs, offer a solution, and show the benefits of your product/service.
Research the merchant's business and identify their pain points
Offer a tailored solution that addresses their specific needs
Highlight the benefits of your product/service, such as increased revenue or improved efficiency
Provide social proof, such as customer testimonials or case studies
Be confident and enthusias...
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...
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 applied via Naukri.com and was interviewed in Jul 2020. There were 5 interview rounds.
I applied via Referral and was interviewed in Sep 2020. There was 1 interview round.
based on 1 interview
Interview experience
PhonePe
KFintech
Rupeek
Razorpay