i
Nimap Infotech
Filter interviews by
I applied via Recruitment Consulltant and was interviewed in May 2022. There were 2 interview rounds.
Logical reasoning, basic maths, English, paragraph,
Top trending discussions
posted on 4 Sep 2024
I applied via Naukri.com and was interviewed in Aug 2024. There were 2 interview rounds.
Basic aptitude question
Based on puzzle comprehension
posted on 24 Oct 2022
30 min test covers basic logic reasonings
30 min round medium level questions from leetcode
posted on 2 Apr 2025
I appeared for an interview in Mar 2025, where I was asked the following questions.
I have diverse experiences in software development through internships and projects, focusing on teamwork and problem-solving.
Interned at XYZ Corp, where I developed a web application using React and Node.js, improving user engagement by 30%.
Worked on a team project in college to create a mobile app for local businesses, enhancing my collaboration and coding skills.
Participated in hackathons, where I learned to work un...
posted on 15 Jun 2022
I applied via LinkedIn and was interviewed in Apr 2022. There were 4 interview rounds.
posted on 12 Jan 2023
I applied via Campus Placement and was interviewed before Jan 2022. There were 4 interview rounds.
This one is a combination of aptitude and coding test where medium questions abt c,cpp are asked
Do few aptitude test and some level of coding and ull be able to clear the test quite easily
posted on 1 May 2024
I applied via Campus Placement and was interviewed before May 2023. There were 2 interview rounds.
Question were based on coding 1 with linked list 1 with string and 1 sql one
posted on 1 Aug 2024
I applied via Campus Placement and was interviewed in Jul 2024. There was 1 interview round.
I applied via Walk-in and was interviewed before Mar 2021. There were 3 interview rounds.
Aptitude test
Current affairs
posted on 28 Jul 2021
I applied via Campus Placement and was interviewed before Jul 2020. There was 1 interview round.
Check if binary tree is balanced or not.
A balanced binary tree has the height of left and right subtrees differ by at most 1.
Recursively check the height of left and right subtrees and compare.
Use a helper function to calculate the height of a subtree.
Time complexity: O(nlogn) for a balanced tree, O(n^2) for a skewed tree.
Detect loops in a linked list.
Use two pointers, one moving at a faster pace than the other.
If there is a loop, the faster pointer will eventually catch up to the slower one.
To detect the start of the loop, reset one pointer to the head and move both pointers at the same pace.
based on 2 reviews
Rating in categories
Software Developer
81
salaries
| ₹2.3 L/yr - ₹8.9 L/yr |
Associate Software Developer
40
salaries
| ₹2 L/yr - ₹6.5 L/yr |
Software Engineer
30
salaries
| ₹3.2 L/yr - ₹10.8 L/yr |
Java Developer
21
salaries
| ₹1.9 L/yr - ₹6.5 L/yr |
UI/UX Designer
17
salaries
| ₹2 L/yr - ₹9 L/yr |
Maxgen Technologies
Value Point Systems
JoulestoWatts Business Solutions
F1 Info Solutions and Services