Upload Button Icon Add office photos
Engaged Employer

i

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

Matrimony.com Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Matrimony.com UI Developer Interview Questions and Answers

Updated 7 Feb 2024

Matrimony.com UI Developer Interview Experiences

1 interview found

UI Developer Interview Questions & Answers

user image Anonymous

posted on 7 Feb 2024

Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
-
Result
Selected Selected

I applied via Job Portal and was interviewed in Aug 2023. There were 2 interview rounds.

Round 1 - One-on-one 

(5 Questions)

  • Q1. Attended first round interview dec 2023
  • Q2. Asked some basic js and angular question
  • Q3. What is hoisting?
  • Ans. 

    Hoisting is a JavaScript behavior where variable and function declarations are moved to the top of their scope during the compilation phase.

    • Hoisting applies to both variable and function declarations.

    • Variable declarations are hoisted but not their initializations.

    • Function declarations are fully hoisted, allowing them to be called before they are defined.

    • Hoisting does not apply to variables declared with let or const.

    • Ho...

  • Answered by AI
  • Q4. Difference between display-block and inline-block
  • Ans. 

    display-block takes up full width, while inline-block only takes up necessary width.

    • display-block elements start on a new line and take up the full width available, like <div>

    • inline-block elements do not start on a new line and only take up as much width as necessary, like <span>

    • display-block elements can have margin and padding applied on all sides, while inline-block elements only have margin and padding

  • Answered by AI
  • Q5. Parent child communication in angular
  • Ans. 

    Parent child communication in Angular is a way to pass data and trigger actions between components.

    • Use @Input decorator to pass data from parent to child component

    • Use @Output decorator and EventEmitter to emit events from child to parent component

    • Use ViewChild decorator to access child component from parent component

    • Use services to share data between unrelated components

  • Answered by AI
Round 2 - Assignment 

Provide three screenshot of matrimony app to create a angular application.

Interview Preparation Tips

Interview preparation tips for other job seekers - After completing 3rd round successfully they start salary negotiation. I was disappointed and rejected the offer.very poor organisation.

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Machine Coding round and second was PSDS (DSA)

Interview Preparation Tips

Interview preparation tips for other job seekers - First was Machine coding round and second was DSA round which they call as PSDS round. I got rejected in 2nd round. There were 2 questions on tress and on question on string and i was not able to do the string question
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Design book my show
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
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 

(2 Questions)

  • Q1. Machine coding round, develope webpage using html js css Implement concepts like debouncing throttling Coding only in Html css javascript. This was a 2hr round
  • Q2. Only one machine coding round question
Round 3 - Coding Test 

Data structures and problem solving round

Interview Preparation Tips

Interview preparation tips for other job seekers - The interview was pretty easy, be prepared
Prepare coding problems on leetcode. Most of the questions were from leetcode
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Optimization techniques for web performance
  • Ans. 

    Optimization techniques for web performance include minification, caching, lazy loading, image optimization, and reducing HTTP requests.

    • Minify CSS, JavaScript, and HTML files to reduce file sizes and improve load times.

    • Implement caching strategies like browser caching, server-side caching, and CDN caching to store frequently accessed resources.

    • Use lazy loading for images and videos to defer loading until they are neede...

  • Answered by AI
  • Q2. For machine coding please make sure the code is working

Skills evaluated in this interview

Associate Interview Questions & Answers

Amazon user image Arshiya Saba

posted on 10 Sep 2020

I applied via Company Website and was interviewed in Aug 2020. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Basic Q & A

Interview Preparation Tips

Interview preparation tips for other job seekers - First-round I had English grammatical questions following that it took me to speech recognition, listen and type or type & email drafting. all you need is a calm mind and peaceful place and your set to go.

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

This is a written round on paper for everyone. Three coding questions were given. Two out of three must be correct covering every single edge case to qualify for the next round. Only the most optimal solution was to be considered.

  • Q1. 

    Maximum Subarray Sum Problem Statement

    Given an array ARR consisting of N integers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.

    Example of Sub...

  • Ans. 

    Find the maximum sum of a contiguous subarray in an array of integers.

    • Use Kadane's algorithm to find the maximum subarray sum in linear time.

    • Initialize two variables: maxSum and currentSum.

    • Iterate through the array and update currentSum by adding the current element or starting a new subarray.

    • Update maxSum if currentSum becomes greater than maxSum.

    • Return maxSum as the maximum subarray sum.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 50 Minutes
Round difficulty - Easy

This was face to face interview round.

  • Q1. 

    Finding Triplets in a Binary Tree Problem Statement

    You are given a Binary Tree of integers and an integer 'X'. Your task is to find all the triplets in the tree whose sum is strictly greater than 'X'. Th...

  • Ans. 

    Find all triplets in a binary tree whose sum is greater than a given integer X, with a grandparent-parent-child relationship.

    • Traverse the binary tree to find all possible triplets.

    • Check if the sum of each triplet is greater than X.

    • Ensure the relationship of grandparent-parent-child in each triplet.

    • Return the valid triplets in any order.

    • Handle constraints and edge cases appropriately.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

