i
iamneo
Filter interviews by
Clear (1)
I applied via Indeed and was interviewed in Dec 2022. There were 3 interview rounds.
It has 30 questions and all of them were okay basic c and cpp
Top trending discussions
I applied via LinkedIn and was interviewed in May 2021. There were 4 interview rounds.
I applied via LinkedIn and was interviewed before Aug 2023. There were 2 interview rounds.
Online coding test with Sql and python questions
Spark context is the main entry point for Spark functionality and represents the connection to a Spark cluster.
Main entry point for Spark functionality
Represents connection to a Spark cluster
Used to create RDDs, broadcast variables, and accumulators
Inheritance is a concept in object-oriented programming where a class can inherit attributes and methods from another class.
Allows for code reusability by creating a new class based on an existing class
Derived class inherits properties and behaviors of the base class
Supports the concept of polymorphism and encapsulation
Example: Class 'Car' can inherit from class 'Vehicle' and inherit its attributes like 'color' and met
SparkConfig is a configuration object used in Apache Spark to set various parameters for Spark applications.
SparkConfig is used to set properties like application name, master URL, and other Spark settings.
It is typically created using SparkConf class in Spark applications.
Example: val sparkConf = new SparkConf().setAppName("MyApp").setMaster("local")
I applied via Job Portal and was interviewed before May 2023. There were 2 interview rounds.
90 min coding test with 4-5 problems to solve
I was interviewed before Dec 2020.
Round duration - 120 minutes
Round difficulty - Easy
After round 1 there was a break of 15 mins and the coding round started.
We had a choice to attempt the exam in R language & SQL or python & sql
I chose python and sql
It had 8 questions 4 python and 4 sql
Given two strings, S
and T
with respective lengths M
and N
, your task is to determine the length of their longest common subsequence.
A subsequence is a seque...
The task is to find the length of the longest common subsequence between two given strings.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of longest common subsequences of substrings.
Iterate through the strings to fill the array and find the length of the longest common subsequence.
Example: For strings 'abcde' and 'ace', the longest common subsequence is 'ace' with leng
Round duration - 15 minutes
Round difficulty - Medium
The interview was mostly analytical based and how you approach the round a few technical questions in dbms and oops were also asked.
Round duration - 20 Minutes
Round difficulty - Medium
Similar to first round
For Shortlists after elimination from first round.
You are a cab driver with a car that initially has 'C' empty seats. The car moves in a straight line towards the forward direction only. Your job is to determine if it is poss...
Determine if it is possible to accommodate all passenger trips within a car's capacity without exceeding it at any point.
Iterate through each trip and keep track of the total number of passengers in the car at each point.
Check if the total number of passengers exceeds the car capacity at any point.
Return 'True' if all trips can be accommodated within the car capacity, otherwise return 'False'.
Round duration - 20 minutes
Round difficulty - Easy
After two technical round interviews, the last round was a hr interview. The whole process can take up one whole day or more and your interview can be at any time
My process started at 5 pm and ended at 10:30 pm
All the interviewers were very friendly no pressure.
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.
Start with base cases F(1) and F(2) as 1, then iterate to calculate subsequent Fibonacci numbers.
Time complexity can be optimized to O(N) using dynamic programming.
Example: For N = 5, the 5th Fibonacci number is 5.
Tip 1 : Be fast ans accurate on your aptitude amd verbal tests.
Tip 2 : In coding round, depending on the difficulty of the questions the time in which you complete solving them should decrease .If almost everyone can solve them timming comes in to the equation for shortlisting
Tip 3 : While submitting your resume, please be honest about the projects you have done and do not bluff about it because in the interview when you ate drilled abt it, they can catch you easily.
Tip 4 : be confident and answer every question to the best of your ability and if u don't know something, tell them you don't know abt it .
Tip 1 : Research the company and put the most revalent projects and skills that the company os looking for specifically
Tip 2 : Do not bluff or lie on your resume. It show's during the interview.
I applied via Referral and was interviewed in Dec 2021. There were 4 interview rounds.
posted on 22 Sep 2023
Coding testing with 15 questions MCQ based
Prepare well on coding n programming
Topic will be give should talk for a min
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Engineer
26
salaries
| ₹0 L/yr - ₹0 L/yr |
Full Stack Developer
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Softwaretest Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Program Manager
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Fractal Analytics
Mu Sigma
Tiger Analytics
LatentView Analytics