Filter interviews by
Clear (1)
I applied via Campus Placement
Aptitude eady to medium ques
Interview round easy to medium ques were asked os sql
Top trending discussions
To merge two double linked lists, traverse to the end of the first list and connect it to the head of the second list.
Traverse to the end of the first list
Connect the last node of the first list to the head of the second list
If the lists are singly linked, we need to traverse to the end of the first list and connect it to the head of the second list. But we also need to keep track of the last node of the first list to ...
A dynamic data structure for storing images as arrays of strings.
Use a 2D array of strings to represent the image pixels.
Implement resizing methods to adjust the size of the image.
Include methods for adding, removing, and modifying pixels.
Consider using compression techniques to reduce memory usage.
Support various image formats such as JPEG, PNG, and BMP.
Copying fixed number of bytes from source to destination and its test cases.
Ensure source and destination are not overlapping
Check if the number of bytes to be copied is greater than the available space in the destination
Handle cases where source or destination is NULL
Test cases should cover all possible scenarios including edge cases
An optimized Fibonacci program computes Fibonacci numbers efficiently.
Use memoization to store previously computed values.
Use iterative approach instead of recursive approach.
Use bitwise operators to perform arithmetic operations faster.
Use matrix exponentiation to compute Fibonacci numbers in logarithmic time.
Virtual functions can cause problems due to their dynamic nature, but can be solved using various techniques.
Use pure virtual functions to ensure all derived classes implement the function
Use interface classes to define a common interface for all derived classes
Use smart pointers to manage memory and avoid memory leaks
Use virtual destructors to ensure proper destruction of objects
Avoid excessive use of virtual function
I applied via Job Portal and was interviewed in Nov 2024. There were 2 interview rounds.
DSA, tree questions basic
Develop an Instagram clone with additional features for liking and commenting.
Implement a like button for users to like posts
Allow users to leave comments on posts
Include notifications for likes and comments
Implement a search functionality to find specific posts or users
I applied via Campus Placement and was interviewed in Nov 2024. There were 2 interview rounds.
4 sections verbal logical aptitude and coding(in C)
Creating patterns of triangle and diamond using characters
For triangle pattern, use nested loops to print spaces and characters in each row
For diamond pattern, divide the diamond into two triangles and print accordingly
Examples: Triangle pattern - * ** *** Diamond pattern - * *** ***** *** *
Discussing past projects in depth to showcase skills and experience
Explain the problem statement and your approach
Discuss the technologies used and challenges faced
Highlight your contributions and the outcome
Mention any learnings or improvements for future projects
Apti test was easy 30 min test
I have 5 years of experience in software development.
I have worked in various roles such as software engineer, senior software engineer, and team lead over the past 5 years.
During my time in the industry, I have gained experience in developing web applications, mobile apps, and backend systems.
I have also worked with technologies such as Java, Python, JavaScript, and SQL.
I have experience in Agile methodologies and hav...
My current CTC is $80,000 per year.
My current CTC is $80,000 per year.
I am currently earning $80,000 annually.
My current salary package is $80,000 per annum.
I applied via Campus Placement and was interviewed in Aug 2023. There was 1 interview round.
DSA,COMPUTER FUNDAMENTALS
Tree traversals are methods used to visit each node in a tree data structure in a specific order.
Inorder traversal: Visit left subtree, then root, then right subtree
Preorder traversal: Visit root, then left subtree, then right subtree
Postorder traversal: Visit left subtree, then right subtree, then root
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
Find 5 missing numbers in an array of size 95 containing numbers in range 1 to 100.
Create a boolean array of size 100 and mark the present numbers
Iterate through the boolean array and find the missing numbers
Alternatively, use a HashSet to store the present numbers and find the missing ones
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
based on 1 interview
Interview experience
Senior Software Engineer
141
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer
44
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
42
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Developer
42
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Lead
36
salaries
| ₹0 L/yr - ₹0 L/yr |
Amadeus
Expedia Group
Booking Holdings
CWT