Sub-K IMPACT Solutions Senior BI Developer Interview Questions and Answers

The test carried 7 sections of aptitude with no negative markings and the questions were also easy with time duration of 1 hours which was to be used for the coding round also

Basic understanding was checked, if basics are clear of DSA and computer science fundamentals then very easy to crack

Reasoning, math, verbal

Q1. Personal questions
Add your answer

Q1. JavaScript problems
Add your answer
Q2. Modifying existing React application as asked & also integration with API
Add your answer
Q3. Theoretical JavaScript questions
Add your answer
Q4. Unit testing related knowledge check
Add your answer

Q1. Bundler related questions
Add your answer
Q2. Transpiling or, compiling related questions
Add your answer
Q3. High level technical knowledge check, not much deep-dive
Add your answer

Q1. Checking cultural fit
Add your answer
Q2. Checking relocation comfortability
Add your answer
Q3. Reason of interest in organisation
Ans. 
I am interested in your organization because of your innovative projects and strong reputation in the industry.
• Impressed by the innovative projects your organization has worked on

• Strong reputation in the industry

• Positive reviews from current and former employees
Answered by AI
Add your answer
Q4. Compensation discussion & detailed information
Add your answer

Technical MCQ and coding (medium)

This was long programing round. In this you need to design a application. First you need do ER or class diagram. Then you need code in any programing language but OOPS is prefered. They see is app is scalable and data modeling

Q1. Basing OOPS, DBMS, SQL and DS
Add your answer
Q2. Sql joins and normalisation
Add your answer
Q3. Sort stack ds and real life example
Ans. 
Sorting a stack data structure and its real-life example
• Sorting a stack involves popping elements and comparing them to the remaining elements in the stack

• Real-life example: arranging books on a shelf in alphabetical order

• Another example: sorting a deck of cards by suit and rank
Answered by AI
Add your answer
Q4. Question from resume and previous round solution
Add your answer

Q1. I got a referral and was directly called into the first round of interview.
Add your answer
Q2. 1.5 hrs round, coding questions were there( can’t reveal ). Low level system design. Questions based on Frontend
Add your answer

Q1. Managerial round. 1 hour. In depth questions . Focused mainly upon projects, work done, etc.
Add your answer

Q1. Basic hr questions and salary negotiations.
Add your answer

There are 30 questions Mixed with Aptitude, AWS, OS

Q1. 1. what is OOPS Concept?
Ans. 
OOPS (Object-Oriented Programming) is a programming paradigm that uses objects to represent and manipulate data.
• OOPS focuses on the concept of objects, which are instances of classes.

• It emphasizes encapsulation, inheritance, and polymorphism.

• Encapsulation ensures data hiding and abstraction.

• Inheritance allows classes to inherit properties and behaviors from other classes.

• Polymorphism enables objects to take on multiple...read more
Answered by AI
View 1 more answer
Q2. Database questions and data structure questions?
Add your answer

Round duration - 100 minutes
Round difficulty - Easy

Test started at 04:00 PM sharp and complete the same by 06:00 PM.
The test duration is 1 hour 40 minutes.
Environment (Amcat) is user friendly.
Web cam and mic were enabled

Q1. Longest Palindromic Subsequence
You have been given a string ‘A’ consisting of lower case English letters. Your task is to find the length of the longest palindromic subsequence in ‘A’.
A subsequence is ...read more
Ans. Recursive Approach
The main idea behind this approach is to use recursion. The idea is to compare the first character of the string A[i..j] with its last character. There are two possibilities:
1. If the first character of the string is the same as the last character, we include first and last characters in the palindrome and do a recursive call for the remaining substring A[i + 1, j - 1].
2. If the last character of the string...read more
Answered by CodingNinjas
View 1 more answer
Q2. Ways To Make Coin Change
You are given an infinite supply of coins of each of denominations D = {D0, D1, D2, D3, ...... Dn-1}. You need to figure out the total number of ways W, in which you can make a cha...read more
Ans. Recursion
 
1. The idea is to use recursion.
2. For a particular coin, we have two options either include it or exclude it.
3. If we include that coin, then calculate the remaining number that we have to generate so recur for that remaining number.
4. If we exclude that coin, then recur for the same amount that we have to make.
5. Our final answer would be the total number of ways either by including or excluding.
6. There will be two edg...read more
Answered by CodingNinjas
View 3 more answers

Round duration - 45 minutes
Round difficulty - Hard

Interview stared at 11:00 am and went for 90 min.
Interview was held in zoom
Environment was very much user friendly

Q1. Maximum Sum of nodes in a binary tree such that no two nodes are adjacent
You have been given a binary tree with an integer value associated to each node. You are supposed to choose a subset of these nodes...read more
Ans. Using Memoization
Keeping in mind the fact that both node and its children can not be considered for the maximum sum at the same time, we know that if we take a node into our sum, then we will directly call recursively for its grandchildren, OR if we don't take the node into our consideration, we will call for its child nodes and finally consider the maximum sum from both these results.
 
Considering the above idea, ...read more
Answered by CodingNinjas
View 1 more answer
Q2. Basic Puzzles
There are 3 mislabeled jars, with apple and oranges in the first and second jar respectively. The third jar contains a mixture of apples and oranges. You can pick as many fruits as required to...read more
Add your answer