i
Sierra ODC
Filter interviews by
I applied via Campus Placement and was interviewed before Mar 2023. There were 2 interview rounds.
Logical questions and basic coding questions
posted on 7 Sep 2015
I applied via Referral
posted on 27 Apr 2024
I applied via Campus Placement and was interviewed in Mar 2024. There were 3 interview rounds.
Time distance and basic puzzle questions,6 questions in 45 minutes
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
posted on 21 Feb 2025
I appeared for an interview before Feb 2024.
I have a strong technical background, a passion for problem-solving, and a proven track record of delivering high-quality software solutions.
Extensive experience in software development, including proficiency in multiple programming languages such as Java, Python, and JavaScript.
Strong problem-solving skills and ability to think critically to find innovative solutions to complex technical challenges.
Proven track record...
posted on 29 Jul 2021
Rotate a matrix by 90 degrees clockwise
Transpose the matrix
Reverse each row of the transposed matrix
Alternatively, swap elements in-place layer by layer
Example: [[1,2],[3,4]] -> [[3,1],[4,2]]
posted on 30 Oct 2023
C# is a programming language developed by Microsoft for building a wide range of applications on the .NET framework.
C# is an object-oriented language with features like classes, inheritance, and polymorphism.
It is strongly typed, meaning variables must be declared with a specific data type.
C# supports modern programming concepts like async/await for asynchronous programming.
It is commonly used for developing desktop, w...
Interview for backend developer with experience in django
Django's request response flow involves the request being handled by URL dispatcher, views, middleware, and templates before generating a response.
Request is received by URL dispatcher which maps the URL to a view function
View function processes the request, interacts with models if needed, and returns a response
Middleware can intercept the request and response for additional processing
Templates are used to generate HT
based on 1 interview
Interview experience
based on 9 reviews
Rating in categories
Software Engineer
53
salaries
| ₹1.4 L/yr - ₹8.5 L/yr |
Softwaretest Engineer
45
salaries
| ₹1.5 L/yr - ₹6.1 L/yr |
Software Developer
21
salaries
| ₹2.6 L/yr - ₹5.2 L/yr |
Senior Software Engineer
10
salaries
| ₹5 L/yr - ₹9.5 L/yr |
Mobile Application Developer
8
salaries
| ₹1.8 L/yr - ₹4.8 L/yr |
Prime Focus Technologies
Yalamanchili Software Exports
Algonomy
Mindfire Solutions