i
Vahanwire
Filter interviews by
I applied via Naukri.com and was interviewed in Nov 2024. There were 3 interview rounds.
Top trending discussions
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
Computer Fundamentals
Flatten a binary tree by converting it into a linked list in-place.
Use a recursive approach to flatten the binary tree.
Traverse the tree in a pre-order manner and keep track of the previous node.
Set the left child of each node to null and the right child to the next node in the linked list.
Example: Input: 1 -> 2 -> 5 -> 3 -> 4 -> null, Output: 1 -> null -> 2 -> null -> 3 -> null -> 4 -> null -> 5 -> null
Leecode medium level question
Leetcode Hard level Question
I applied via campus placement at National Institute of Technology,(NIT), Delhi and was interviewed before Mar 2023. There were 3 interview rounds.
Kadance algorithm and find the middle of the linklist
More on java and Python based coding questions
Python Django is a popular web framework for developing and deploying web applications.
Use virtual environments to manage dependencies
Utilize Django's built-in admin interface for managing data
Deploy Django projects using platforms like Heroku or AWS
Consider using Docker for containerization
Implement continuous integration and deployment pipelines
I applied via Company Website and was interviewed in Oct 2024. There were 2 interview rounds.
1 hour duration. Sliding window problem. On hacker rank platform. Expected to write a working code and solve it optimally/scalable solution.
posted on 24 Jul 2024
I applied via Approached by Company and was interviewed in Jan 2024. There were 3 interview rounds.
Design a parking lot system including classes, functions, and data structures.
Create a ParkingLot class with attributes like capacity, available spots, and a list of parking spots.
Implement a Vehicle class with attributes like license plate number, size, and type.
Design a ParkingSpot class with attributes like spot number, availability, and size.
Use data structures like arrays or lists to manage parking spots and vehic...
I applied via Recruitment Consultant and was interviewed in Sep 2020. There were 4 interview rounds.
Merge two lists with different intervals based on overlapping intervals.
Sort both lists based on start time.
Iterate through both lists and compare intervals for overlap.
Merge overlapping intervals and add non-overlapping intervals to the result list.
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
Computer Fundamentals
Flatten a binary tree by converting it into a linked list in-place.
Use a recursive approach to flatten the binary tree.
Traverse the tree in a pre-order manner and keep track of the previous node.
Set the left child of each node to null and the right child to the next node in the linked list.
Example: Input: 1 -> 2 -> 5 -> 3 -> 4 -> null, Output: 1 -> null -> 2 -> null -> 3 -> null -> 4 -> null -> 5 -> null
based on 1 review
Rating in categories
MagicPin
Stylebaazar
Nestaway
Awign Enterprises