i
Matrimony.com
Filter interviews by
I applied via LinkedIn and was interviewed before Nov 2023. There were 2 interview rounds.
Service dependency injection is a design pattern where a service is passed to a dependent object rather than the object creating the service itself.
Service dependency injection helps in achieving loose coupling between components.
It allows for easier testing as dependencies can be easily mocked or replaced.
Commonly used in frameworks like Angular for injecting services into components.
Lazy loading in Angular is a technique used to load modules only when they are needed, improving performance by reducing initial load time.
Lazy loading helps in reducing the initial bundle size of the application.
It allows for faster loading times as only the required modules are loaded on demand.
Lazy loading is achieved by using the loadChildren property in the route configuration of Angular.
Lazy loading is commonly u...
Event loop, MongoDB Queries, Angular Basics
Top trending discussions
I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.
Amazon offers challenging projects, innovative technologies, and a collaborative work environment.
Opportunity to work on cutting-edge projects like Amazon Web Services (AWS) or Alexa
Access to vast resources and tools for development
Collaborative work culture that encourages learning and growth
Opportunity to impact millions of customers worldwide
Competitive compensation and benefits package
I want to work at Amazon because of their innovative culture, vast resources, and opportunities for growth.
Amazon is known for its innovative culture and cutting-edge technology.
They have vast resources and a global reach, providing opportunities to work on impactful projects.
Amazon offers great career growth and development opportunities for software developers.
I admire Amazon's customer-centric approach and focus on
My strengths include problem-solving skills and attention to detail. My weakness is sometimes being too critical of my own work.
Strengths: problem-solving skills
Strengths: attention to detail
Weakness: being too critical of my own work
I would solve the problem by breaking it down into smaller tasks, analyzing requirements, designing a solution, coding, testing, and debugging.
Analyze requirements thoroughly before starting the development process
Break down the problem into smaller tasks to make it more manageable
Design a solution architecture that meets the requirements and is scalable
Code the solution using best practices and coding standards
Test th...
Short term goals focus on immediate tasks and objectives, while long-term goals involve strategic planning and growth.
Short term goals may include completing a specific project, improving team communication, or implementing a new software feature.
Long-term goals could involve expanding the team, increasing market share, or developing new products or services.
Short term goals help keep the team focused and motivated, wh...
I applied via Referral and was interviewed in Oct 2024. There were 2 interview rounds.
Dp question of jump game
BFS Implementation of a jug question.
I applied via LinkedIn and was interviewed in Aug 2024. There were 3 interview rounds.
It was mostly around Frontend and JavaScript, asked basic questions on javascript. Then they gave me a problem to make form with multiple steps where every step has some form fields, handle state and validations for such form. After building the solution he asked follow up questions like what if form is dynamic.
I applied via campus placement at Indraprastha Institute of Information Technology (IIIT), Delhi and was interviewed in Aug 2024. There was 1 interview round.
To insert a node in a binary search tree, compare the value of the node to be inserted with the current node and traverse left or right accordingly.
Start at the root node and compare the value of the node to be inserted with the current node.
If the value is less than the current node, move to the left child node. If it is greater, move to the right child node.
Repeat this process until reaching a leaf node, then insert ...
Find the sum of kth to bth largest numbers in a huge array efficiently.
Sort the array in descending order to easily find the kth and bth largest numbers.
Use a priority queue or min heap to efficiently find the kth and bth largest numbers without sorting the entire array.
Once you have the kth and bth largest numbers, iterate through the array and sum the numbers between them.
I applied via AngelList and was interviewed in Jul 2024. There was 1 interview round.
I applied via Company Website and was interviewed in Dec 2024. There was 1 interview round.
DSA Problem statement of Trie
Interview experience
Senior Relationship Manager
283
salaries
| ₹2.3 L/yr - ₹5.3 L/yr |
Relationship Manager
241
salaries
| ₹1.7 L/yr - ₹5.1 L/yr |
Senior Executive
132
salaries
| ₹1.5 L/yr - ₹5.4 L/yr |
Customer Service Executive
111
salaries
| ₹1 L/yr - ₹4 L/yr |
Team Lead
111
salaries
| ₹1.9 L/yr - ₹8.1 L/yr |
Info Edge
JustDial
Naukri
99acres