i
Upstox
Filter interviews by
Top trending discussions
posted on 15 Sep 2024
OOPS (Object-Oriented Programming) is a programming paradigm based on the concept of objects, which can contain data and code.
OOPS focuses on creating objects that interact with each other to solve problems.
It involves concepts like classes, objects, inheritance, polymorphism, and encapsulation.
For example, a class 'Car' can have objects like 'Toyota', 'Honda', etc., each with their own properties and methods.
Inheritan...
I applied via Job Portal and was interviewed in Mar 2024. There was 1 interview round.
I was interviewed in Oct 2020.
Round duration - 65 minutes
Round difficulty - Medium
It was 24 hours window for the online round from 8 Oct 10:30 am to 9 Oct 10:30 am. There were 7 MCQ problems related to c++, java, DBMS, and operating systems. And 2 coding problems with one easy and one moderate level difficulty for question, we were supposed to write the whole program but for other question, the function was to be written only. I was able to solve the first problem fully and the second 50%, you are required to pass test cases.
Ram is in Ninjaland, visiting a unique candy store offering 'N' candies each with different costs. The store has a special offer: for every candy you purchase, you c...
Determine the minimum and maximum amounts of money needed to purchase all candies with a special offer.
Iterate through the candy costs array to find the minimum and maximum costs.
Consider the special offer of getting up to 'K' additional candies for free.
Calculate the minimum cost by selecting the cheapest candies and taking free ones.
Calculate the maximum cost by selecting the most expensive candies and taking free on
You are provided with a continuous non-empty string (referred to as 'sentence') which contains no spaces and a dictionary comprising a list of non-empty strings (known as 'wor...
Given a dictionary of words and a continuous string, generate all possible sentences by inserting spaces.
Use recursion to generate all possible combinations of words from the dictionary to form sentences.
Check if a substring of the sentence matches any word in the dictionary, if so, recursively call the function with the remaining substring.
Keep track of the current sentence being formed and add it to the result when t...
Round duration - 90 minutes
Round difficulty - Medium
The interviewer asked me questions about projects, general discussion, and 3 coding questions based on linked list, arrays, and binary tree.
I gave optimum approach for every question.
Given a singly linked list of integers, the task is to remove the middle node from this list.
The first line of input includes an integer 'T' whic...
Remove the middle node from a singly linked list of integers.
Identify the middle node using slow and fast pointers technique.
Update the pointers to remove the middle node.
Handle cases where there are two middle nodes by removing the first one.
Return NULL if no middle node exists.
Achieve O(N) time and O(1) space complexity with a single traversal.
Given an integer array ARR
of size N
, replace each element of this array with its corresponding rank.
The rank of an element is an integer between 1 and N
(inclusive) that ...
Replace elements in an array with their corresponding ranks based on given rules.
Iterate through the array and assign ranks based on the rules provided.
Handle equal elements by assigning them the same rank.
Return the modified array with elements replaced by their ranks.
Given a binary tree, your task is to print the left view of the tree.
The input will be in level order form, with node values separated by a...
Print the left view of a binary tree given in level order form.
Traverse the tree level by level and print the first node of each level
Use a queue to keep track of nodes at each level
Consider null nodes as well while traversing the tree
Tip 1 : First Go through all the concepts of Data Structures and algorithms, I have taken Coding ninjas course c++ interview preparation.
Tip 2 : Try to solve all the problems by yourself then it will be meant for you, if you can't solve them after 30-45 minutes of time then see the solution of it, and for this, I used to consult TA and mentors on coding ninjas course.
Tip 3 : Have confidence in yourself, if you can't solve it initially, gradually you will be able to solve the problems. Hard work pays off.
Tip 4 : Note down the main information's about your project like what you have done in the project and what difficulties you have faced, it will be a great way to tackle questions about the project in the interview.
Tip 1 : Keep it simple and mention what you actually know and achieved.
Tip 2 : Mention your institute email-id if you have, it adds weight to the resume
Tip 3 : Use the "Built/created/made X using Y to achieve Z" format when writing about projects or work done.
I was interviewed in Oct 2020.
Round duration - 90 minutes
Round difficulty - Medium
A 24 hour window was given to us and we can attempt the test anytime in between. It included 2 coding questions. One was easy-medium level and the other one was hard. Along with this 7 debugging MCQ's were given, however they were easy.
Given a square chessboard of size 'N x N', determine the minimum number of moves a Knight requires to reach a specified target position from its initial position...
Calculate minimum steps for a Knight to reach target position on a chessboard.
Use BFS algorithm to find the shortest path from Knight's starting position to target position.
Consider all possible moves of the Knight on the chessboard.
Keep track of visited positions to avoid revisiting them.
Return the minimum number of moves required to reach the target position.
Ram is in Ninjaland, visiting a unique candy store offering 'N' candies each with different costs. The store has a special offer: for every candy you purchase, you c...
Determine the minimum and maximum amount of money needed to purchase all candies with a special offer.
Iterate through the candy costs array to find the minimum and maximum costs.
Consider the special offer to calculate the minimum and maximum costs.
Keep track of the total cost and free candies obtained during the process.
Return the minimum and maximum costs for each test case.
Round duration - 50 minutes
Round difficulty - Easy
The interview was conducted around 11am in the morning. The interviewer was professional and to the point while questioning. However he gave me hints whenever I got stuck anywhere.
Given a binary tree of integers, your task is to output the right view of the tree.
The right view of a binary tree includes the nodes that are visible when the tree is observed...
The task is to output the right view of a binary tree, which includes the nodes visible when observed from the right.
Perform a level order traversal of the binary tree.
For each level, add the rightmost node to the result list.
Print the result list as the right view of the binary tree.
Handle null nodes by skipping them during traversal.
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Use Floyd's Tortoise and Hare algorithm to detect a cycle in the linked list.
Initialize two pointers, slow and fast, and move them at different speeds through the list.
If there is a cycle, the two pointers will eventually meet at some node.
If one of the pointers reaches the end of the list (null), there is no cycle.
Tip 1 : Your basics should be very clear about data structures and algorithms.
Tip 2 : Try to solve questions in a specific time frame. Also dry run your code with custom test cases, try to find the edge cases.
Apart from this try analyzing the time and space complexity of your solution.
Tip 3 : Take a look at editorials after solving the questions as it can give you a better approach to the problem.
Tip 4 : Don't neglect subjects like OOP's, DBMS and OS. Interviews ask few questions from here as well.
Tip 1 : Do not fake any skills, projects or achievements. The interviewer gets to know about it by asking questions to you.
Tip 2 : Have at-least one good project on resume with all the details like technologies used and purpose.
Tip 3 : Don't write achievements which doesn't relate to your role. Write achievements which shows communication skills, leadership or teamwork.
I was interviewed in Apr 2021.
Round duration - 60 Minutes
Round difficulty - Medium
Timing- In the evening around 5 pm
Environment- It was online test so I was in my room comfortable.
You are given an array 'PRICES' of 'N' integers, where 'PRICES[i]' represents the price of a certain stock on the i-th day. An integer 'K' is also provide...
Determine the maximum profit achievable with at most K transactions by buying and selling stocks.
Iterate through the array and keep track of the minimum price to buy and maximum profit for each transaction.
Use dynamic programming to store the maximum profit at each day with each possible number of transactions.
Consider edge cases such as when K is 0 or when the array is empty.
Example: For input N = 6, PRICES = [3, 2, 6
Round duration - 60 minutes
Round difficulty - Easy
Timing - 2pm
Environment - my room
Interviewer was pretty chilled.
Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...
Implement a stack with getMin operation in O(1) time complexity without using extra space.
Use two stacks - one to store the actual elements and another to store the minimum values encountered so far.
When pushing an element, check if it is smaller than the current minimum and if so, push it onto the minimum stack.
When popping an element, check if it is the current minimum and if so, pop from the minimum stack as well.
Fo...
Tip 1 : Be well prepared in DSA , including graphs,dp
Tip 2 : practice regularly one or two hours is enough but u need to be consistent for atleast a year or so
Tip 3 : prepare os dbms oops in last week of the interview
Tip 1 : at least Two projects
Tip 2 : Some experience in competitive programming will be beneficial.
Seeking new challenges and growth opportunities in a different environment.
Desire to work on new technologies and projects
Opportunity for career advancement
Seeking a better work-life balance
Interested in a different company culture or team dynamic
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
I was interviewed before Mar 2021.
Round duration - 90 Minutes
Round difficulty - Medium
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Use Floyd's Cycle Detection Algorithm to determine if there is a cycle in the linked list.
Maintain two pointers, one moving at double the speed of the other, if they meet at any point, there is a cycle.
If one of the pointers reaches the end of the list (null), there is no cycle.
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 for which the Next Greater Element is not yet found.
Pop elements from the stack until a greater element is found or the stack is empty.
Assign the Next Greater Element as the top element of the stack or -1 if the stack is empty.
Round duration - 60 Minutes
Round difficulty - Medium
Designing an ATM machine involves considering user interface, security measures, transaction processing, and hardware components.
User interface should be intuitive and easy to navigate for users of all ages.
Implement security measures such as PIN entry, card authentication, and encryption to protect user data.
Transaction processing should be fast and reliable, with options for cash withdrawals, deposits, transfers, and...
Round duration - 45 Minutes
Round difficulty - Easy
Tip 1 : Practice DSA daily
Tip 2 : Try to think of the solution first before jumping to the solution
Tip 3 : Go through interview experience
Tip 4 : Have mock interviews
Tip 1 : Know in depth what is there in your resume
Tip 2 : Mention your skills and work properly
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Customer Service Executive
43
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
21
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Manager
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Zerodha
HDFC Securities
Kotak Securities
IIFL Finance