Filter interviews by
Clear (1)
HR is in the meet with live video call with all students and then have to attempt the test
Asked related to current topics
My hobbies include coding personal projects, playing video games, and hiking in nature.
Coding personal projects: I enjoy working on side projects to improve my skills and explore new technologies.
Playing video games: I find relaxation and enjoyment in playing video games, especially ones with strategic elements.
Hiking in nature: I love spending time outdoors, exploring new trails and enjoying the beauty of nature.
I have 5 years of experience in software development, specializing in web applications using Java and JavaScript.
5 years of experience in software development
Specialize in web applications
Proficient in Java and JavaScript
Top trending discussions
To invoke an XML file using LibXML, use the xmlReadFile() function.
Include the libxml/parser.h header file.
Use the xmlReadFile() function to read the XML file and create a xmlDocPtr object.
Use the xmlDocGetRootElement() function to get the root element of the XML document.
Use the xmlNodeGetContent() function to get the content of a node.
Use the xmlFreeDoc() function to free the memory allocated for the xmlDocPtr object...
Qunatative, Reasoning, Blood Relation
I applied via Campus Placement and was interviewed in Sep 2023. There were 3 interview rounds.
Aptitude Test + Technical Questions + One Coding Question
Detect loop in a singly linked list
Use two pointers, one moving one step at a time and the other moving two steps at a time
If there is a loop, the two pointers will eventually meet
If any of the pointers reach the end of the list, there is no loop
The 2 Sum problem involves finding a pair of numbers in an array that adds up to a given target.
Use a hash table to store the complement of each number as you iterate through the array.
Check if the current number's complement exists in the hash table.
If found, return the indices of the two numbers.
If no pair is found, return an empty array.
I applied via Walk-in and was interviewed before Mar 2022. There were 3 interview rounds.
Mid level programming and mcq questions
I applied via Naukri.com and was interviewed before Aug 2023. There were 3 interview rounds.
Logical and reasoning, Maths
Basic coding Java & C
I applied via Campus Placement
Discuss cons and pro for is education important to become successful in life?
I was interviewed in Oct 2020.
Round duration - 70 minutes
Round difficulty - Medium
Timing: Window for 2 days
Environment: Online
Time: 50 Min. for 50 MCQ and 20 min for 2 Coding Questions
Design a seating arrangement for a high-security meeting. There are 'N' rows of tables set up where the first row contains one table, the second row contains two tables, a...
Design a seating arrangement for a high-security meeting with specific table assignments for security personnel and guests.
Create a loop to iterate through each row from 1 to N.
Assign tables on either end of each row to security personnel.
For rows with only one table, assign it to security personnel.
Display the seating arrangement with the number of people at each table.
Example: For 4 rows, the output pattern is 1, 11,
You are provided with a list of 'N' non-overlapping intervals, each defined by two integers, 'start' and 'end', sorted in ascending order by 'start' values. Your task is ...
The task is to insert a given interval into a list of non-overlapping intervals while maintaining sorted order.
Iterate through the list of intervals to find the correct position to insert the given interval.
Merge any overlapping intervals with the given interval.
Update the list of intervals accordingly.
Handle edge cases such as when the given interval completely overlaps with existing intervals.
Round duration - 45 minutes
Round difficulty - Medium
Timing: Morning
Environment: On MS-Teams
Sort the given array of integers in ascending order using the quick sort algorithm. Quick sort is a divide-and-conquer algorithm where a pivot point is chosen to partition the...
Quick sort is a divide-and-conquer algorithm that sorts an array by choosing a pivot point and partitioning the array into two parts recursively.
Choose a pivot element (e.g., rightmost element) to partition the array into two subarrays.
Recursively apply quick sort to the subarrays until the entire array is sorted.
Time complexity can be optimized to NlogN in the worst case by selecting the pivot strategically.
Ensure the...
Tip 1 : For DS and Algo, keep practicing every day on Leetcode, HackerEarth, and make a habit of participating in contests.
Tip 2 : Projects are vital in interviews, have at least 3 projects on Resume, in the field/profile which you're applying for.
Tip 3 : Give Mock Interviews.
Tip 1 : Resume should be short and keep it under 1 page.
Tip 2 : Include skills that you're 100% confident in.
Tip 3 : Highlight your internships and projects section appropriately
I applied via Job Portal and was interviewed in Sep 2024. There was 1 interview round.
based on 1 interview
Interview experience
based on 4 reviews
Rating in categories
Research Analyst
95
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Research Analyst
32
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Patent Analyst
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Market Analyst
6
salaries
| ₹0 L/yr - ₹0 L/yr |
EXL Service
Access Healthcare
S&P Global
AGS Health