i
Porter
Filter interviews by
Clear (1)
I applied via Referral and was interviewed before Apr 2023. There were 3 interview rounds.
Find the maximum sum path in a tree from root to leaf node.
Start from the root node and traverse down to leaf nodes, keeping track of the sum at each node.
At each node, compare the sum of the current path with the maximum sum found so far.
Choose the path with the maximum sum as the final result.
Create a simple timer using React
Use state to store the timer value
Use setInterval to update the timer every second
Display the timer value in the component's render method
Top trending discussions
I applied via LinkedIn and was interviewed in May 2024. There was 1 interview round.
1 Hr coding round, Leetcode medium problems like Minimum Grid sum & Basic calculator
My mostly question were around node js frame works and other tools
I applied via Campus Placement and was interviewed in Feb 2024. There were 2 interview rounds.
Question are very tough and faad
Question like trees linked list and graphs
Given a matrix of zeros and ones, find the minimum distance for each one to a zero.
Use breadth-first search (BFS) to find the minimum distance from each one to a zero.
Start by initializing a queue with all the zeros in the matrix.
While the queue is not empty, dequeue a zero and enqueue its neighboring ones.
Keep track of the distance from each one to the nearest zero.
Repeat until all ones have been visited.
Return the ma
I applied via LinkedIn and was interviewed before Aug 2023. There were 3 interview rounds.
30mins aptitude test
90 mins coding test for 3 questions
I am choosing this role because of my passion for creating user-friendly and visually appealing websites.
Passion for front end development
Enjoy creating user-friendly interfaces
Excited about the creative aspect of web design
I am a dedicated and skilled front end developer with a passion for creating user-friendly interfaces.
I have a strong understanding of HTML, CSS, and JavaScript
I have experience with responsive design and cross-browser compatibility
I am proficient in using front end frameworks like React and Angular
Coding a frontend UI from provided image. And creating a fucntional star rating system
Designing a Component API in React using Typescript involves defining props, state, and methods for the component.
Define the props interface to specify the expected input data for the component
Use typescript types to ensure type safety and prevent runtime errors
Define the state interface to manage the internal state of the component
Implement methods to handle user interactions and component logic
Document the component
Function to clear all timer ids at once
Create an array to store all timer ids
Iterate through the array and clear each timer id using clearTimeout() function
I applied via Campus Placement and was interviewed before Apr 2023. There were 2 interview rounds.
The first circular tour that visits all petrol pumps can be found using the concept of a circular linked list.
Create a circular linked list with each node representing a petrol pump
Calculate the difference between petrol available at each pump and the distance to the next pump
Start from a pump where the sum of differences is positive and traverse the circular linked list until completing the tour
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
This was MCQ+Coding round.
Check if two strings are anagrams by comparing the sorted versions of the strings.
Sort both strings and compare if they are equal.
Use a hashmap to store the frequency of characters in each string and compare the maps.
Ignore spaces and punctuation when comparing the strings.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.
Add projects and Internships if you have done any and add only those things which you really know.
Final outcome of the interviewSelectedI was interviewed before Sep 2020.
Round duration - 90 Minutes
Round difficulty - Medium
Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.
You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...
Detect cycle in a directed graph using depth-first search (DFS) algorithm.
Use DFS to traverse the graph and detect back edges indicating a cycle.
Maintain a visited array to keep track of visited nodes during traversal.
If a node is visited again during traversal and it is not the parent node, then a cycle exists.
Return true if a cycle is detected, false otherwise.
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
You are given a number in string format, a...
Find the next smallest palindrome greater than a given number represented as a string.
Convert the string to an integer, find the next greater palindrome, and convert it back to a string.
Handle cases where the number is a palindrome or has all digits as '9'.
Consider both odd and even length numbers when finding the next palindrome.
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 11:00 am. Interview went well.
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
The first line ...
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
Traverse the left boundary nodes in a top-down manner
Traverse the leaf nodes from left to right
Traverse the right boundary nodes in a bottom-up manner
Handle cases where duplicates occur in the boundary nodes
Implement the function without printing as printing is already managed
Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. Learn them by heart.
Tip 2 : For Web.Development Try to learn full stack development. See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.
Tip 1 : Always try to make it a single page
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.
based on 1 interview
Interview experience
Business Associate
260
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Executive
223
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
96
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Business Associate
78
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Manager
73
salaries
| ₹0 L/yr - ₹0 L/yr |
Dunzo
Flipkart
Amazon
Snapdeal