FACE TO FACE ROUND INTERVIEW

  • Q1. Can you tell me about yourself?
  • Q2. What is the difference between Mutex and Semaphores? Please provide a real-life example.
  • Ans. 

    Mutex is used for exclusive access to a resource by only one thread at a time, while Semaphores can allow multiple threads to access a resource simultaneously.

    • Mutex is binary and allows only one thread to access a resource at a time, while Semaphores can have a count greater than one.

    • Mutex is used for protecting critical sections of code, while Semaphores can be used for controlling access to a pool of resources.

    • Exampl...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in NoidaEligibility criteriaabove 7 cgpaAmazon interview preparation:Topics to prepare for the interview - Computer Fundamentals, Data Structures and AlgorithmsTime required to prepare for the interview - 6 MonthsInterview preparation tips for other job seekers

Tip 1 : Participate in previous interview questions from leetcode, geeksforgeeks
Tip 2 : Revise computer science subjects like dbms and oops thoroughly
Tip 3 : Participate in live contests on CodeChef, Codeforces

Application resume tips for other job seekers

Tip 1 : Only write the things on which you are the most confident about

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

There was 2 coding questions
Based on ds and algorithms

  • Q1. 

    Minimum Number of Platforms Problem

    Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.

    Explanation:

    Given two arrays:

    • AT - represent...
  • Ans. 

    Determine the minimum number of platforms needed at a railway station so that no train has to wait.

    • Sort the arrival and departure times arrays in ascending order.

    • Initialize two pointers, one for arrival times and one for departure times.

    • Increment the platform count when a train arrives and decrement when it departs.

    • Keep track of the maximum platform count needed.

    • Return the maximum platform count as the minimum number o

  • Answered by AI
  • Q2. 

    Minimum Number of Swaps to Achieve K-Periodic String

    Given a string S of length N, an array A of length M consisting of lowercase letters, and a positive integer K, determine the minimum number of swaps r...

  • Ans. 

    The minimum number of swaps required to make a string K-periodic by replacing characters with elements from an array.

    • Iterate through the string and check if each character matches the character K positions ahead.

    • Count the number of characters that need to be swapped to make the string K-periodic.

    • Use the array elements to swap characters in the string.

    • Return the total number of swaps needed for each test case.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

It was good round they asked me about all the ds and algo basics 
With 2 problems by sharing the screeen

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Count the number of islands in a 2D matrix of 1s and 0s.

    • Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.

    • Maintain a visited array to keep track of visited cells to avoid redundant traversal.

    • Increment the island count each time a new island is encountered.

    • Consider all eight possible directions for connectivity while traversing the matrix.

    • Handle edge ca...

  • Answered by AI
  • Q2. 

    Longest Increasing Subsequence Problem Statement

    Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...

  • Ans. 

    Find the length of the longest strictly increasing subsequence in an array of integers.

    • Use dynamic programming to solve this problem efficiently.

    • Initialize an array to store the length of the longest increasing subsequence ending at each index.

    • Iterate through the array and update the length of the longest increasing subsequence for each element.

    • Return the maximum value in the array as the result.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 50 minutes
Round difficulty - Medium

In this round, three questions were asked and all of them were based on DSA and a little bit about projects.

  • Q1. 

    Minimum Jumps Problem Statement

    Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...

  • Ans. 

    Find the minimum number of jumps Bob needs to make from shop 0 to reach the final shop, or return -1 if impossible.

    • Use BFS to traverse through the shops and keep track of the minimum jumps required.

    • If at any point the current shop is unreachable (Arr[i] = 0), return -1.

    • Optimize by using a visited array to avoid revisiting the same shop.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 65 percentAmazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Operating Systems, Computer Networks, JavaTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Be enough confident, don't be nervous. Maintain atleast 2 projects in your resume.
Tip 2 : You should be able to answer each and every thing present in your resume. Don't lie in your resume.
Tip 3 : Prepare Data Structures and Algorithms well. They mostly check our Problem Solving ability to find the solutions for the real world problems

Application resume tips for other job seekers

Tip 1 : Build your resume such that it grabs the eye of the interviewer
Tip 2 : metion your key skills and also maintain atleast 2 projects

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview in Dec 2020.

Round 1 - Face to Face 

(1 Question)

Round duration - 25 Minutes
Round difficulty - Medium

Very friendly interviewer. Although waiting time was very high

  • Q1. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Find pairs of elements in an array that sum up to a given value, sorted in a specific order.

    • Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.

    • If the complement exists, add the pair to the result list.

    • Sort the result list based on the criteria mentioned in the question.

    • Return the sorted list of pairs.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNoAmazon interview preparation:Topics to prepare for the interview - CV points, Leadership principles, ecommerce basics, problem solving, case studiesTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : be confident about your CV points
Tip 2 : practice consulting cases and how to answer situational questions

Application resume tips for other job seekers

Tip 1 : be crisp about achievement
Tip 2 : add data points to support your achievements

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

