Filter interviews by
Reverse a Linked list in golang
I applied via Recruitment Consulltant and was interviewed in Jun 2024. There were 3 interview rounds.
An online assessment was conducted, during which medium-level questions from LeetCode were asked.
Onsite interview. basic coding question was asked which was asked to improve on based on constraints.
I was interviewed in Apr 2024.
I applied via LinkedIn and was interviewed in Oct 2024. There was 1 interview round.
Find the missing smallest positive integer in an array of integers
Sort the array to easily identify missing integers
Iterate through the sorted array to find the smallest missing positive integer
Return the missing integer
Sort an array of strings containing only 0, 1, and 2.
Use a three-way partitioning algorithm like Dutch National Flag algorithm to sort the array in a single pass.
Keep track of three pointers - low, mid, and high to partition the array into three sections.
Swap elements based on their values to achieve the sorted array.
Create a REST API to retrieve employee data by ID
Use a GET request to /employees/{id} endpoint
Query the database for employee data based on the provided ID
Return the employee data in JSON format
I applied via campus placement at Maulana Azad National Institute of Technology (NIT), Bhopal and was interviewed in Jul 2024. There were 2 interview rounds.
3 questions easy-medium level leetcode problem I solved 2 completely and 3rd question partially (9/15 test cases passed) to move on to 2nd round
I applied via Naukri.com and was interviewed in Apr 2024. There were 3 interview rounds.
Leaves of a tree are the nodes with no children in a tree data structure.
Traverse the tree and identify nodes with no children.
Use depth-first search or breadth-first search algorithms to find leaves.
Examples: In a binary tree, leaves are nodes with no left or right child.
In a general tree, leaves are nodes with no children in their child list.
The Lowest Common Ancestor (LCA) of a tree is the shared ancestor of two nodes farthest from the root.
Start from the root and traverse the tree to find the paths from the root to the two nodes.
Compare the paths to find the last common node between them, which is the LCA.
If one of the nodes is an ancestor of the other, then the ancestor node is the LCA.
I have worked on projects involving web development, mobile app development, and data analysis.
Developed a web application using React and Node.js for a client in the e-commerce industry
Created a mobile app using Flutter for a startup in the healthcare sector
Performed data analysis on customer behavior using Python and SQL for a marketing company
I completed internships at ABC Company and XYZ Company during my undergraduate studies.
Interned at ABC Company working on web development projects
Interned at XYZ Company assisting with software testing and quality assurance
Gained hands-on experience in coding, debugging, and problem-solving
Interview experience
based on 6 reviews
Rating in categories
Software Engineer
22
salaries
| ₹13.6 L/yr - ₹40 L/yr |
Senior Software Engineer
22
salaries
| ₹18.5 L/yr - ₹60 L/yr |
Software Engineer2
8
salaries
| ₹20 L/yr - ₹36 L/yr |
Associate Software Engineer
7
salaries
| ₹8 L/yr - ₹15.2 L/yr |
Lead Software Engineer
6
salaries
| ₹25 L/yr - ₹55 L/yr |
Datadog
Splunk
Dynatrace
AppDynamics