Inshorts Content Specialist Interview Questions and Answers

Casual discussion on prior work experience

Q1. Linear regression
Add your answer

Q1. Write a SQL query to find all duplicate emails in a table named person
Ans. 
SQL query to find duplicate emails in a table named person
• Use GROUP BY and HAVING clause to group emails and count their occurrences

• Select only those emails which have count greater than 1

• Example: SELECT email, COUNT(*) FROM person GROUP BY email HAVING COUNT(*) > 1;
Answered by AI
Add your answer
Q2. Given a weather table, write a sql query to find all date's ids with higher temperature compared to it's previous dates
Ans. 
SQL query to find date ids with higher temperature compared to previous dates in weather table
• Use self join to compare temperature of current date with previous dates

• Order the table by date to ensure correct comparison

• Select date ids where temperature is higher than previous dates
Answered by AI
Add your answer

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