TSS Consultancy Associate Business Analyst Interview Questions and Answers for Freshers

Round duration - 40 minutes
Round difficulty - Medium

Asked about time complexity of algorithm, puzzles, DBMS, cutting edge technologies etc. What are indexes?

Q1. 
Flip Bits Problem Explanation
Given an array of integers ARR of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...read more
Ans. 
Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.
• Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.

• Consider flipping a sub-array from index i to j and calculate the count of 1s in the resulting array.

• Return the maximum count of 1s obtained by flipping a sub-array at most once.
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Medium

Asked 1 standard algorithm

Q1. 
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...read more
Ans. 
Count the number of islands in a 2D matrix of 1s and 0s.
• Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.

• Mark visited cells to avoid redundant traversal.

• Increment island count whenever a new island is encountered.
Answered by AI
Add your answer

It was 2 coding questions of medium level

Q1. Longest substring with non repeating characters
Ans. 
Find the longest substring in a given string that does not contain any repeating characters.
• Use a sliding window approach to iterate through the string.

• Keep track of the characters seen so far using a set.

• Update the start and end indices of the window to find the longest substring.

• Return the length of the longest substring.
Answered by AI
Add your answer
Q2. Candy problem. There is similar question in geeks for geeks
Add your answer

Q1. What are your strengths and weaknesses?
Ans. 
I excel in problem-solving and teamwork, but I sometimes struggle with time management under tight deadlines.
• Strength: Strong problem-solving skills - I enjoy tackling complex coding challenges, like optimizing algorithms for better performance.

• Strength: Effective teamwork - I thrive in collaborative environments, having successfully led a project with cross-functional teams.

• Weakness: Time management - I occasionally u...read more
Answered by AI
Add your answer
Q2. Solve the given question using Binary trees (code given herein), and walk us through your approach.
Add your answer
Q3. Where do you see yourself in 5 years?
Ans. 
In five years, I envision myself as a lead software engineer, driving innovative projects and mentoring junior developers.
• I aim to lead a team on impactful projects, like developing scalable applications that enhance user experience.

• I plan to deepen my expertise in cloud technologies, contributing to projects that leverage AWS or Azure for better performance.

• I want to mentor junior engineers, sharing knowledge through ...read more
Answered by AI
Add your answer

There were 2 questions to test our basic coding knowledge.

Q1. Some basic introduction followed by sort 2 arrays into a single array.
Add your answer

Q1. Applications of various data structures.
Ans. 
Data structures are used in various applications like search algorithms, storage systems, and graph algorithms.
• Search algorithms like binary search use arrays and trees for efficient searching.

• Storage systems use data structures like hash tables and linked lists for organizing and accessing data.

• Graph algorithms like Dijkstra's algorithm use graphs and trees for solving complex problems.
Answered by AI
Add your answer

Q1. Some basic hr questions like tell me about yourself, what do you know about magicbricks,where do you see yourself in 5 years etc
Add your answer

This aptitude + technical MCQ test was of 120 minutes in duration. Had MCQs on quantitative ability, logical ability, Language, and technical MCQs consisted of questions on DBMS, OS, Networks, DSA. There were two coding questions as well. One on Bit Manipulating, and the other on DFS.

Q1. A question on BFS very similar to Leetcode 924. Was given one hour to discuss and come to an optimized solution with the interviewer.
Add your answer

Q1. Search an element in a sorted and rotated array
Ans. 
Search an element in a sorted and rotated array
• Find the pivot point where the array is rotated

• Divide the array into two sub-arrays based on pivot point

• Perform binary search on the appropriate sub-array
Answered by AI
Add your answer
Q2. SQL query on left join
Add your answer
Q3. Questions on CPP memory management
Add your answer
Q4. Questions related to projects done
Add your answer

Q1. Propose a system for a popular media stream service
Ans. 
Proposed system for a popular media stream service
• Implement a recommendation engine to suggest content based on user preferences and viewing history

• Integrate with social media platforms to allow users to share and discuss content

• Provide multiple subscription options with varying levels of access and features

• Ensure high-quality streaming with minimal buffering through the use of content delivery networks

• Implement robust...read more
Answered by AI
Add your answer
Q2. Questions related to Fullstack Tech Stacks
Add your answer

Guesstimate on number of Reddit users in India. No starting input was given. Gave solution by using bottom to top approach. Tried to focus on quantifying teenagers with internet access and a particular interest about internet. Gave a figure around ~1 million in a year.

Q1. Where do you see yourself at McKinsey?
Add your answer

Three coding questions and aptitude test.

Q1. What is the method for rotating an array by k positions in Core Computer Science?
Ans. 
One method to rotate an array by k positions is to reverse the array, then reverse the first k elements, and finally reverse the remaining elements.
• Reverse the entire array

• Reverse the first k elements

• Reverse the remaining elements

• Example: Array = ['a', 'b', 'c', 'd', 'e'], k = 2. After rotation: ['d', 'e', 'a', 'b', 'c']
Answered by AI
Add your answer

2 DSA questions related to hash map and binary tree

Q1. Technical interview dsa question on linked list and sql queries
Add your answer