Filter interviews by
I appeared for an interview in Oct 2020.
Round duration - 90 minutes
Round difficulty - Easy
This round was scheduled for 9am in the morning. The test environment was pretty good . I didn't face any issues on the HireVeu platform. The first test was of Aptitude and then in next section it was Technical MCQ's. The level of questions were mid to high level of difficulty.
Round duration - 60 minutes
Round difficulty - Medium
The exam was on the same Platform. The first question was about the most difficult Project I've worked on. I have to record a video in that particular platform and then move to the next questions. There was option for a demo video of 1 minute in which you can practice your answers and then can record your answer in the next video of max 5 minutes. The next 2 question were Coding Problems of moderate difficulty and you've to record your approach and then proceed towards solving the code and then record a video stating if you succeed or not and what better could you've done to make it work.
Determine the sum of all N-digit palindromes for a given integer 'N'. A palindrome is defined as a number that remains the same when its digits are reversed.
...
Sum of all N-digit palindromes for a given integer N.
Generate all N-digit palindromes by iterating through digits 1 to 9 and appending the reverse of the number
Calculate the sum of all generated palindromes
Return the sum as the final result
Round duration - 45 minutes
Round difficulty - Medium
This round was scheduled for 3pm. The interviewer was quite friendly. He asked about me and told me to relax and then answer. He started with asking questions from my Project and how the ideas behind the Project. My Project was related to Deadlock So he asked whether I can implement my Project on any environment. I answered . Then one of my internship Project was related to Web development so He asked me about the backend of the Project. He gave me a few SQL queries and some general DBMS concepts based on the response about using Mysql in the Project. He asked me a few things about AWS and Cloud Computing which I answered. At last he asked some LINUX commands and corrected me once and was satisfied with my answers.
Tip 1 : Practice at least 5-7 Codes daily from the beginning of preparation.
Tip 2 : Be thoroughly prepared with concepts of Data Structure, Database and Operating System
Tip 3 : Always go through the Company's Job description and About the Company and prepare your answers according to that
Tip 4 : Only mention Projects that you've complete idea about.
Tip 1 : Have a few Projects on your resume and make sure you know it all about your Projects.
Tip 2 : Only mention the Skills you feel you are confident about. Never lie on your resume.
Top trending discussions
I applied via Company Website and was interviewed before Oct 2019. There were 4 interview rounds.
I applied via Naukri.com and was interviewed in Mar 2020. There were 4 interview rounds.
Web service flow is the sequence of steps involved in the communication between a client and a server over the internet.
Web service flow involves a client sending a request to a server
The server processes the request and sends a response back to the client
The response can be in various formats such as XML, JSON, or plain text
Web service flow can be synchronous or asynchronous
Examples of web services include RESTful API...
To check ports in Solaris or Linux machine, use the netstat command.
Open the terminal and type 'netstat -an' to display all open ports.
Use 'netstat -an | grep
To check listening ports, use 'netstat -an | grep LISTEN'.
For Solaris, use 'netstat -an | grep .
Interview questions for Software Developer related to Spring, Collections, Serialization, Exceptions, Unix, Annotations, Json, Build tools, Restful services, and more.
List and Set are both collection interfaces in Java. List allows duplicates and maintains insertion order while Set doesn't allow duplicates and doesn't maintain any order.
Sorted in Hashed Set means that the elements are stored in a sorted order based on ...
I applied via Monster and was interviewed before Apr 2020. There was 1 interview round.
A generic swap function swaps two values of any data type.
The function should take two parameters of any data type.
Use a temporary variable to store the value of one parameter.
Assign the value of the second parameter to the first parameter.
Assign the value of the temporary variable to the second parameter.
Search for an element in a rotated sorted linked list.
Find the pivot point where the list is rotated.
Divide the list into two sublists based on the pivot point.
Perform binary search on the appropriate sublist.
Handle edge cases such as empty list and list with only one element.
Search an element in a rotated sorted array
Find the pivot point where the array is rotated
Divide the array into two sub-arrays based on pivot point
Perform binary search on the appropriate sub-array
Repeat until element is found or sub-array size is 1
Given a Sudoku board, find possible numbers for an empty cell.
Iterate through empty cells and check possible numbers using row, column, and box constraints.
Use a set to keep track of possible numbers for each empty cell.
Return the set of possible numbers for the given empty cell.
Find integer average of 4 unsigned integers without typecasting
Add all the integers and divide by 4
Use bit shifting to divide by 4
Handle overflow by using long long data type
Use unsigned int data type for input
Code to identify 32 bit or 64 bit architecture of a processor
Check if the operating system is 32 bit or 64 bit
If OS is 32 bit, processor is 32 bit
If OS is 64 bit, check if processor supports 64 bit architecture
Use CPUID instruction to check if processor supports 64 bit architecture
Convert binary number to base 64 integer
Divide the binary number into groups of 6 bits
Convert each group of 6 bits to decimal
Map the decimal value to the corresponding base 64 character
Concatenate the base 64 characters to form the final integer
Creating test cases for random scenarios ensures software reliability and robustness through diverse input validation.
Identify edge cases: Test with minimum and maximum input values, e.g., an empty array vs. a large array.
Use random data: Generate random inputs to simulate real-world usage, e.g., random user names or passwords.
Test invalid inputs: Ensure the system handles unexpected inputs gracefully, e.g., negative n...
I appeared for an interview before Mar 2021.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading, trailing, and multiple spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
Handle leading, trailing, and multiple spaces appropriately
You are given a stack of integers. Your task is to reverse the stack using recursion without using any extra space other than the internal stack space used due to recursion...
Reverse a stack using recursion without using any extra space other than the internal stack space.
Use recursion to pop all elements from the original stack and store them in function call stack.
Once the stack is empty, push the elements back in reverse order.
Base case of recursion should be when the original stack is empty.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mirror of a bin...
Convert a binary tree to its mirror tree by interchanging left and right children of all non-leaf nodes.
Traverse the binary tree in a recursive manner.
Swap the left and right children of each non-leaf node.
Continue this process until all nodes have been processed.
You are given a singly linked list with 'N' nodes, each containing integer data, and an integer 'K'. Your goal is to remove the 'K'th node counting from the end of ...
Remove the Kth node from the end of a singly linked list.
Use two pointers approach to find the Kth node from the end.
Handle edge cases like removing the head node or removing the last node.
Update the pointers to remove the Kth node and reconnect the list.
Round duration - 30 minutes
Round difficulty - Easy
Typical Managerial round.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 2 reviews
Rating in categories
Software Engineer
1k
salaries
| ₹5 L/yr - ₹15.5 L/yr |
System Engineer
430
salaries
| ₹5 L/yr - ₹10 L/yr |
Senior Software Engineer
382
salaries
| ₹12.7 L/yr - ₹21.4 L/yr |
Automation Test Engineer
353
salaries
| ₹5 L/yr - ₹10 L/yr |
Software Engineer II
302
salaries
| ₹8 L/yr - ₹13.5 L/yr |
Siemens
Oracle
Amdocs
Automatic Data Processing (ADP)