Machine learning engineer Tiger Analytics interview experience

Interview rounds

Round

Medium

Online Coding Interview

Duration60 minutes

Interview date1 Apr 2022

Coding problem2

Round comprises of 10 MCQS , 2 SQL Queries and 2 Programming Questions

1. First Missing Positive

Moderate

18m average time

84% success

0/80

Asked in companies

You are given an array 'ARR' of integers of length N. Your task is to find the first missing positive integer in linear time and constant space. In other words, find the lowest positive integer that does not exist in the array. The array can have negative numbers as well.

For example, the input [3, 4, -1, 1] should give output 2 because it is the smallest positive number that is missing in the input array.

Problem approach

first remove negative values using list comprehension
and using sorted of list comprehension of first output from range(min,max) and check with the values of list
x=[1,-1,3,7,8,0,2,5,-6]
l=sorted([i for i in x if i>0])
v=[j for j in range(l[0],l[-1]+1) if j not in l]
print(v[0])

Try solving now

2. Missing Numbers

Easy

28m average time

85% success

0/40

Asked in companies

You are given an array 'ARR' of distinct positive integers. You need to find all numbers that are in the range of the elements of the array, but not in the array. The missing elements should be printed in sorted order.

Example:

If the given array is [4, 2, 9] then you should print "3 5 6 7 8". As all these elements lie in the range but not present in the array.

Problem approach

l=[1,3,4,5,9,10]
d=[]
for i in range(max(l)):
if i not in l:
d.append(i)
print(d)

Try solving now

Round

Medium

Face to Face

Duration60 Minutes

Interview date5 Apr 2022

Coding problem2

2 coding questions and then Question on Machine Learning and Linux

1. Subarray With Given Sum

Moderate

15m average time

85% success

0/80

Asked in companies

Given an array ARR of N integers and an integer S. The task is to find whether there exists a subarray(positive length) of the given array such that the sum of elements of the subarray equals to S or not. If any subarray is found, return the start and end index (0 based index) of the subarray. Otherwise, consider both the START and END indexes as -1.

Note:

If two or more such subarrays exist, return any subarray.

For Example: If the given array is [1,2,3,4] and the value of S is equal to 7. Then there are two possible subarrays having sums equal to S are [1,2,3] and [3,4].

Problem approach

Function to find a continuous sub-array which adds up to a given number.
class Solution:
def subArraySum(self,arr, n, s):
#Write your code here
left , right = 0 , 0
cur_sum = 0
while left < n :
if cur_sum ==s :
if left+1 > right :
return [-1]
return [left+1, right]

if cur_sum < s and right cur_sum += arr[right]
right +=1
else:
cur_sum-=arr[left]
left+=1
return [-1]

Try solving now

2. Kth Smallest Element

Easy

15m average time

85% success

0/40

Asked in companies

You are given an array of integers 'ARR' of size 'N' and another integer 'K'.

Your task is to find and return 'K'th smallest value present in the array.

Note: All the elements in the array are distinct.

Example

If 'N' is 5 and 'K' is 3 and the array is 7, 2, 6, 1, 9

Sorting the array we get 1, 2, 6, 7, 9

Hence the 3rd smallest number is 6.

Problem approach

class Solution:
def kthSmallest(self,arr, l, r, k):
arr.sort()
return(arr[k-1])

Try solving now

Round

Easy

Face to Face

Duration40 Minutes

Interview date7 Oct 2022

Coding problem2

2 programming Questions , Questions on projects.

1. Longest Palindromic Substring

Moderate

20m average time

80% success

0/80

Asked in companies

You are given a string ('STR') of length 'N'. Find the longest palindromic substring. If there is more than one palindromic substring with the maximum length, return the one with the smaller start index.

Note:

A substring is a contiguous segment of a string.

For example : The longest palindromic substring of "ababc" is "aba", since "aba" is a palindrome and it is the longest substring of length 3 which is a palindrome, there is another palindromic substring of length 3 is "bab" since "aba" starting index is less than "bab", so "aba" is the answer.

Problem approach

def longestPalin(self, S):

fi = fj = 0

n = len(S)

for i in range(n):

# odd length palindrome with current index as center

j = i - 1

k = i + 1

while j >= 0 and k < n:

if S[j] != S[k]:

break

j -= 1

k += 1

if k-j-1 > fj-fi+1:

fi = j + 1

fj = k - 1

# even length palindrome if possible

if i < n-1 and S[i] == S[i+1]:

j = i - 1

k = i + 2

while j >= 0 and k < n:

if S[j] != S[k]:

break

j -= 1

k += 1

if k-j-1 > fj-fi+1:

fi = j + 1

fj = k - 1

return S[fi:fj+1]

Try solving now

2. Valid Parentheses

Easy

10m average time

80% success

0/40

Asked in companies

You're given a string 'S' consisting of "{", "}", "(", ")", "[" and "]" .

Return true if the given string 'S' is balanced, else return false.

For example:

'S' = "{}()".

There is always an opening brace before a closing brace i.e. '{' before '}', '(' before ').
So the 'S' is Balanced.

Problem approach

def ispar(self,x):
# code here
opens=['(','{','[']
close=[')','}',']']
stack=[-1]
l=list(x)
for i in range(len(x)):
if x[i] in opens:
stack.append(x[i])
else:
index = close.index(x[i])
if len(stack) > 1 and stack[-1] == opens[index]:
stack.pop()
else:
stack.append(x[i])

if stack[-1]==-1:
return True
else:
return False