Matrimony.com Web Developer Interview Questions and Answers

Html coding, css coding, Javascript coding , bootstrap

Html coding , javascript coding ,css coding

Q1. Questions on optimizations
Add your answer
Q2. Question on React Js
Add your answer

Medium level DSA question in JS

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

Html coding, css coding, Javascript coding , bootstrap

Html coding , javascript coding ,css coding

Round duration - 45 Minutes
Round difficulty - Easy

Q1. 
Triplets with Given Sum Problem
Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.
Explanation:
A 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. 
Find Magic Index in Sorted Array
Given a sorted array A consisting of N integers, your task is to find the magic index in the given array, where the magic index is defined as an index i such that A[i] = i...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 Problem Statement
You are provided with a sorted dictionary (by lexical order) in an alien language. Your task is to determine the character order of the alien language from this dictiona...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 Problem Statement
Given a positive integer N, your goal is to find all the Jumping Numbers that are smaller than or equal to N.
A Jumping Number is one where every adjacent digit has an a...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 Problem Statement
Given an integer N representing the number of strings in an array Arr composed of lowercase English alphabets, determine a string S of length N such that it can be used t...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