i
Nimap Infotech
Filter interviews by
I am familiar with technologies such as Java, Python, SQL, HTML, CSS, and JavaScript.
Java
Python
SQL
HTML
CSS
JavaScript
Typical machine coding round for frontend developer.
Aptitude Round 80 Questions in 60 min
It was Also Aptitude round but its on pen and paper
posted on 5 Aug 2022
I applied via campus placement at NMIMS University, Shirpur and was interviewed in Jul 2022. There were 2 interview rounds.
Basic aptitude with a bit of verbal with 2 coding questions of easy difficulty
OOPS is a programming paradigm that focuses on objects and their interactions. The 4 pillars of OOPS are encapsulation, inheritance, polymorphism, and abstraction.
Encapsulation: Bundling data and methods together in a class to hide implementation details.
Inheritance: Creating new classes from existing ones, inheriting properties and behaviors.
Polymorphism: Objects of different classes can be treated as objects of a com...
Code Snept question with 3-4 Reasoning question. Google form
Pen paper coding round. String , Array . Linkedlist , graph, questions
To find the nearest prime number, iterate from the given number in both directions until a prime number is found.
Start iterating from the given number in both directions to find the nearest prime number.
Check if a number is prime by dividing it by all numbers less than its square root.
Keep track of the closest prime number found during the iteration.
Find the second maximum number in an array of strings.
Convert the array of strings to an array of integers.
Sort the array in descending order.
Return the second element in the sorted array.
posted on 10 Sep 2024
I was interviewed in Aug 2024.
It was easy difficulty.
I applied via Naukri.com and was interviewed in Jul 2024. There were 2 interview rounds.
posted on 5 Dec 2024
I applied via Campus Placement
posted on 17 Oct 2024
I applied via Walk-in
To implement a queue using a stack, use two stacks and simulate the queue operations.
Use two stacks, one for enqueue operation and one for dequeue operation.
For enqueue operation, simply push elements onto the stack used for enqueueing.
For dequeue operation, if the dequeue stack is empty, pop all elements from enqueue stack and push onto dequeue stack.
Then pop from the dequeue stack to simulate dequeue operation.
A linked list is a data structure consisting of nodes where each node points to the next node in the sequence.
Create a Node class with data and next pointer
Initialize a head pointer to null
Add nodes by updating next pointers
Traverse the list by following next pointers
I applied via Campus Placement
Dsa problems dp and tress problem
I am a passionate software engineer with 5 years of experience in developing web applications using various technologies.
5 years of experience in software development
Proficient in developing web applications
Skilled in using various technologies
Passionate about software engineering
based on 6 reviews
Rating in categories
Software Developer
80
salaries
| ₹2.3 L/yr - ₹9 L/yr |
Software Engineer
27
salaries
| ₹3.2 L/yr - ₹10.8 L/yr |
Associate Software Developer
27
salaries
| ₹2 L/yr - ₹8 L/yr |
Java Developer
19
salaries
| ₹1.9 L/yr - ₹4 L/yr |
Android Developer
16
salaries
| ₹4.5 L/yr - ₹12 L/yr |
TCS
Infosys
Wipro
HCLTech