Addepar Senior Software Engineer Interview Questions and Answers

Q1. Js based question on event loop
Add your answer

Q1. Question on Fundamentals of React and Javascript
Add your answer
Q2. Coding question on React Native
Add your answer

Q1. What are the fundamental concepts of JavaScript that were discussed during the interview?
Ans. 
Fundamental concepts of JavaScript discussed in the interview
• Data types in JavaScript (string, number, boolean, object, array)

• Functions and scope in JavaScript

• DOM manipulation and event handling

• Asynchronous programming with callbacks, promises, and async/await

• Object-oriented programming concepts in JavaScript
Answered by AI
Add your answer

Two DSA Questions
1. Check whether two strings are anagram or not?
2. Create power function without using Math.pow() library?

Design dream11. Bonus - how notification will be sent to customer for milestone of a player they have followed at scale.

Q1. LLD to design whatsapp
Ans. 
Designing WhatsApp involves creating a high-level design for the messaging app, focusing on features like chat, groups, calls, and media sharing.
• Implement chat functionality with real-time messaging using sockets

• Design group chat feature with ability to add/remove members

• Include end-to-end encryption for secure messaging

• Develop voice and video calling functionality

• Allow media sharing such as photos, videos, and documen
Answered by AI
Add your answer
Q2. System design ticket booking system
Ans. 
Design a ticket booking system for efficient and user-friendly experience.
• Use a database to store information about available tickets, users, and bookings

• Implement a user-friendly interface for users to search for and book tickets

• Include features like seat selection, payment processing, and booking confirmation

• Consider scalability and performance to handle a large number of users and bookings
Answered by AI
Add your answer

Arrays, LinkedList basic dsa questions

Q1. Binary Tree 2nd largest node
Ans. 
To find the 2nd largest node in a binary tree, we can perform an in-order traversal and keep track of the two largest nodes.
• Perform an in-order traversal of the binary tree

• Keep track of the two largest nodes encountered

• Return the second largest node when traversal is complete
Answered by AI
Add your answer
Q2. Basic web questions
Add your answer

Easy coding question generally A, B level question of codeforces

Q1. OOPs, DBMS , Computer network and some basics over java
Add your answer