Filter interviews by
Clear (1)
I applied via Job Portal and was interviewed in Jul 2024. There was 1 interview round.
I have over 5 years of experience in data engineering, working with large datasets and implementing data pipelines.
Developed and maintained ETL processes to extract, transform, and load data from various sources
Optimized database performance and implemented data quality checks
Worked with cross-functional teams to design and implement data solutions
Utilized tools such as Apache Spark, Hadoop, and SQL for data processing
...
I would start by understanding the requirements, breaking down the task into smaller steps, researching if needed, and then creating a plan to execute the task efficiently.
Understand the requirements of the task
Break down the task into smaller steps
Research if needed to gather necessary information
Create a plan to execute the task efficiently
Communicate with stakeholders for clarification or updates
Regularly track prog
I applied via Naukri.com and was interviewed in Oct 2023. There were 3 interview rounds.
Duration 45 minutes
Asked basic DSA questions (Arrays, String)
Spark optimisation techniques focus on improving performance and efficiency of Spark jobs.
Use partitioning to distribute data evenly
Cache intermediate results to avoid recomputation
Optimize shuffle operations to reduce data movement
Use broadcast variables for small lookup tables
Tune memory and executor settings for optimal performance
Top trending discussions
I was interviewed before Sep 2020.
Round duration - 140 minutes
Round difficulty - Medium
Test timing was at 2:00 pm , it was conducted in a college and the environment was good for the test. Camera was a primary part of test, so no suspicious activity.
Given two numbers in the form of two arrays where each element of the array represents a digit, calculate the sum of these two numbers and return this sum as an ar...
Given two numbers represented as arrays, calculate their sum and return the result as an array.
Iterate through the arrays from right to left, adding digits and carrying over if necessary
Handle cases where one array is longer than the other by considering the remaining digits
Ensure the final sum array does not have any leading zeros
Round duration - 20 minutes
Round difficulty - Easy
The round was conducted at around 12 p.m. I was called at the college location and then it was conducted. The interviewer was quite polite and frank.
Round duration - 8 minutes
Round difficulty - Easy
This round was conducted right after finishing and clearing the technical round at the same place and on the same day.
Tip 1 : Practice atleast 2-3 Coding problems daily so your logic building becomes stronger.
Tip 2 : Exercise problems based on OOPS concepts and others too.
Tip 3 : If you can have your own project built, then it's the major point and will act as a plus point.
Tip 1 : Your resume should be in standard form, short and simple will be more effective.
Tip 2 : Whatever you have learned, you need to mention it in your resume as that will be your primary source of selection and having project on your resume is important.
I applied via Campus Placement and was interviewed before Feb 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2020. There was 1 interview round.
I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.
I was interviewed before Jun 2021.
Round duration - 180 minutes
Round difficulty - Easy
It was an mcq + coding round. There were aptitude and ouput based question in mcq. And coding questions were easy
Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...
Find the duplicate number in an array of integers from 0 to (N-2).
Iterate through the array and keep track of the frequency of each number using a hashmap.
Return the number with a frequency greater than 1 as the duplicate number.
Time complexity can be optimized to O(N) using Floyd's Tortoise and Hare algorithm.
You are provided with a string S
and an array of integers A
of size M
. Your task is to perform M
operations on the string as specified by the indices in array A
...
Given a string and an array of indices, reverse substrings based on the indices to obtain the final string.
Iterate through the array of indices and reverse the substrings accordingly
Ensure the range specified by each index is non-empty
Return the final string after all operations are completed
Round duration - 60 Minutes
Round difficulty - Easy
It was technical + hr round. there were 2 people as interviewer. They stated from intro and asked some basic puzzles and hr questions. After that they asked about my projects, technologies and some ds algo and dbms questions.
Tip 1 : Practice aptitude
Tip 2 : Focus on practicing coding
Tip 3 : Learn from mistakes
Tip 1 : Mention some projects that you have done
Tip 2 : Try to have skills that are required for the role
I applied via Job Portal and was interviewed before Jan 2021. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Aug 2021. There were 2 interview rounds.
Easy DSA questions and some questions on resume
I applied via Campus Placement and was interviewed in Mar 2020. There was 1 interview round.
To get the second to last element from a SQL table, use the OFFSET-FETCH clause.
Use the ORDER BY clause to sort the table in descending order.
Use the OFFSET-FETCH clause to skip the last row and fetch the second to last row.
Example: SELECT column_name FROM table_name ORDER BY column_name DESC OFFSET 1 ROWS FETCH NEXT 1 ROWS ONLY;
based on 2 interviews
Interview experience
based on 1 review
Rating in categories
Technical Service Engineer
1.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Application Developer
995
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Application Developer
652
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Technical Service Engineer
582
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Application Developer
510
salaries
| ₹0 L/yr - ₹0 L/yr |
Accenture
TCS
HCLTech
Wipro