Decimal Point Analytics Software Developer Intern Interview Questions, Process, and Tips

Basic aptitude questions

One graph and one DP question

Q1. Find the repeating element in the array
Ans. 
Use a hashmap to find the repeating element in the array of strings
• Iterate through the array and store each element in a hashmap with its frequency

• Check for any element with frequency greater than 1, that is the repeating element
Answered by AI
Add your answer
Q2. Define four pillars of OOPS.
Ans. 
Encapsulation, Inheritance, Polymorphism, Abstraction
• Encapsulation: Bundling data and methods that operate on the data into a single unit.

• Inheritance: Ability of a class to inherit properties and behavior from another class.

• Polymorphism: Ability to present the same interface for different data types.

• Abstraction: Hiding the complex implementation details and showing only the necessary features.
Answered by AI
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

Q1. 
Rahul and Minimum Subarray Challenge
Rahul, who is passionate about programming, is learning about arrays and lists. He faces a challenging problem to determine the smallest subarray length in a given arr...read more
Ans. 
The problem is to find the length of the smallest subarray in a given array with its sum greater than a given value.
• Iterate through the array and keep track of the current subarray sum

• If the current sum becomes greater than the given value, update the minimum subarray length

• If the current sum becomes negative, reset the sum and start a new subarray

• Return the minimum subarray length
Answered by AI
Add your answer
Q2. 
Maximum of All Subarrays of Size k
Given an array of 'N' non-negative integers and an integer 'K', your task is to find the maximum elements for each subarray of size 'K'.
Input:
The first line contains...read more
Ans. 
The task is to find the maximum elements for each subarray of size K in a given array.
• Iterate through the array and maintain a deque of indices of the maximum elements in the current window of size K.

• For each new element, remove indices from the deque that are outside the current window.

• Add the index of the new element to the deque, and print the maximum element of the window if the first index in the deque is outside
Answered by AI
Add your answer

Round duration - 20 Minutes
Round difficulty - Medium

This round was mostly resume-based. The interviewer asked about my projects and asked technical questions related to them. He then asked 1 DS question which was to detect whether the linked list is a circular linked list or not. He also asked me for a puzzle in the end.

Q1. 
Circular Linked List Detection
You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.
Note:
• A linked list is considered circula...read more
Ans. 
The task is to determine whether a given linked list is circular or not.
• A linked list is circular if the next pointer of the last node points to the first node.

• An empty linked list is also considered circular.

• Check if any node has its next pointer equal to NULL.

• All the integers in the linked list are unique.

• The next pointer of a node with i'th integer is linked to the node with data (i+1)'th integer.
Answered by AI
Add your answer

Round duration - 10 Minutes
Round difficulty - Easy