Filter interviews by
Web scraping of movie reviews and NLP sentiment analysis on those reviews.
Solved assignments are designed to test understanding and application of concepts learned in a course.
Solved assignments help students practice and apply theoretical knowledge in practical scenarios.
They assess the student's understanding of the subject matter and their ability to solve problems independently.
Assignments often include real-world examples or case studies to enhance learning outcomes.
Feedback provided on...
List is mutable, tuple is immutable, and dictionary is key-value pair data structure.
List: Mutable, ordered collection of items. Example: [1, 2, 3]
Tuple: Immutable, ordered collection of items. Example: (1, 2, 3)
Dictionary: Key-value pairs, unordered collection. Example: {'key1': 'value1', 'key2': 'value2'}
Inner join returns only the rows that have matching values in both tables, while outer join returns all rows from both tables.
Inner join: returns rows with matching values in both tables
Outer join: returns all rows from both tables, filling in missing values with NULL
Left outer join: returns all rows from the left table and the matched rows from the right table
Right outer join: returns all rows from the right table and
Python function to print prime numbers in a given range.
Create a function that takes a start and end range as input
Iterate through each number in the range and check if it is prime
Use a nested loop to check if the number is divisible by any number other than 1 and itself
Print the prime numbers found in the given range
I applied via Approached by Company and was interviewed before May 2023. There were 2 interview rounds.
I applied via Referral and was interviewed in Nov 2021. There were 4 interview rounds.
I applied via Referral and was interviewed before Apr 2020. There were 3 interview rounds.
Mindshare interview questions for popular designations
Top trending discussions
I applied via Referral and was interviewed before Sep 2020. There were 3 interview rounds.
I applied via Company Website and was interviewed before Dec 2020. There were 3 interview rounds.
I applied via Company Website and was interviewed before Aug 2020. There was 1 interview round.
I applied via Walk-in and was interviewed before Nov 2020. There was 1 interview round.
I appeared for an interview before Jan 2021.
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.
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...
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...
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...
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 ...
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.
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 ...
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...
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Must verify your CV from your seniors/batchmates.
Tip 2 : Include all the projects, intern work or hall activities or anything you have done on your own which is related to or interest of company. If you know any back-end/front-end (javascript, php, mysql etc) language do mention. I think the cv shortlist was completely based on previous work and technical skills related to Web Development/Design mentioned in the CV.
Tip 3 : Focus on skills, projects and experiences more.
based on 2 interviews
Interview experience
based on 64 reviews
Rating in categories
Senior Director
50
salaries
| ₹14 L/yr - ₹30 L/yr |
Director
49
salaries
| ₹9.2 L/yr - ₹20 L/yr |
Consultant
17
salaries
| ₹6 L/yr - ₹12.5 L/yr |
Manager
17
salaries
| ₹6.5 L/yr - ₹13.3 L/yr |
Executive
9
salaries
| ₹3.9 L/yr - ₹5.8 L/yr |
Manappuram Finance
Abbott
Emcure Pharmaceuticals
Dainik Bhaskar Group