Filter interviews by
I applied via Campus Placement and was interviewed in Sep 2024. There was 1 interview round.
I applied via Campus Placement and was interviewed before Dec 2022. There were 4 interview rounds.
Group discussion on the topic of future of AI.
Artificial intelligence is used in the process industry for optimizing operations, predictive maintenance, and quality control.
Optimizing operations: AI algorithms can analyze large amounts of data to identify inefficiencies and suggest improvements in production processes.
Predictive maintenance: AI can analyze sensor data to predict equipment failures and schedule maintenance before breakdowns occur, reducing downtime...
I was interviewed in Jan 2022.
I was interviewed in Feb 2021.
Round duration - 120 minutes
Round difficulty - Easy
This was the first round and it consisted of MCQs and programming questions. This round was difficult.
You are provided with a string STR
of length N. The task is to find the longest palindromic substring within STR
. If there are several palindromic substring...
Given a string, find the longest palindromic substring within it, returning the one that starts with the smallest index if multiple substrings qualify.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found so far
Return the longest palindromic substring that starts with the smallest index
A thief plans to rob a store and can carry a maximum weight 'W' in his knapsack. There are 'N' items, with the i-th item weighing wi
and having a value vi
. Determine the max...
The 0-1 Knapsack Problem involves maximizing the value of items in a knapsack while respecting weight constraints.
Iterate through all possible combinations of items to find the optimal solution.
Use dynamic programming to store and reuse subproblem solutions.
Consider the weight limit and value of each item to make the best choice.
Example: For input [1, 2, 3], [10, 15, 40], and weight limit 6, the maximum value is 55.
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Keep track of previous, current, and next nodes while reversing
Update the head of the linked list to the last node after reversing
Round duration - 90 minutes
Round difficulty - Hard
This round is last round in this round they give some coding questions as well as few questions they ask related to computer science main subjects. We have to correct all the questions in this round, to clear this round.
You are provided with two arrays ARR1
and ARR2
both having an equal length N
. Your objective is to compute the maximum value of the expression:
|ARR1[ i ] - AR...
Compute the maximum value of a given expression involving two arrays.
Iterate through all possible pairs of indices i and j to calculate the expression value
Keep track of the maximum value found so far
Use absolute function to handle negative values appropriately
Tip 1 : Thorough with your details mentioned in your resume.
Tip 2 : Be confident
Tip 3 : Mention some good projects and internship on resume
Tip 4 : Practice atleast 200 to 250+ Data Structures and Algorithms Questions
Tip 1 : Mention projects which you can explain properly , don't copy someone else projects
Tip 2 : Having some achievements is plus point
Tip 3 : Resume should always be of 1 page (max 2)
Tip 4 : You can put links of your various online platforms profiles
Algo8 AI interview questions for popular designations
I was interviewed before Sep 2020.
Round duration - 95 minutes
Round difficulty - Easy
It was easy not much difficult , if your basics were clear then you can easily pass this round .
You are given a set of 'N' stones, each with a specific weight and color. The goal is to fill a knapsack with exactly 'M' stones, choosing one stone of each color, so that the to...
The goal is to fill a knapsack with exactly 'M' stones, one of each color, minimizing unused capacity.
Iterate through stones, keeping track of weights for each color
Sort stones by weight and color, then select one stone of each color
Calculate total weight for selected stones and find minimum unused capacity
Round duration - 20 minutes
Round difficulty - Easy
They just give basic questions
Tip 1 : Confidence is the key to excel any interview. Practice more questions and build up your confidence level.
Tip 2 : Understand the concepts first behind each algorithm and try to solve around 20-25 questions for each data structure. Practice the data structure portion from Codezen(they have really good content coverage and the right pool of questions), read few interview experiences from Geeks for Geek and the Algorithm questions from Leetcode.
Tip 3 : In an interview, if you get stuck in any question, don't panic. Try to ask about the constraints and cases from the interviewer and extract hints from it. Interviewers usually help you to reach to a solution.
Tip 1 : Keep it short and crisp. Utilise one full page wisely to describe yourself. It should not be more than a page.
Tip 2 : Focus on the Projects/Work Experience and Achievements Section.
posted on 30 Jan 2024
Simple mcq questions from java, msql, html, css, javascript
posted on 3 Jun 2021
I applied via Referral and was interviewed in May 2021. There were 3 interview rounds.
Append and Merge are two methods used to combine data from multiple sources into a single dataset.
Append adds new rows to an existing dataset.
Merge combines two or more datasets based on a common column or key.
Append is useful when adding new data to an existing dataset, while Merge is useful for combining datasets with related information.
Example: Appending new sales data to an existing sales dataset.
Example: Merging ...
I applied via Referral and was interviewed before Dec 2020. There were 4 interview rounds.
I applied via Naukri.com and was interviewed in Sep 2022. There were 3 interview rounds.
SQL test has been conducted nearer to 12-15 questions.
I applied via LinkedIn and was interviewed in May 2021. There were 4 interview rounds.
based on 2 interviews
Interview experience
based on 18 reviews
Rating in categories
Data Scientist
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Jr. Data Scientist
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Production Analyst
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Backend Developer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Fractal Analytics
Tiger Analytics
Mu Sigma
LatentView Analytics