Filter interviews by
I applied via Naukri.com and was interviewed in Jul 2024. There were 2 interview rounds.
I applied via Campus Placement and was interviewed in Sep 2021. There was 1 interview round.
I appeared for an interview in Jan 2021.
Round duration - 120 minutes
Round difficulty - Hard
This round was very difficult. I never do these much difficulty level of coding questions. But i give my best, and just do every questions by using step by step process.
Given an integer 'N', print an hourglass pattern based on the value of 'N'.
The first and only line of input contains an integer, denoting the value of N.
Print an hourglass pattern based on the given integer 'N'.
Read the integer 'N' as input
Print the top half of the hourglass pattern with decreasing numbers
Print the bottom half of the hourglass pattern with increasing numbers
Handle the constraints for 'N' values between 1 and 50
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
BFS traversal in a disconnected graph starting from vertex 0.
Use BFS algorithm to traverse the graph starting from vertex 0.
Explore neighbor nodes first before moving to the next level neighbors.
Consider bidirectional edges in an undirected graph.
Output the BFS traversal sequence for each test case in a separate line.
Ensure the BFS path starts from vertex 0 and print connected nodes in numerical sort order.
You are given a stack. Your task is to sort the elements within the stack in ascending order using only push and pop operations. You are allowed to use one additional stack ...
Sort a given stack in ascending order using only push and pop operations with the help of an additional stack.
Use one additional stack to assist in sorting the elements.
Pop elements from the input stack and push them onto the auxiliary stack in sorted order.
Keep track of the current minimum element to maintain ascending order.
Pop elements from the auxiliary stack back to the input stack to get the sorted order.
Round duration - 90 minutes
Round difficulty - Easy
This round is also coding round in this round we have a small video call interaction too, in which hr ask few questions to only those whose coding question is correct.
You are given a palindrome number represented as a string S
. Your task is to find the largest palindrome number that is strictly less than S
.
T...
Find the largest palindrome number strictly less than a given palindrome number.
Iterate from the middle towards the start of the number and decrement the digits to create the largest palindrome less than the given number.
Handle cases where the number is all '9's by changing the middle digit to '9' and decrementing the rest of the digits.
If the number has an odd length, simply mirror the first half to create the largest
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find minimum time to rot all fresh oranges adjacent to rotten oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process.
Track the time taken to rot all fresh oranges.
Return -1 if all fresh oranges cannot be rotten.
Handle edge cases like empty grid or no fresh oranges.
Tip 1 : Relax and don't stress. Practice
Tip 2 : Build Resume according to Job Description , but don't lie.
Tip 3 : Have good projects and knowledge regarding important subjects related to interviews
Tip 1 : Include only genuine information, never lie in resume , it will impact to bad impression.
Tip 2 : Skills relevant to Job Description
Tip 3 : Resume should not be more than 2 pages
Tip 4 : Have some projects and internship on your resume because it will give good impression
I applied via Campus Placement
Aptitude questions with 2-3 coding questions
Interpreter executes code line by line, compiler translates code into machine code before execution.
Interpreter translates code into machine code line by line during runtime
Compiler translates code into machine code before execution
Interpreted languages include Python, JavaScript
Compiled languages include C, C++
I applied via Job Fair and was interviewed before Oct 2023. There were 3 interview rounds.
There were few aptitude questions
posted on 13 Jan 2025
Logical reasoning, problem solving
I applied via Company Website and was interviewed in Jan 2024. There was 1 interview round.
Got a total of 3 questions with duration of 20- 25 mins for each.
I applied via Approached by Company and was interviewed in Sep 2023. There were 2 interview rounds.
There were 3 q.s given in each sets. For each q.s time limit was 20 min. They were not mcq and kind of tricky.
It also had 3 q.s based on arrays matrix and one logic based. Kinda tough fr me
I applied via LinkedIn
2 hour basic development aptitude question
posted on 29 Nov 2024
I applied via AmbitionBox
Java, spring,springboot
based on 1 interview
Interview experience
DOT NET Developer
16
salaries
| ₹2 L/yr - ₹6 L/yr |
Software Developer
15
salaries
| ₹2.2 L/yr - ₹8.5 L/yr |
Software Engineer
10
salaries
| ₹2.2 L/yr - ₹7.2 L/yr |
Team Lead
10
salaries
| ₹8.3 L/yr - ₹17.4 L/yr |
Project Manager
9
salaries
| ₹7 L/yr - ₹20 L/yr |
Prime Focus Technologies
Yodlee
MapmyIndia
BrowserStack