Filter interviews by
Clear (1)
I am a software developer with 5 years of experience in developing web applications using Java, JavaScript, and SQL.
5 years of experience in software development
Proficient in Java, JavaScript, and SQL
Developed web applications for various clients
Strong problem-solving skills
Excellent team player
As a Software Developer, my roles and responsibilities include designing, developing, testing, and maintaining software applications.
Designing and developing software applications based on client requirements
Testing and debugging code to ensure functionality and performance
Collaborating with team members to brainstorm and implement new features
Maintaining and updating existing software applications
Staying up-to-date wi
Bug lifecycle involves identification, reporting, fixing, retesting, and closing of software bugs.
Identification: Bug is identified by testers or users through testing or real-world usage.
Reporting: Bug is reported to developers with detailed information like steps to reproduce.
Fixing: Developers analyze and fix the bug in the code.
Retesting: Testers verify the fix to ensure the bug is resolved.
Closing: Bug is closed o
Top trending discussions
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 Walk-in and was interviewed before Mar 2022. There were 3 interview rounds.
Mid level programming and mcq questions
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 Campus Placement and was interviewed before Dec 2022. There were 3 interview rounds.
Basic concepts of programming
I applied via Approached by Company and was interviewed before Jul 2021. There was 1 interview round.
To write a REST API from scratch, I would follow these steps:
Define the resources and endpoints
Choose a programming language and framework
Implement CRUD operations for each resource
Use HTTP methods and status codes correctly
Add authentication and authorization
Test the API using tools like Postman
Document the API using tools like Swagger
I applied via Naukri.com and was interviewed in Sep 2022. There were 3 interview rounds.
based on 1 interview
Interview experience
Financial Data Analyst
94
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate
84
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Analyst
58
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Associate
47
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
29
salaries
| ₹0 L/yr - ₹0 L/yr |
S&P Global
Fitch Ratings
Crisil
ICRA