STEPapp Interview Questions and Answers

Q1. Information about yourself
Ans. 
I am a highly motivated and detail-oriented analyst with strong problem-solving skills.
• Bachelor's degree in Business Analytics

• Proficient in data analysis tools such as Excel and SQL

• Experience in conducting market research and competitor analysis

• Strong analytical and critical thinking abilities

• Excellent communication and presentation skills

• Ability to work independently and in a team
Answered by AI
Add your answer
Q2. Information about yourself.
Ans. 
I am a highly skilled Analyst with expertise in data analysis and problem-solving.
• Proficient in statistical analysis and data visualization tools such as Excel, Tableau, and Python

• Strong analytical skills with the ability to interpret complex data sets and identify trends

• Experience in conducting market research and competitor analysis

• Excellent communication and presentation skills

• Proven track record of delivering actio
Answered by AI
Add your answer

Q1. Oops Inheritance and Incapsulation
Add your answer

Q1. Techical questions and coding questions related profile.
Add your answer
Q2. Basic concepts about your programming skills.
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Timing was late evening. Platform was good.

Q1. 
Largest Cycle in Maze Problem Statement
Given a maze represented by 'N' cells numbered from 0 to N-1, and an array arr of 'N' integers where arr[i] denotes the cell number that can be reached from the 'i'...read more
Ans. 
Identify the length of the largest cycle in a maze represented by cells and an array of integers.
• Iterate through each cell and find the cycle length using DFS or Floyd's Tortoise and Hare algorithm.

• Handle self-cycles and cells with no exit by checking arr[i] = i and arr[i] = -1 respectively.

• Output the length of the largest cycle found or -1 if no cycles exist.
Answered by AI
Add your answer
Q2. 
Ninja and the Maze Problem Statement
Ninja is stuck in a maze represented as a 2D grid. He can move in four directions (Up, Down, Left, Right) until he hits a wall ('1'). Once stopped, he can choose a new...read more
Ans. 
Determine if Ninja can reach the destination in a maze by moving in four directions until hitting a wall.
• Create a function to traverse the maze using depth-first search or breadth-first search.

• Keep track of visited cells to avoid infinite loops.

• Return 'True' if destination is reachable, 'False' otherwise.
Answered by AI
Add your answer

Basic aptitude,sql ques

Visualizing the dataset information

Q1. SQL: left join, right join and inner join questions find out the latest entry for an user when they log in to a app Python: few basic questions on python like count the characters in a word. Linux: what co...read more
Add your answer