Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Tiger Analytics interview experience Real time questions & tips from candidates to crack your interview

Tiger Analytics

3 rounds | 6 Coding
problems

Preparation

Duration: 3 months

Topics: Decorators,Multithreading,SQL,Classification Algorithms,Linear Algorithms,Clustering Algorithms,Case Studies

Tip

Tip 1 : Main Preparation should be on Python.

Tip 2 : Should know about everything you used in your project.

Tip 3 : Machine Learning Classification, Linear, Clustering algorithms and case studies should be well prepared.

Application process

Where: Linkedin

Eligibility: at least 6 CGPA

Resume tip

Tip 1: Resume should be one pager.

Tip 2: Mention your skill set in a graphical format.

01

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

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])

```
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)

02

Round

Medium

Face to Face

Duration60 Minutes

Interview date5 Apr 2022

Coding problem2

2 coding questions and then Question on Machine Learning and Linux

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

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]

```
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])

03

Round

Easy

Face to Face

Duration40 Minutes

Interview date7 Oct 2022

Coding problem2

2 programming Questions , Questions on projects.

```
A substring is a contiguous segment of a string.
```

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]

```
'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

Here's your problem of the day

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

Suppose list1 is [2, 133, 12, 12], what is max(list1) in Python?

Choose another skill to practice

Start a Discussion

Similar interview experiences

Programmer Analyst

4 rounds | 6 problems

Interviewed by Tiger Analytics

4782 views

0 comments

0 upvotes

SDE - 1

4 rounds | 8 problems

Interviewed by Amazon

1946 views

0 comments

0 upvotes

SDE - Intern

1 rounds | 3 problems

Interviewed by Amazon

823 views

0 comments

0 upvotes

SDE - 2

4 rounds | 6 problems

Interviewed by Expedia Group

552 views

0 comments

0 upvotes