Filter interviews by
I appeared for an interview before Jan 2021.
posted on 5 May 2019
I applied via Campus Placement and was interviewed in Sep 2018. There were 5 interview rounds.
posted on 24 May 2023
I applied via Campus Placement and was interviewed before May 2022. There were 2 interview rounds.
Ratio of radius of inscribed and circumscribed circles of a square of side length a.
The radius of the inscribed circle is half the length of the side of the square.
The radius of the circumscribed circle is half the diagonal of the square.
Ratio of radius of inscribed and circumscribed circles is 1:2.
To find the coordinates of point p1, use the distance formula and the collinearity of the three points.
Use the distance formula to find the distance between p1 and p2.
Use the slope formula to find the slope of the line passing through p2 and p3.
Use the slope and distance to find the equation of the line passing through p2 and p3.
Use the equation of the line and the coordinates of p2 to find the coordinates of p1.
To determine if p4 lies inside or outside the circle with p1, p2, and p3 coordinates.
Calculate the equation of the circle using p1, p2, and p3 coordinates.
Check the distance between p4 and the center of the circle.
If the distance is less than the radius of the circle, p4 lies inside the circle, otherwise outside.
posted on 5 Jul 2024
To determine if a point is inside a circle, calculate the distance between the point and the center of the circle and compare it to the radius.
Calculate the distance between the point and the center of the circle using the distance formula: sqrt((x2-x1)^2 + (y2-y1)^2)
Compare the calculated distance to the radius of the circle. If the distance is less than the radius, the point is inside the circle.
For example, if the c...
posted on 30 Aug 2023
I applied via Naukri.com and was interviewed in Jul 2023. There were 3 interview rounds.
posted on 20 Jan 2025
I applied via Campus Placement and was interviewed in Dec 2024. There were 4 interview rounds.
Arithmetic, verbal, and verbal skills.
Please write a code for generating the Fibonacci sequence.
C is a powerful and efficient programming language known for its low-level features and flexibility.
Key features include: low-level memory access, efficient manipulation of pointers, strong support for procedural programming, and a rich library of built-in functions.
Concepts include: data types, control structures (such as loops and conditionals), functions, arrays, and pointers.
Example: In C, you can directly access a...
An array is a data structure that stores a collection of elements of the same type in a contiguous memory location.
Arrays have a fixed size determined at the time of declaration.
Elements in an array are accessed using an index starting from 0.
Example: string[] names = {"Alice", "Bob", "Charlie"};
I can start within 2 weeks of receiving an offer.
I can start within 2 weeks of receiving an offer.
I need to give notice to my current employer.
I may need time to relocate if necessary.
posted on 28 Jul 2024
Bit operations in C language involve manipulating individual bits within a data structure.
Bitwise AND (&) - sets a bit to 1 only if both input bits are 1
Bitwise OR (|) - sets a bit to 1 if either input bit is 1
Bitwise XOR (^) - sets a bit to 1 if the input bits are different
Bitwise NOT (~) - inverts all bits in a number
Left shift (<<) - shifts bits to the left by a specified number of positions
Right shift (>>) - shifts
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
based on 56 reviews
Rating in categories
Software Engineer
30
salaries
| ₹1.1 L/yr - ₹5.6 L/yr |
Business Analyst
24
salaries
| ₹1.8 L/yr - ₹5.4 L/yr |
Quality Analyst
22
salaries
| ₹1.8 L/yr - ₹4 L/yr |
QA Analyst
12
salaries
| ₹1.8 L/yr - ₹3 L/yr |
SQL Developer
12
salaries
| ₹1.8 L/yr - ₹2.7 L/yr |
Prime Focus Technologies
Yalamanchili Software Exports
ScoreMe Solutions
Algonomy