i
upGrad
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
What people are saying about upGrad
I applied via LinkedIn and was interviewed in May 2021. There was 1 interview round.
I applied via Job lever and was interviewed before Sep 2021. There were 2 interview rounds.
Easy leetcode code 2 questions , HTML5 css javascript simple screen design
I applied via Referral and was interviewed before Aug 2021. There was 1 interview round.
Answer on how to list in react and the input box
Use the map function to create a list in React
Use the state to store the input value
Use onChange event to update the state when the input value changes
Use onSubmit event to handle the form submission
I applied via Job Fair and was interviewed before Nov 2023. There were 3 interview rounds.
3 coding question around prime number arrays and strings
I applied via Recruitment Consulltant and was interviewed before Feb 2023. There was 1 interview round.
I appeared for an interview in Aug 2022.
2 hrs duration with 2 easy level dsa questions and 15 around mcqs based on core cs concepts.
Implementing stack using linked list
Create a Node class with data and next pointer
Create a Stack class with top pointer
Implement push() method to add element to top of stack
Implement pop() method to remove element from top of stack
Implement peek() method to return top element without removing it
Find the first duplicate value in an array of strings.
Create a hash table to store the frequency of each string.
Iterate through the array and check if the string already exists in the hash table.
If it does, return the string. If not, add it to the hash table.
If no duplicates are found, return null or an appropriate message.
I applied via Recruitment Consulltant and was interviewed in Jul 2021. There were 4 interview rounds.
Add 2 linked lists and return final linked list
Create a new linked list to store the sum
Traverse both linked lists simultaneously and add the corresponding nodes
Handle carry over while adding nodes
If one linked list is longer than the other, add the remaining nodes to the sum list
Finding an element in a rotated sorted array.
Use binary search to find the pivot point where the array is rotated.
Determine which half of the array the target element is in.
Perform binary search on that half of the array to find the target element.
Handle edge cases such as when the target element is at the pivot point.
Given a matrix of characters and a word, find if the word exists in the matrix.
Traverse the matrix and check if the first letter of the word matches any cell.
If it does, check if the adjacent cells match the next letter of the word.
Repeat until the entire word is found or no match is found.
Algorithm to maximize profit by buying and selling stocks.
Iterate through the array of stock prices
Keep track of the minimum price seen so far
Calculate the profit if sold at current price
Update maximum profit seen so far
Return maximum profit
I applied via LinkedIn and was interviewed in Feb 2023. There were 6 interview rounds.
based on 1 interview
Interview experience
based on 3 reviews
Rating in categories
Admission Counsellor
568
salaries
| ₹2 L/yr - ₹10 L/yr |
Academic Counsellor
303
salaries
| ₹3 L/yr - ₹11.2 L/yr |
Senior Academic Counsellor
239
salaries
| ₹4 L/yr - ₹14 L/yr |
Senior Admission Counsellor
228
salaries
| ₹4.8 L/yr - ₹15.2 L/yr |
Senior Associate
208
salaries
| ₹3.2 L/yr - ₹13 L/yr |
Simplilearn
Unacademy
BYJU'S
Whitehat jr