Naukri Web Developer Interview Questions and Answers

Q1. Javascript output-based questions
Add your answer
Q2. React- search query
Add your answer

There was an online coding test on signal consisting of leetcode easy medium and hard

Q1. Asked about fundamentals of javascript and react
Add your answer
Q2. React lifecycle in functional components
Ans. 
React lifecycle in functional components
• useEffect hook replaces lifecycle methods

• useEffect runs after every render by default

• useEffect can be controlled by dependencies array

• useEffect cleanup function can be used to clean up effects

• useLayoutEffect hook runs synchronously after DOM mutations
Answered by AI
Add your answer

Return numbers in array equal to sum

Q1. Self introduction?
Add your answer
Q2. How much struggle you faced to get this position?
Add your answer
Q3. What is your short term goal?
Add your answer
Q4. What is your long term goal?
Add your answer
Q5. Salary package?
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

Q1. Triplets with Given Sum
You are given an array/list ARR consisting of N integers. Your task is to find all the distinct triplets present in the array which adds up to a given number K.
An array is said t...read more
Ans. Brute Force
• The most trivial approach would be to find all triplets of the array and count all such triplets whose ‘SUM’ = 'K'.
• We can find the answer using three nested loops for three different indexes and check if the values at those indexes sum up to 'K'.
• Create a set  to keep the track of triplets we have visited. Run first loop from i = 0 to i = ‘N’ - 3, second loop from j = i + 1 to j = ‘N’ - 2 and third loop ...read more
Answered Anonymously
Add your answer
Q2. Magic Index
You are given a sorted array A consisting of N integers. Your task is to find the magic index in the given array.
Note :
A magic index in an array A[0 ... N - 1] is defined to be an index i s...read more
Ans. Brute Force Approach
• In this brute force approach, we will check each element one by one and try to find if there is any magic index in the given array or not.
• In this approach, we will initialize our answer variable (say, ans) with ans = -1.
• Then we will iterate in the array one by one (say, loop variable i) from the beginning and check if there is any magic index in our array or not.
• If we find any index in the array suc...read more
Answered Anonymously
Add your answer

Round duration - 50 Minutes
Round difficulty - Hard

Q1. Alien dictionary
You have been given a sorted (lexical order) dictionary of an alien language. Write a function that finds the order of characters in the alien language. This dictionary will be given to yo...read more
Ans. Permutations Approach
Approach:
• Find all the distinct characters present in all the words.
• Generate all permutations of these distinct characters.
• Treat each of the permutations as a correct sequence of alphabets. Now check if the given words are sorted according to this sequence. In order to do this, we will:-
  • For all words from 1 to n - 1, let the current word be ‘currWord’ and the next word be ‘nextWord’.
  • One by one compa...read more
Answered Anonymously
Add your answer
Q2. Jumping Numbers
You are given a positive integer N, your task is to find all the Jumping Numbers smaller than or equal to N.
A number is defined as a Jumping Number if all adjacent digits in it have an ...read more
Ans. Brute Force Approach
This is the basic solution to this problem.
 
• Traverse all numbers from 0 to N.
• For every traversed number, check if it is a Jumping Number or not.
• To check if a number is jumping or not, we’ll make a boolean function named check(), which will return true if the number is a jumping number.
• Inside this check function, we’ll first extract all the digits of the number and store it in an array.
• Then we c...read more
Answered Anonymously
Add your answer
Q3. Matching Prefix
You are given an integer ’N’ denoting the length of the array ‘Arr’ of strings made up of lower case English alphabets. The cost of this array is equal to the sum of length of each string i...read more
Ans. Brute Force
For each string in the array consider each of its prefix string one by one, now check what will be the cost if the current prefix string is used to delete matching prefixes from all the strings in the array. Keep track of the prefix string that had the lowest cost and finally return that string. 

 The steps are as follows :
• Initialize minCost to INT_MAX it will store the minimum cost so far, and init...read more
Answered Anonymously
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy

What is your name
From
Qualification
Family background
Hobbies
Weekness strength
Thanks you

Mathematics,communication skills,

Q1. Self introduction
Add your answer
Q2. My name is mounika
Add your answer
Q3. I caming form narasaraopet,palnadu district
Add your answer
Q4. Caming to my familybackground we have 4 members My mother name is pravathi My father name is narasi reddy I have one sister she studying b.tech 3rd year My father is a farmer My mother is farmer
Add your answer
Q5. My hobbies are reading books, movies, playing kho kho no weakness My goal is to became a software engineer
Add your answer