MoEngage Senior Solution Engineer Interview Questions and Answers

Q1. Programming in C language
Ans. 
C language is a powerful and efficient programming language commonly used for system programming and embedded systems.
• C language is a procedural programming language

• It is widely used for developing operating systems, compilers, and embedded systems

• C is known for its efficiency and low-level access to memory

• Example: Declaring an array in C - int arr[5];
Answered by AI
Add your answer
Q2. DS basics Linked list
Add your answer

Q1. Basic questions of angular and javascript.
Add your answer
Q2. Es6 feature , typescript features
Add your answer
Q3. Promise, observable, focus on syntax of every thing like interceptor, routing, gaurd and all .
Add your answer

Q1. Behaviour subject, subject, life cycle hooks
Add your answer
Q2. This round was not very easy in my case.
Add your answer
Q3. Be prepared for array and object of array questions. Like sorting, searching, filtering , any logic .
Add your answer

Q1. Basic HR questions and managerial round. Not being hard . But learn about your project and past organisation
Add your answer

Ios round
questions asked involved questions from storages used in iOS
app life cycle
multiple app login with same creds autocomplete feature

Basic problem solving round
2 medium
1 b/w medium and hard
question were asked :
tree BFS and Stair question
dynamic programming

Q1. Design app like whatsapp.
Add your answer

Q1. Basic firment round with director.
Add your answer

DSA, factorial based question and stack based question

Q1. What is an operator in programming?
Add your answer
Q2. What is an array?
Add your answer

Duration: 1hr
Topics: Array, LinkedList,Stack

Q1. Write code for Insertion in a binary tree.
Ans. 
Code for insertion in a binary tree
• Create a new node with the given data

• If the tree is empty, make the new node as root

• Else, traverse the tree to find the appropriate position to insert the new node

• If the data is less than the current node, go to the left subtree

• If the data is greater than the current node, go to the right subtree

• Repeat until an appropriate position is found

• Set the new node as the child of the appropri
Answered by AI
Add your answer
Q2. Write code for quick sort
Ans. 
Quick sort is a divide-and-conquer algorithm that sorts an array by partitioning it into two sub-arrays.
• Choose a pivot element from the array

• Partition the array around the pivot element

• Recursively apply quick sort to the left and right sub-arrays

• Combine the sorted sub-arrays to get the final sorted array
Answered by AI
Add your answer

Q1. Various DBMS related question(JOINS, SORT, LIMIT)
Add your answer

Q1. Tell us about yourself.
Add your answer
Q2. Why do want to join the company
Add your answer

Q1. Based on your previous experience
Add your answer

Simple coding questions in your preferred language