Filter interviews by
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
I applied via Naukri.com and was interviewed in May 2024. There were 2 interview rounds.
Implement a counter using closure in JavaScript.
Create a function that returns another function which increments a counter variable.
The counter variable should be defined in the outer function's scope and only accessible to the inner function.
Each time the inner function is called, increment the counter variable and return its value.
Promises are objects representing the eventual completion or failure of an asynchronous operation. promise.all() is a method that takes an array of promises and returns a single promise that resolves when all of the promises have resolved.
Promises are used in JavaScript to handle asynchronous operations.
promise.all() takes an array of promises and returns a single promise that resolves when all promises in the array ha...
Machine coding round
Developed a web application for managing inventory and sales for a retail store
Used React.js for front-end development
Implemented Node.js for back-end functionality
Utilized MongoDB for database management
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development technologies
Strong problem-solving skills
Team player with excellent communication skills
Leecode medium level question
Leetcode Hard level Question
posted on 31 May 2022
I was interviewed in Apr 2022.
Round duration - 75 minutes
Round difficulty - Medium
Test Comprises of 3 coding questions and some MCQs
Round duration - 60 minutes
Round difficulty - Medium
2 coding questions of (1 easy and 1 medium level) on hackerrank code-pair with the Interviewer
Round duration - 60 minutes
Round difficulty - Easy
This Round was based on CS fundamentals and One coding question was there as a Code-pair.
Given a list of integers of size N
, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X
is the firs...
Find the Next Greater Element for each element in a list of integers.
Iterate through the list of integers from right to left.
Use a stack to keep track of elements whose NGE is yet to be found.
Pop elements from the stack until a greater element is found or the stack is empty.
Assign the NGE as the top element of the stack or -1 if the stack is empty.
Tip 1 : Require coding skills to pass the interview.
Tip 2 : Brush up on Java Skills
Tip 3 : Brush up on OOPS
Tip 1 : Keep it to one page
Tip 2 : Mention relevant skills as per the job
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
I applied via LinkedIn and was interviewed before Feb 2023. There were 2 interview rounds.
- simple basic ios questions
posted on 15 Sep 2021
I was interviewed in Dec 2020.
Round duration - 90 minutes
Round difficulty - Medium
Total of 8 questions:
4 MCQ(oops and expected output type questions) + other 2 were coding questions, out of which one is some class implementation question.
Given an array ARR
and an integer K
, your task is to count all subarrays whose sum is divisible by the given integer K
.
The first line of input contains an...
Round duration - 60 minutes
Round difficulty - Easy
This round was with the USA team, the panel consisted of 2 members. It took place at around 9 PM IST. The interviewer's focus was on approach.
You are given an unsorted array ARR
. Your task is to sort it so that it forms a wave-like array.
The first line contains an integer 'T', the number of test cases.
For ea...
Given an integer number num
, your task is to convert 'num' into its corresponding word representation.
The first line of input contains an integer ‘T’ denoting the number o...
Round duration - 40 minutes
Round difficulty - Easy
It was a managerial round. The position of the person taking the interview was of a technical architect. As was informed by the recruiter, previously he was a technical architect at Amazon.
Tip 1 : Practice the most frequent and most common questions DSA questions asked in companies like Amazon, Microsoft.
Tip 2 : Focus on solving the questions on your own as much as you can.
Tip 3 : Don't waste your time on the number of questions while compromising quality.
Tip 4 : Do mock interviews with your friend if it's been a long since you have given the interview.
Tip 5 : For virtual interviews, always have a backup of data(you may use mobile data if Wi-Fi goes out). While during an interview try to maintain eye contact every now and then.
Tip 6 : Keep your resume short to 1 page and have far/good knowledge of the tech stack you have mentioned
Tip 1 : Keep it short to 1 page
Tip 2 : Prepare it well.
Tip 3 : Focus more on the problem and the solution. Rather than tools used to solve the problem
based on 2 reviews
Rating in categories
Software Developer
29
salaries
| ₹4.3 L/yr - ₹13.5 L/yr |
Senior Support Analyst
18
salaries
| ₹4.9 L/yr - ₹8 L/yr |
Business Analyst
13
salaries
| ₹8 L/yr - ₹12 L/yr |
Software Engineer
12
salaries
| ₹4.5 L/yr - ₹12.2 L/yr |
Support Analyst
10
salaries
| ₹3.6 L/yr - ₹6 L/yr |
Oracle
Salesforce
SAP
Microsoft Corporation