Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Nimap Infotech Team. If you also belong to the team, you can get access from here

Nimap Infotech Verified Tick

Compare button icon Compare button icon Compare
3.6

based on 92 Reviews

Filter interviews by

Nimap Infotech React Developer Interview Questions and Answers

Updated 22 Nov 2024

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
-

I applied via Naukri.com and was interviewed in Sep 2024. There were 3 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. React Hooks and Project experience
Round 2 - Technical 

(2 Questions)

  • Q1. Performance Optimization Techniques
  • Ans. 

    Performance optimization techniques for React JS frontend development

    • Use React.memo for optimizing functional components

    • Avoid unnecessary re-renders by using shouldComponentUpdate or PureComponent for class components

    • Implement code splitting to reduce initial load time

    • Use lazy loading for components that are not immediately needed

    • Optimize images and assets for faster loading times

    • Minimize the use of inline styles and u...

  • Answered by AI
  • Q2. Lazy Loading and other ques related to that
Round 3 - HR 

(1 Question)

  • Q1. General HR Interview
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via campus placement at Krishna Institute of Engineering and Technology, Ghaziabad and was interviewed in Oct 2024. There were 3 interview rounds.

Round 1 - Aptitude Test 

Medium level questions asked

Round 2 - Coding Test 

Simple easy to medium 2 questions asked of string and array

Round 3 - Technical 

(2 Questions)

  • Q1. Tell me about yourself
  • Q2. JavaScript like fetch axios and others
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(3 Questions)

  • Q1. Life Cycle Methods off class components
  • Ans. 

    Life cycle methods are special methods in class components that allow developers to run code at specific points in the component's life cycle.

    • componentDidMount() is called after the component has been rendered to the DOM.

    • componentDidUpdate() is called after the component's state or props have been updated.

    • componentWillUnmount() is called before the component is removed from the DOM.

  • Answered by AI
  • Q2. Diffrence between FlatList and ScrollView
  • Ans. 

    FlatList is optimized for rendering large lists efficiently by only rendering the items that are currently visible, while ScrollView renders all of its children at once.

    • FlatList is more performant for long lists as it only renders the items that are currently visible on the screen.

    • ScrollView renders all of its children at once, which can lead to performance issues with large datasets.

    • FlatList supports key extraction fo...

  • Answered by AI
  • Q3. Real World Scenories Questions

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via campus placement at S R Engineering College, Ranga Reddy and was interviewed in Jun 2024. There were 3 interview rounds.

Round 1 - Coding Test 

MCQ round with few apti, 2 coding too.

Round 2 - Technical 

(2 Questions)

  • Q1. Into, projects,
  • Q2. Print node with no edge in a unidirectional graph
  • Ans. 

    To print nodes with no edges in a unidirectional graph, iterate through all nodes and print those without any outgoing edges.

    • Iterate through all nodes in the graph

    • For each node, check if it has any outgoing edges

    • If a node has no outgoing edges, print it

  • Answered by AI
Round 3 - Technical 

(2 Questions)

  • Q1. Intro, projects, dsa
  • Q2. Prime number code

Interview Preparation Tips

Topics to prepare for Impact Analytics Backend Developer interview:
  • Binary Tree
  • DSA
  • Flask
Interview preparation tips for other job seekers - I never heard back from them, its been 6 months
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via campus placement at KIIT University, Bhuvaneshwar and was interviewed in Apr 2024. There were 3 interview rounds.

Round 1 - Coding Test 

Medium level coding questions on hackerrank ,1:30hr, topic- Array , DP , Matrix , Binary Search

Round 2 - Technical 

(1 Question)

  • Q1. Was Asked to Implement Hashmap and Question on OOPS and Dbms , SQL and Indexing
Round 3 - Technical 

(2 Questions)

  • Q1. Brief Introduction
  • Q2. Rotten Oranges and basics of bfs and DFS

Web Developer Interview Questions & Answers

Affine user image Manasa jagadeesh

posted on 9 Apr 2020

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed before Apr 2019. There were 4 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Casual talk with the manager/director of the domain.
  • Q2. Basic questions about frontend technologies
  • Q3. Basic HR questions regarding salary

