Decimal Point Analytics Software Engineer Interview Questions and Answers

Q1. Maximal rectangal
Add your answer
Q2. Loop in linked list
Ans. 
Loop in linked list is a situation where a node points to a previous node in the list, creating an infinite loop.
• Check for loops using Floyd's cycle detection algorithm

• Use two pointers, one moving twice as fast as the other, to detect a loop

• If the fast pointer catches up to the slow pointer, there is a loop
Answered by AI
Add your answer

Q1. Basic hr question regarding your project and all
Add your answer
Q2. He was more interested in what is my thinking pattern
Add your answer

Two easy questions two wasy questions two easy questions two easy questions

Q1. Technical interviews was very easy techijcal interviews was very easy very easy very easy
Add your answer
Q2. Interviews was conducted in advance of a news conference in the United Kingdom and the European government on Tuesday
Add your answer

Round one was an online coding test where there were 5 sections :

1 - dsa - medium

2 - Java - Easy

3 - OOP - Easy

4 - Git - Easy

Q1. 1 - where is bean annotation used in springboot ?... In class or method
Ans. 
Bean annotation is used in Spring Boot on class or method to indicate that a method produces a bean to be managed by the Spring container.
• Bean annotation is used on methods within a class to indicate that the method produces a bean to be managed by the Spring container.

• It can also be used at the class level to indicate that the class itself is a Spring bean.

• For example, @Bean annotation can be used on a method that cre...read more
Answered by AI
Add your answer
Q2. Which access modifier to restrict interface method access to only derived or implemented classes
Ans. 
Protected access modifier restricts interface method access to only derived or implemented classes.
• Use 'protected' access modifier to restrict access to only derived or implemented classes

• Protected members are accessible within the same package or by subclasses

• Example: 'protected void methodName() {}' in an interface
Answered by AI
Add your answer
Q3. How does one services interact with other in microservice
Ans. 
Microservices interact with each other through APIs, messaging, or events.
• Microservices communicate with each other through APIs, which can be synchronous or asynchronous.

• Messaging systems like RabbitMQ or Kafka can be used for communication between microservices.

• Events can be used for loosely coupled communication between microservices.

• Service discovery mechanisms like Eureka or Consul help microservices locate and co...read more
Answered by AI
Add your answer
Q4. In an integer array where element represent stock price and index represent days how to detect the best day to buy and best day to sell in O(N)
Ans. 
To detect the best day to buy and sell stock in an integer array representing stock prices and days in O(N).
• Iterate through the array and keep track of the minimum price seen so far.

• Calculate the profit by subtracting the current price from the minimum price.

• Update the maximum profit and best buy/sell days accordingly.

• Return the best buy and sell days to maximize profit.
Answered by AI
Add your answer
Q5. In an integer array find the next greatest number for all and display in O(N)
Ans. 
Find the next greatest number for each integer in an array in O(N) time complexity.
• Iterate through the array from right to left

• Use a stack to keep track of potential next greatest numbers

• Pop elements from the stack that are less than the current element and update their next greatest number to the current element

• Push the current element onto the stack

• Repeat until all elements have a next greatest number
Answered by AI
Add your answer

1 coding question, and basic MCQ

Coding testing with 15 questions MCQ based

Q1. 1 or 2 DSA questions, rest tech stack related questions were asked
Add your answer

Q1. This was a technofunctional round, kind of a managerial round.
Add your answer

Q1. This was a HR round
Add your answer

Q1. Reg BW and ABAP and XSA
Add your answer

Q1. Reg sap BW and ABAP and XSA
Add your answer

Q1. Company structure
Add your answer

Round duration - 120 minutes
Round difficulty - Easy

After round 1 there was a break of 15 mins and the coding round started.
We had a choice to attempt the exam in R language & SQL or python & sql
I chose python and sql
It had 8 questions 4 python and 4 sql

Q1. 
Longest Common Subsequence Problem Statement
Given two strings, S and T with respective lengths M and N, your task is to determine the length of their longest common subsequence.
A subsequence is a seque...read more
Ans. 
The task is to find the length of the longest common subsequence between two given strings.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the lengths of longest common subsequences of substrings.

• Iterate through the strings to fill the array and find the length of the longest common subsequence.

• Example: For strings 'abcde' and 'ace', the longest common subsequence is 'ace' with leng
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Medium

The interview was mostly analytical based and how you approach the round a few technical questions in dbms and oops were also asked.

Round duration - 20 Minutes
Round difficulty - Medium

Similar to first round
For Shortlists after elimination from first round.

Q1. 
Car Pooling Capacity Problem
You are a cab driver with a car that initially has 'C' empty seats. The car moves in a straight line towards the forward direction only. Your job is to determine if it is poss...read more
Ans. 
Determine if it is possible to accommodate all passenger trips within a car's capacity without exceeding it at any point.
• Iterate through each trip and keep track of the total number of passengers in the car at each point.

• Check if the total number of passengers exceeds the car capacity at any point.

• Return 'True' if all trips can be accommodated within the car capacity, otherwise return 'False'.
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

After two technical round interviews, the last round was a hr interview. The whole process can take up one whole day or more and your interview can be at any time
My process started at 5 pm and ended at 10:30 pm
All the interviewers were very friendly no pressure.

Q1. 
Nth Fibonacci Number Problem Statement
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.
Input:
...read more
Ans. 
Calculate the Nth Fibonacci number efficiently using dynamic programming.
• Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.

• Start with base cases F(1) and F(2) as 1, then iterate to calculate subsequent Fibonacci numbers.

• Time complexity can be optimized to O(N) using dynamic programming.

• Example: For N = 5, the 5th Fibonacci number is 5.
Answered by AI
Add your answer