Digtinctive Trainee Analyst Interview Questions and Answers

Just Basic Questions

Q1. SQL and SDLC Questions asked. Not too difficult.
Add your answer

Q1. Just Basic Discussion.
Add your answer

Round duration - 180 Minutes
Round difficulty - Medium

Coding question 2 easy,1 hard

Q1. 
Minimum Stops for Ninja's Journey Problem Statement
Ninja wishes to travel from his house to a destination X miles away. He knows there are Y gas stations along the way, each station i located at a distan...read more
Ans. Recursion
The simple idea that we use in this approach will be to check all the available paths. For this we create a recursive function let’s say MINIMUM_STOP_HELPER() that will return the desired path. The function will take fuel left, distance travelled, next gas station, and the array of all the stations as its parameters.
 
The base conditions for this recursive function will be:
 
• If you have enough fuel
• If y...read more
Answered Anonymously
Add your answer
Q2. 
Black Friday Discount Challenge
Imagine it's Black Friday and a supermarket is offering a discount to every 'Nth' customer. You are tasked with calculating bills for customers based on product prices and ...read more
Ans. Counting Number of Previous Customers
We can simply start by creating a hashmap that stores each product ID and corresponding price. For each customer, calculating the bill amount is simple, just multiply the quantity by the price of each product they purchased.
 
We also keep a count of previous customers and increase it as soon as generateBill is called. If this count is divisible by ‘N’, we simply apply the discou...read more
Answered Anonymously
Add your answer
Q3. 
Ninja and His Secret Information Encoding Problem
Ninja, a new member of the FBI, has acquired some 'SECRET_INFORMATION' that he needs to share with his team. To ensure security against hackers, Ninja dec...read more
Ans. Brute Force
For encoding the given ‘SECRET_INFORMATION’ we can use any algorithm. Here first, we append the number of words of ‘SECRET_INFORMATION’ and ‘!’ into our resultant decoding string ‘ENCODED_INFORMATION’. Then we append the length of each word and ‘!’. At last, we find the ‘ASCII’ value of each character and then add 3 into the ASCII value. Then we convert this ASCII value into a character and replace this with...read more
Answered Anonymously
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

Asked me how to reverse string,tell me about yourself,visualise data structures in real life,dbms questions easy one

Q1. 
Reverse the String Problem Statement
You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.
Example:
Input:
STR = "abcde"
Output:
"e...read more
Ans. Optimal Solution
• Traverse the string and swap the first character with the last character, the second character with the second last character and so on.
• Basically, you need to swap the i-th character with the (N-i-1)-th character where N is the length of the string and 0-based indexing is considered.
Space Complexity: O(1)Explanation:
O(1).
 
In the worst case, only constant extra space is required.
Time Complexity: O(...read more
Answered Anonymously
Add your answer

Basic coding questions

Q1. Resume based questions and SQL
Add your answer

Programming basics, aptitude, Reasoning

Questions related to string manipulation

Q1. Tell me about your self?
Add your answer
Q2. Some coding related questions based on Exam questions
Add your answer

Q1. It was a combination of aptitude, technical (most of the questions From cloud computing) and coding (2 questions)
Add your answer

Q1. It was combined with both technical and hr... first I was asked to introduce abt myself...and then I was abt to solve some SQL queries and then I was abt to answer some python related questions...
Add your answer

Its very easy to crack the first round that consist of apt and 2 codings

Q1. This round is based on programmings and engineering fundamental subjects like ds,dbms,sql,oops,os.
Add your answer
Q2. Hr round also conducted in the same round
Add your answer