10 min for debugging
40 min for problems(coding)
40 min for pyschometric
30 min for aptitude

  • Q1. 

    Total Unique Paths Problem Statement

    You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...

  • Ans. 

    The task is to calculate the total number of unique paths from the top-left to bottom-right corner of an M x N matrix by moving only right or down.

    • Use dynamic programming to solve this problem efficiently.

    • Create a 2D array to store the number of unique paths for each cell in the matrix.

    • Initialize the first row and first column with 1 as there is only one way to reach each cell in the first row and column.

    • For each cell ...

  • Answered by AI
  • Q2. 

    Most Frequent Word Problem Statement

    You are given two strings 'A' and 'B' composed of words separated by spaces. Your task is to determine the most frequent and lexicographically smallest word in string ...

  • Ans. 

    Find the most frequent and lexicographically smallest word in string 'A' that is not present in string 'B'.

    • Split strings 'A' and 'B' into words

    • Count frequency of each word in 'A'

    • Check if word is not in 'B' and is the most frequent and lexicographically smallest

    • Return the word or -1 if no such word exists

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Easy

timing was 4 pm . we connected on amazon chime. Initially he asked me a few things from resume then moved on to problem solving.

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Count the number of islands in a 2D matrix of 1s and 0s.

    • Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.

    • Maintain a visited array to keep track of visited cells to avoid redundant traversal.

    • Increment the island count each time a new island is encountered.

    • Consider all eight possible directions for connectivity while traversing the matrix.

    • Handle edge ca...

  • Answered by AI
  • Q2. 

    Largest Rectangle in Histogram Problem Statement

    You are given an array/list HEIGHTS of length N, where each element represents the height of a histogram bar. The width of each bar is considered to be 1.

    ...
  • Ans. 

    Find the area of the largest rectangle that can be formed within the bounds of a given histogram.

    • Iterate through the histogram bars and maintain a stack to keep track of increasing heights.

    • Calculate the area of the rectangle formed by each bar as the smallest height in the stack times the width.

    • Update the maximum area found so far and return it as the result.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in DelhiEligibility criteria6 CGPAAmazon interview preparation:Topics to prepare for the interview - Data structures , oops, operating systems, database management system , algorithmsTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : be confident since interviewer is looking at how confident you are with your skills
Tip 2 : dont learn the algorithms but try to understand them
Tip 3 : focus on trees and graphs since amazon asks more of that

Application resume tips for other job seekers

Tip 1 : KEEP RESUME SHORT(1 PAGE)
Tip 2 : DONT BLUFF IN RESUME SINCE MY INTERVIEWER ASKED ME LOOKING FROM IT

Final outcome of the interviewSelected

Skills evaluated in this interview

Matrimony.com Interview FAQs

How many rounds are there in Matrimony.com UI Developer interview?
Matrimony.com interview process usually has 2 rounds. The most common rounds in the Matrimony.com interview process are One-on-one Round and Assignment.
How to prepare for Matrimony.com UI Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Matrimony.com. The most common topics and skills that interviewers at Matrimony.com expect are CSS, Bootstrap, Html5, UI Development and Javascript.
What are the top questions asked in Matrimony.com UI Developer interview?

Some of the top questions asked at the Matrimony.com UI Developer interview -

  1. Difference between display-block and inline-bl...read more
  2. What is hoisti...read more
  3. Parent child communication in angu...read more

Tell us how to improve this page.

Matrimony.com UI Developer Interview Process

based on 1 interview

Interview experience

1
  
Bad
View more

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
Flipkart Interview Questions
3.9
 • 1.3k Interviews
Swiggy Interview Questions
3.8
 • 430 Interviews
PolicyBazaar Interview Questions
3.6
 • 361 Interviews
Udaan Interview Questions
4.0
 • 334 Interviews
JustDial Interview Questions
3.5
 • 329 Interviews
Meesho Interview Questions
3.7
 • 328 Interviews
Info Edge Interview Questions
3.9
 • 318 Interviews
Zomato Interview Questions
3.8
 • 312 Interviews
View all
Matrimony.com UI Developer Salary
based on 4 salaries
₹2.6 L/yr - ₹4.3 L/yr
49% less than the average UI Developer Salary in India
View more details
Senior Relationship Manager
283 salaries
unlock blur

₹2.3 L/yr - ₹5.3 L/yr

Relationship Manager
213 salaries
unlock blur

₹1.7 L/yr - ₹5 L/yr

Senior Executive
129 salaries
unlock blur

₹1.5 L/yr - ₹5.4 L/yr

Customer Service Executive
127 salaries
unlock blur

₹1 L/yr - ₹3 L/yr

Team Lead
110 salaries
unlock blur

₹1.9 L/yr - ₹8 L/yr

Explore more salaries
Compare Matrimony.com with

Amazon

4.1
Compare

Flipkart

3.9
Compare

Udaan

4.0
Compare

Indiamart Intermesh

3.6
Compare
Did you find this page helpful?
Yes No
write
Share an Interview