i
RenewBuy
Filter interviews by
Top trending discussions
I applied via LinkedIn and was interviewed in Apr 2020. There was 1 interview round.
I applied via Walk-in and was interviewed before Dec 2020. There were 4 interview rounds.
I applied via Walk-in and was interviewed in Feb 2021. There was 1 interview round.
posted on 8 Feb 2021
I applied via Referral and was interviewed before Feb 2020. There was 1 interview round.
posted on 26 Mar 2021
I applied via Referral and was interviewed in Feb 2021. There was 1 interview round.
I applied via Naukri.com and was interviewed before Feb 2022. There were 3 interview rounds.
Gd was on pre corona vs post corona
I applied via Naukri.com and was interviewed in Sep 2020. There were 3 interview rounds.
posted on 9 Jul 2021
I was interviewed in May 2022.
Round duration - 75 Minutes
Round difficulty - Medium
The round consisted of 2 Coding based based questions.
These question were easy for as I have already done this while preparing.
Determine whether two binary trees, given by their roots 'ROOT1' and 'ROOT2', are flip equivalent. A tree can be transformed into a flip equivalent through any number o...
The problem is to determine if two binary trees are flip equivalent after performing flip operations on one of the trees.
Perform a depth-first search (DFS) on both trees simultaneously
At each node, check if the values are equal and the left and right subtrees are either both null or both not null
If the above conditions are met, recursively check the flip equivalence of the left and right subtrees
If any of the condition...
You are provided with an integer array ARR
of size N
sorted in ascending order. Your task is to determine if it is possible to split this array i...
The task is to determine if an integer array can be split into one or more increasing subsequences with a length of at least 3.
Check if the array can be split into increasing subsequences by iterating through the array.
Keep track of the current subsequence and its length while iterating.
If the difference between the current element and the previous element is not 1, start a new subsequence.
If the length of any subseque...
Round duration - 60 Minutes
Round difficulty - Easy
The interview started a bit late as I it to be at 11:30 am but started at 12:15pm So Had to wait. Apart from these the overall experience was great and the interviewer was also kind and had a smiling face.
Ninja is given a sequence of numbers and needs to rearrange them so that every second element is greater than its neighbors on both sides.
The task is to rearrange the given array such that every second element is greater than its left and right element.
Iterate through the array and check if every second element is greater than its left and right element
If not, swap the current element with its adjacent element to satisfy the condition
Continue this process until the entire array satisfies the condition
Return 1 if the array satisfies the condition, else re
Round duration - 30 Minutes
Round difficulty - Easy
10:30 PM
Interviewer was Cool.
Round duration - 5 minutes
Round difficulty - Easy
At 10:00 am
Tip 1 : Never never try to cheat in online interview the interviewer will definitely get to know.
Tip 2 : Psuedo code presentation matters a lot so name Your variable properly and with proper indentation.
Tip 3 : Keep on trying even if You feel that's not the right answer so at least put that idea forward.
Tip 4 : Do Leetcode medium questions as much as possible As they are mostly asked in Interviews.
Tip 1 : Avoid unnecessary details on Resume
Tip 2 : Make It look clean and also keep it of one page
Relationship Manager
143
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Manager
126
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
105
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Executive
104
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Sales Manager
104
salaries
| ₹0 L/yr - ₹0 L/yr |
PolicyBazaar
Coverfox
Turtlemint
ACKO