I was interviewed in Feb 2021.

Round 1 - Coding Test 

(4 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Timing was 10AM. The platform was quite good.

  • Q1. Maximum size rectangle sub-matrix with all 1's

    You are given an 'N' * 'M' sized binary-valued matrix 'MAT, where 'N' is the number of rows and 'M' is the number of colum...

  • Ans. Dynamic Programming.
    1. We start from the first row and move downwards.
    2. We create three 1-dimensional arrays HEIGHT[], LEFT[], RIGHT[].
    3. ‘HEIGHT’[i]: stores the number of current continuous 1’s in column i.
    4. LEFT[i] : stores the leftmost index ‘j’ such that all indices say ‘K’, ‘K’ belongs to [j, i], ‘HEIGHT’[k] >= ‘HEIGHT’[i].
    5. RIGHT [i]: stores the rightmost index ‘j’ such that all indices say ‘K’, ‘K’ belongs to [i, j], ‘HE...
  • Answered by CodingNinjas
  • Q2. Binary Tree Maximum Path Sum

    You are given a binary tree with ‘N’ nodes.

    Your task is to find the “Maximum Path Sum” for any path.

    Note :

    1. A ‘path’ is a sequence of adjacent pair nodes with an edge ...
  • Ans. Recursive Approach

    The idea here is to use the recursion. For each node, We can calculate the maximum path sum by keeping track of the following paths:

    • Max path sum starting from Left child + Max Path sum starting from Right child + Node’s value.
    • Max path sum starting from Left child + Node’s value
    • Max path sum starting from Right child + Node’s value
    • Node’s value

     

    We then pick the maximum one among them. The root of ev...

  • Answered by CodingNinjas
  • Q3. Minimum number of swaps required to sort an array

    You have been given an array 'ARR' of 'N' distinct elements.

    Your task is to find the minimum no. of swaps required to sort the array.

    F...
  • Ans. Naive Approach

    While iterating over the array, check the current element, and if not in the correct place, replace that element with the index of the element which should have come in this place.

     

    Below is the algorithm:

    1. Create a copy of the given input array and store it in temp.
    2. Sort the temp array.
    3. Iterate over the input array, and check whether the current element is at the right place or not by comparing it with t...
  • Answered by CodingNinjas
  • Q4. Infix to Postfix

    You are given a string EXP which is a valid infix expression. Convert the given infix expression to postfix expression.

    Infix expression is of the form a op b. Where operator is is betw...

  • Ans. Stack

    We will scan the expression from left to write and if we encounter an operand we will append it to our answer. If we encounter an operator we will pop all the operators with equal or higher precedence and append them to our answer. And push the current operator. In the end, we will empty the stack.

    Order of precedence = [ ‘^’, ‘*’ and ‘/’, ‘+’ and ‘-’, ‘(’, ‘)’]

    Order of precedence [ link ]

    The algorithm will be-

    1. ANS ...
  • Answered by CodingNinjas

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in DelhiEligibility criteriaAbove 7 CGPAHike interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 2.5 monthsInterview preparation tips for other job seekers

Tip 1 : Do at least 1 project.
Tip 2 : Practice data structure questions.
Tip 3 : Dynamic programming is must.

Application resume tips for other job seekers

Tip 1 : Do not put false things.
Tip 2 : Keep it short and direct.

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(4 Questions)

Round duration - 90 minutes
Round difficulty - Medium

They share doc file link which consist of 5 programming questions

  • Q1. Reverse Words in a String

    You are given a string of length N. You need to reverse the string word by word. There can be multiple spaces between two words and there can be leading or trailing spaces but in ...

  • Ans. Brute force
    • Create a String ans to store the reversed string.
    • Initialize a variable i to 0 and iterate the whole string through a while loop.
    • Skip initial spaces by just incrementing i.
    • Create a String that will store the current word.
    • Add the currentword and space at the beginning of ans.
    • After traversing the whole string, check if the length of ans is greater than 0 then return ans after removing the last space otherwise r...
  • Answered by CodingNinjas
  • Q2. Fibonacci Member

    Given a number N, figure out if it is a member of fibonacci series or not. Return true if the number is member of fibonacci series else false.

    Fibonacci Series is defined by the recurren...

  • Ans. Space Complexity: Explanation: Time Complexity: Explanation:
  • Answered by CodingNinjas
  • Q3. Maximum Difference

    You are given an array 'ARR' of the 'N' element. Your task is to find the maximum difference between any of the two elements from 'ARR'.

    If the maximum differen...

  • Ans. Find Max And Min

    We will iterate over ARR and find the MAX and MIN of the ARR. And if the MAX - MIN is odd the return “ODD” else return "EVEN". 

    The algorithm will be-

    1. MAX = -1, MIN= 10 ^ 9 + 1
    2. For VAL in ARR.
      1. If MAX < VAL
        1. MAX = VAL
      2. If MIN > VAL
        1. MIN = VAL
    3. IF (MAX-MIN) % 2
      1. Return ODD
    4. ELSE
      1. Return EVEN
    Space Complexity: O(1)Explanation:

    O(1).

     

    Since constant space is used.

    Time Complexity: O(n)Explanation:

    O(N), where N ...

  • Answered by CodingNinjas
  • Q4. Remainder when divided by 11

    You are given a number N. You need to find the remainder when N is divided by 11.

    Note :
    Number N may be very large.
    
    Input format :
    The first line contains an integer '...
  • Ans. Using Modulo Property
    1. Since the number is very large we can not simply calculate N % 11.
    2. Now, any number say 256 % 11 can be calculated as (25*10 + 6)%11. Which in turn can be calculated as (( 25*10)%11+ 6)%11 or ( (25%11)*10 + 6)%11. Similarly 25%11 can be calculated as (2*10+5)%11. Therefore , 256 %11 can be finally calculated as ( ( (2*10 + 5)%11 )*10 + 6)%11.
    3. So, the idea is to store the number N in string Str.
    4. Take a ...
  • Answered by CodingNinjas
Round 2 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

In this round interviewer asked me to solve 3 programming questions.

  • Q1. Selection Sort

    Selection sort is one of the sorting algorithms that works by repeatedly finding the minimum element from the unsorted part of the array and putting it at the beginning of the unsorted regio...

  • Ans. Selection Sort Approach

    Selection sort is a standard sorting algorithm that uses nested loops to find all the minimum elements in the array in each iteration and swap them with the starting element of the unsorted region of the array.

     

    Steps :

    • Use a minValue variable to find the index of the minimum element of the array.
    • Use a loop to iterate over all the elements of the array.
    • Use a nested loop to find the minimum ele...
  • Answered by CodingNinjas
  • Q2. String Palindrome

    Given a string, determine if it is a palindrome, considering only alphanumeric characters.

    Palindrome
    A palindrome is a word, number, phrase, or other sequences of characters which read...
  • Ans. Space Complexity: Explanation: Time Complexity: Explanation:
  • Answered by CodingNinjas
  • Q3. Star Pattern

    Pattern for N = 4


    The dots represent spaces.



    Input Format :
    N (Total no. of rows)
    
    Output Format :
    Pattern in N lines
    
    Constraints :
    0 <= N <=...

  • Ans. Space Complexity: Explanation: Time Complexity: Explanation:
  • Answered by CodingNinjas
Round 3 - HR 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was the HR round. They asked me simple HR questions and 1 coding question.

  • Q1. Basic HR Questions

    What experience do you have that would be relevant to this role?

    What do you know about our company’s product/services?

  • Ans. 

    Tip 1 : Stick to your first answer and that will show the confidence.
    Tip 2 : Give genuine answers and be confident.

  • Answered by CodingNinjas
  • Q2. Count characters

    Write a program to count and print the total number of characters (lowercase english alphabets only), digits (0 to 9) and white spaces (single space, tab i.e. '\t' and newline i.e....

  • Ans. Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
  • Answered by CodingNinjas

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in PuneEligibility criteriaabove 6 CGPARaja Software Labs interview preparation:Topics to prepare for the interview - Language - Java, Basic Coding questions like (star patterns, factorial of no, prime number or not, etc), Data Structure, Object Oriented Programming conceptsTime required to prepare for the interview - 1 MonthsInterview preparation tips for other job seekers

Tip 1 : Learn how to optimize the program. This will really help you during RSL interview. 
Tip 2 : Study all previously asked question by this company and try to find out best solution for it.
Tip 3 : Keep resume simple and authenticated.
Tip 4 : Practice how to handrun the program.

Application resume tips for other job seekers

Tip 1 : Resume should be authenticated. You should be able to answer all things on resume.
Tip 2 : Keep it simple.
Tip 3 : Having internship experience will help.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via Naukri.com and was interviewed in Oct 2023. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(3 Questions)

  • Q1. Asked json web tokean authentication, authorisation. architecture of your project.
  • Q2. Coding question- create crud app. Given array of objects. Render list in table. Do edit, delete, sort list on object property.
  • Ans. 

    Create a CRUD app to render, edit, delete, and sort a list of objects in a table.

    • Create a React component to render a table with data from the array of objects.

    • Implement functions for editing and deleting objects from the list.

    • Add functionality to sort the list based on object properties.

    • Use state and props to manage data and re-render the table when changes occur.

  • Answered by AI
  • Q3. Difference bw rem, em, px. React hooks- useEffect, life cycle methods. use cases of hooks.
  • Ans. 

    rem, em, px are units of measurement in CSS. React hooks like useEffect replace lifecycle methods for side effects.

    • rem: relative to the font-size of the root element (html). Example: 1rem = 16px

    • em: relative to the font-size of the element. Example: 2em = 32px if font-size is 16px

    • px: fixed-size units. Example: font-size: 16px

    • useEffect: replaces componentDidMount, componentDidUpdate, and componentWillUnmount in class com...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Do hands on coding round good.

Skills evaluated in this interview

Nimap Infotech Interview FAQs

How many rounds are there in Nimap Infotech React Developer interview?
Nimap Infotech interview process usually has 1 rounds. The most common rounds in the Nimap Infotech interview process are Assignment.

Tell us how to improve this page.

Interview Questions from Similar Companies

TCS Interview Questions
3.7
 • 10.1k Interviews
Infosys Interview Questions
3.7
 • 7.4k Interviews
Wipro Interview Questions
3.7
 • 5.5k Interviews
Tech Mahindra Interview Questions
3.6
 • 3.7k Interviews
HCLTech Interview Questions
3.6
 • 3.6k Interviews
LTIMindtree Interview Questions
3.9
 • 2.7k Interviews
Mphasis Interview Questions
3.4
 • 773 Interviews
View all

Fast track your campus placements

View all
Nimap Infotech React Developer Salary
based on 4 salaries
₹3 L/yr - ₹4.8 L/yr
39% less than the average React Developer Salary in India
View more details

Nimap Infotech React Developer Reviews and Ratings

based on 1 review

1.0/5

Rating in categories

1.0

Skill development

1.0

Work-Life balance

1.0

Salary & Benefits

1.0

Job Security

1.0

Company culture

1.0

Promotions/Appraisal

1.0

Work Satisfaction

Explore 1 Review and Rating
Software Developer
80 salaries
unlock blur

₹2.3 L/yr - ₹9 L/yr

Software Engineer
27 salaries
unlock blur

₹3.2 L/yr - ₹10.8 L/yr

Associate Software Developer
27 salaries
unlock blur

₹2 L/yr - ₹8 L/yr

Java Developer
19 salaries
unlock blur

₹1.9 L/yr - ₹4 L/yr

Android Developer
16 salaries
unlock blur

₹4.5 L/yr - ₹12 L/yr

Explore more salaries
Compare Nimap Infotech with

TCS

3.7
Compare

Infosys

3.7
Compare

Wipro

3.7
Compare

HCLTech

3.6
Compare

Calculate your in-hand salary

Confused about how your in-hand salary is calculated? Enter your annual salary (CTC) and get your in-hand salary
Did you find this page helpful?
Yes No
write
Share an Interview