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

Data Analyst

Tredence Analytics
upvote
share-icon
3 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 4 months
Topics: Data Structures, OOPS ,PYTHON ,C++ ,SQL.
Tip
Tip

Tip 1 : Be consistent
Tip 2 : Be confident
Tip 3 : Do Projects as many as possible

Application process
Where: Campus
Eligibility: 6.5
Resume Tip
Resume tip

Tip 1 : Must be clean and simple
Tip 2 : You must know things mentioned in resume

Interview rounds

01
Round
Easy
Online Coding Interview
Duration90 minutes
Interview date8 Apr 2021
Coding problem2

1. Puzzle Question

There are 5 lanes on a race track. One needs to find out the 3 fastest horses among total of 25. Find out the minimum number of races to be conducted in order to determine the fastest three.

Problem approach

Tip 1 : Practice some questions of puzzles
Tip 2 : Try to collect every information in question
 

2. Subtree of Another Tree

Easy
10m average time
90% success
0/40
Asked in companies
MicrosoftFacebookAmazon

Given two binary trees T and S, check whether tree S has exactly the same structure and node values with a subtree of T, i.e., check if tree S is a subtree of the tree T.

A subtree of a tree T is a tree S consisting of a node in T and all of its descendants in T. The subtree corresponding to the root node is the entire tree; the subtree corresponding to any other node is called a proper subtree.

Try solving now
02
Round
Easy
Face to Face
Duration30 minutes
Interview date23 Apr 2021
Coding problem1

1on1 video call , they are testing my coding skills and problem solving skills. 1 coding question was asked.

1. Intersection of Two Linked Lists

Easy
25m average time
73% success
0/40
Asked in companies
OracleThought WorksIBM

You are given two Singly Linked Lists of integers, which may have an intersection point.

Your task is to return the first intersection node. If there is no intersection, return NULL.


Example:-
The Linked Lists, where a1, a2, c1, c2, c3 is the first linked list and b1, b2, b3, c1, c2, c3 is the second linked list, merging at node c1.

alt.txt

Problem approach

I ask interviewer for some hint and to explain again.

Try solving now
03
Round
Easy
HR Round
Duration20 minutes
Interview date3 May 2021
Coding problem1

They tried to know about me.

1. Basic HR Questions

Introduction.

Why should we hire you ?

Where are you seeing yourself after 5 year?

Problem approach

Tip 1 : Confidence is key
Tip 2 : Honest answers
 

Here's your problem of the day

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

Skill covered: Programming

How do you remove whitespace from the start of a string?

Choose another skill to practice
Similar interview experiences
Data Analyst
3 rounds | 7 problems
Interviewed by Tredence Analytics
3131 views
0 comments
0 upvotes
Business Analyst
3 rounds | 2 problems
Interviewed by Tredence Analytics
2308 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Tredence Analytics
845 views
0 comments
0 upvotes
Data Analytics
2 rounds | 4 problems
Interviewed by Tredence Analytics
1555 views
0 comments
0 upvotes