Moris Media Motion Graphics Animator Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Easy

The test was of moderate level, the coding question was easy if all the boundary questions were properly considered.

Q1. 
Largest Prime Factor Problem Statement
You are given a positive integer n. Your task is to identify the largest prime factor of this given positive integer.
If there is no prime factor for a given intege...read more
Ans. 
Identify the largest prime factor of a given positive integer.
• Iterate from 2 to sqrt(n) to find prime factors

• Check if each factor is prime and update largest prime factor

• If no prime factor found, output -1
Answered by AI
Add your answer
Q2. 
First Missing Positive Problem Statement
You are provided with an integer array ARR of length 'N'. Your objective is to determine the first missing positive integer using linear time and constant space. T...read more
Ans. 
Find the smallest positive integer missing from an array of integers.
• Iterate through the array and mark positive integers as visited using index as a reference.

• After marking, iterate again to find the first unmarked index which represents the missing positive integer.

• Handle edge cases like duplicates and negative numbers appropriately.

• Example: For input [3, 4, -1, 1], the output should be 2.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The interviewer was friendly and he was interested in the implementation first and then the code.
Tips: Be thorough with various implementations and why they are in practice. Try to know the logic behind each implementation.

Q1. 
Binary Array Sorting Problem Statement
You are provided with a binary array, i.e., an array containing only 0s and 1s. Your task is to sort this binary array and return it after sorting.
Input:
 The fir...read more
Ans. 
Yes, the binary array can be sorted in linear time and constant space using a single traversal.
• Use two pointers approach to swap 0s to the left and 1s to the right.

• Maintain two pointers, one for 0s and one for 1s, and iterate through the array once.

• Example: Input array [1, 0, 1, 0, 1] will be sorted to [0, 0, 1, 1, 1] in a single traversal.
Answered by AI
Add your answer
Q2. What is polymorphism in object-oriented programming?
Ans. 
Polymorphism in OOP allows objects of different classes to be treated as objects of a common superclass.
• Polymorphism allows for flexibility and reusability in code.

• It enables a single interface to be used for different data types.

• Examples include method overriding and method overloading.
Answered by AI
Add your answer
Q3. What is operator overloading?
Ans. 
Operator overloading is the ability to redefine the behavior of operators for user-defined data types.
• Allows operators to be used with custom data types

• Can define custom behavior for operators like +, -, *, etc.

• Helps make code more readable and intuitive

• Example: Overloading the + operator for a custom Vector class to add two vectors
Answered by AI
Add your answer
Q4. What is the difference between method overloading and method overriding?
Ans. 
Method overloading is having multiple methods in the same class with the same name but different parameters. Method overriding is having a method in a subclass with the same name and parameters as a method in its superclass.
• Method overloading involves multiple methods with the same name but different parameters.

• Method overriding involves a subclass redefining a method from its superclass with the same name and paramete...read more
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

The interviewer was looking for a person interested in problem solving. He was looking forward for loud thinking.
Tips: If you don't know any answer, don't lose your cool. It is never necessary to answer all the questions in an interview. Be confident and think loud, so that if you are going the wrong way, the interviewer can assist you.

Round duration - 30 minutes
Round difficulty - Easy

This was the last round and just for formality. The interviewers were looking for a person who would fit in their working culture.
Tips: Be confident and always have a smile on your face. If you are selected for the HR interview, then there is a 90% chance that you would be selected.

Round duration - 60 minutes
Round difficulty - Easy

I had one interview for approx. an hour, it includes both Technical and HR round, well mostly technical. Interview starts with tell me something about yourself. Asked in detailed about algorithms/web based projects mentioned in CV, make sure that whatever you have written you have complete knowledge about it. Asked to code few basic algorithms questions. Do mention about small project if you have done related to web development.
If interviewer says if you want to ask any question, its always better to ask one or two question.

Q1. Can you introduce yourself?
Add your answer
Q2. What is a Binary Search Tree (BST)?
Ans. 
A Binary Search Tree (BST) is a data structure where each node has at most two children, with the left child being less than the parent and the right child being greater.
• Nodes in a BST are arranged in a hierarchical order where the left subtree of a node contains only nodes with keys less than the node's key, and the right subtree contains only nodes with keys greater than the node's key.

• BST allows for efficient search...read more
Answered by AI
Add your answer
Q3. 
Binary Search Tree Insertion
Given the root node of a binary search tree and a positive integer, you need to insert a new node with the given value into the BST so that the resulting tree maintains the pr...read more
Ans. 
Insert a new node with a given value into a binary search tree while maintaining the properties of a BST.
• Traverse the BST starting from the root node and compare the value to be inserted with each node's value to determine the correct position for insertion.

• Insert the new node as a leaf node in the appropriate position to maintain the BST properties.

• Ensure that the resulting tree is a valid binary search tree by follow...read more
Answered by AI
Add your answer
Q4. 
Delete Node in Binary Search Tree Problem Statement
You are provided with a Binary Search Tree (BST) containing 'N' nodes with integer data. Your task is to remove a given node from this BST.
A BST is a ...read more
Ans. 
Delete a given node from a Binary Search Tree (BST) and return the inorder traversal of the modified BST.
• Traverse the BST to find the node to be deleted.

• Handle different cases like node with no children, one child, or two children.

• Update the pointers of the parent node and child nodes accordingly.

• Perform inorder traversal after deletion to get the modified BST.
Answered by AI
Add your answer
Q5. 
Clone Linked List with Random Pointer Problem Statement
Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or ...read more
Ans. 
Yes, the cloning of a linked list with random pointer can be accomplished without utilizing extra space.
• Use a hashmap to store the mapping between original nodes and their corresponding cloned nodes.

• Iterate through the original linked list to create the cloned nodes and update the hashmap.

• Iterate through the original linked list again to set the next and random pointers of the cloned nodes using the hashmap.

• Time comple...read more
Answered by AI
Add your answer