i
RenewBuy
Filter interviews by
I applied via Naukri.com and was interviewed in Jul 2024. There was 1 interview round.
Slicing in Python allows you to extract a subset of elements from a list.
Slicing is done using square brackets and the start:stop:step notation.
The start index is inclusive, while the stop index is exclusive.
You can omit any of the three parameters, defaulting to 0 for start, length of list for stop, and 1 for step.
Negative indices can be used to slice from the end of the list.
Example: list = [1, 2, 3, 4, 5], list[1:4]
Asked Question from Tree nad linked list
Top trending discussions
Implement a stack using two queues
Use two queues to simulate stack operations
Push operation: Enqueue the element to queue1
Pop operation: Dequeue all elements from queue1 to queue2, dequeue the last element from queue1, then swap the queues
Top operation: Dequeue all elements from queue1 to queue2, dequeue the last element from queue1, then swap the queues without dequeuing the element
Empty operation: Check if both queue
I was interviewed in Feb 2024.
Normal nomerical qustion
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
I was interviewed before Jun 2023.
Design a parking lot system with multiple levels and spots for cars.
Create a class for ParkingLot with attributes like levels, spots per level, etc.
Implement methods for parking a car, removing a car, checking availability, etc.
Consider implementing a ticketing system for tracking parked cars.
Utilize data structures like arrays, lists, or maps to manage parking spots efficiently.
Use external sorting algorithm like merge sort to efficiently sort numbers in a large file.
Break the large file into smaller chunks that can fit into memory
Sort each chunk individually using a sorting algorithm like merge sort
Merge the sorted chunks back together to get the final sorted result
I applied via Campus Placement and was interviewed before Dec 2023. There were 2 interview rounds.
Duration 1Hr
2 coding questions
I applied via Naukri.com and was interviewed in Oct 2024. There were 4 interview rounds.
Easy level to Medium level
2 Easy questions of DSA
posted on 25 Jul 2024
posted on 8 Feb 2024
.NET Framework is a software framework developed by Microsoft that provides a runtime environment for building and running applications.
.NET Framework is a platform for developing and running applications on Windows.
It includes a large library of pre-built code and a runtime environment for executing applications.
It supports multiple programming languages such as C#, VB.NET, and F#.
It provides features like memory mana...
Joins in SQL are used to combine rows from two or more tables based on a related column between them.
There are different types of joins in SQL: inner join, left join, right join, and full outer join.
Inner join returns only the matching rows from both tables.
Left join returns all the rows from the left table and the matching rows from the right table.
Right join returns all the rows from the right table and the matching ...
based on 2 interviews
Interview experience
based on 9 reviews
Rating in categories
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