Apptad Inc. interview experience Real time questions & tips from candidates to crack your interview

Data Engineer

Apptad Inc.
upvote
share-icon
3 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Journey
Constant working on my core primary skills and regular practice along with hands on experience on coding platforms helped me to be on top of my game.
Application story
I applied for the relevant jobs according to my role, and after multiple rounds, they released the offer.
Why selected/rejected for the role?
I was selected because I showed my technical skills, problem solving skills and ensured that they understand my previous project very well.
Preparation
Duration: 2 months
Topics: Data Structures & Algorithms, Python, AWS, SQL, System Design
Tip
Tip

Tip 1 : Study and research are the key to success in IT field.
Tip 2 : Keep practicing DSA Questions.
Tip 3 : Ask questions from your mentors.

Application process
Where: Linkedin
Eligibility: 70% or more in BTech and 12th. Relevant experience with data.
Resume Tip
Resume tip

Tip 1 : Keep it short and crisp.
Tip 2 : Mention adjectives and implementation steps.

Interview rounds

01
Round
Medium
Video Call
Duration60 minutes
Interview date11 May 2023
Coding problem3

1. Distinct Occurences

Moderate
15m average time
85% success
0/80
Asked in companies
IBMAccoliteZscaler

You are given two strings 'A' and 'B' of length 'N' and 'M' respectively, your task is to find the number of distinct occurrences of string 'B' in the string A as a subsequence.

Note:
1. A subsequence is a sequence generated from a string after deleting some characters of string without changing the order of remaining string characters.

2. 'A' and 'B' will be non-empty strings.
Problem approach

Sort Array in Ascending order.
Loop from 0 to nums.length - 1
Compare array a[i] and a[1+1]
If they are equal, then return true.
When finish the loop, return False.

Try solving now

2. Jump Game

Moderate
25m average time
75% success
0/80
Asked in companies
OracleUberShareChat

There is an array 'JUMP' of size 'N' which is 1-indexed and you are currently at index 1. Your goal is to reach index 'N' (end).


When you are at index 'i', you can jump a maximum length of 'JUMP[i]' which means you can make a jump of size 1 to JUMP[i]. Return true if you can reach the end otherwise false.


Example:-
N = 5
JUMP = [1,2,3,4,5]

ANSWER:- The answer should be YES as you can jump from 1st index to 2nd index, from 2nd index to 4th index, and from 4th index to 5th index.
Try solving now

3. Puzzle

A man fell into a 50-meter deep well. He climbs 4 meters up and slips 3 meters down each day. How many days will it take for him to come out of the well?

Problem approach

On the first day, the man climbs 4 meters up and slips 3 meters down; therefore, he only climbs a total of 1 meter up. On the second day, he again climbs 1 meter up, so the total distance climbed is 2 meters by the end of the second day. Therefore, the man climbs 1 meter every day.

02
Round
Medium
Video Call
Duration60 minutes
Interview date18 May 2023
Coding problem2

1. First and Last Position of an Element In Sorted Array

Easy
15m average time
85% success
0/40
Asked in companies
AmazonMicrosoftAdobe

You have been given a sorted array/list 'arr' consisting of ‘n’ elements. You are also given an integer ‘k’.


Now, your task is to find the first and last occurrence of ‘k’ in 'arr'.


Note :
1. If ‘k’ is not present in the array, then the first and the last occurrence will be -1. 
2. 'arr' may contain duplicate elements.


Example:
Input: 'arr' = [0,1,1,5] , 'k' = 1

Output: 1 2

Explanation:
If 'arr' = [0, 1, 1, 5] and 'k' = 1, then the first and last occurrence of 1 will be 1(0 - indexed) and 2.


Problem approach

At first use binary search. When your mid value will be equal to the target, then use two different binary search on the left part and right part of the mid.

Try solving now

2. Find Peak Element

Easy
15m average time
85% success
0/40
Asked in companies
GrabDunzoHike

You are given an array 'arr' of length 'n'. Find the index(0-based) of a peak element in the array. If there are multiple peak numbers, return the index of any peak number.


Peak element is defined as that element that is greater than both of its neighbors. If 'arr[i]' is the peak element, 'arr[i - 1]' < 'arr[i]' and 'arr[i + 1]' < 'arr[i]'.


Assume 'arr[-1]' and 'arr[n]' as negative infinity.


Note:
1.  There are no 2 adjacent elements having same value (as mentioned in the constraints).
2.  Do not print anything, just return the index of the peak element (0 - indexed).
3. 'True'/'False' will be printed depending on whether your answer is correct or not.


Example:

Input: 'arr' = [1, 8, 1, 5, 3]

Output: 3

Explanation: There are two possible answers. Both 8 and 5 are peak elements, so the correct answers are their positions, 1 and 3.


Problem approach

If element at point is greater that Neighbour's, then return the element.
If element at point is greater than next element, then peak can occur on the left of this element.
If element at point is lesser than next element, then peak can occur on the right of this element.
If element at point is smaller than Neighbour's, then peak can occur on the right of this element.

Try solving now
03
Round
Easy
HR Round
Duration30 minutes
Interview date26 May 2023
Coding problem1

1. Basic HR Questions

Tell me about yourself.

Tell me about your family.

Why are you looking for a job?

Why do you think you are fit for this role?

Problem approach

Tip 1 : Be confident.
Tip 2 : Be clear and concise.
Tip 3 : Take a quick look about company and its business.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
8519 views
0 comments
0 upvotes
Analytics Consultant
3 rounds | 10 problems
Interviewed by ZS
908 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
3320 views
0 comments
0 upvotes
company logo
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
2581 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Data Engineer
2 rounds | 4 problems
Interviewed by Amazon
1838 views
0 comments
0 upvotes
company logo
Data Engineer
4 rounds | 15 problems
Interviewed by Intuit
0 views
0 comments
0 upvotes