QUICK HEAL TECHNOLOGIES Associate Software Engineer Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Easy

Timing - flexible 12 hours window to take the test. (9AM - 9PM)
Test was proctored

Q1. 
Combination Sum Problem Statement
Given three integers X, Y, and Z, calculate the sum of all numbers that can be formed using the digits 3, 4, and 5. Each digit can be used up to a maximum of X, Y, and Z ...read more
Ans. 
Calculate the sum of all numbers that can be formed using the digits 3, 4, and 5 with given constraints.
• Iterate through all possible combinations of 3, 4, and 5 based on the given constraints.

• Calculate the sum of each combination and add them up.

• Return the final sum modulo 10^9 + 7.
Answered by AI
Add your answer
Q2. 
Longest Path In Directed Graph Problem Statement
Given a Weighted Directed Acyclic Graph (DAG) comprising 'N' nodes and 'E' directed edges, where nodes are numbered from 0 to N-1, and a source node 'Src'....read more
Ans. 
The task is to find the longest distances from a source node to all nodes in a weighted directed acyclic graph.
• Implement a function that takes the number of nodes, edges, source node, and edge weights as input.

• Use a topological sorting algorithm to traverse the graph and calculate the longest distances.

• Return an array of integers where each element represents the longest distance from the source node to the correspondi
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

Timing - 9:00 AM - 9:40 AM

Q1. 
Factorial Trailing Zeros Problem
You are provided with a positive integer N. Your goal is to determine the smallest number whose factorial has at least N trailing zeros.
Example:
Input:
N = 1
Output:
...read more
Ans. 
Find the smallest number whose factorial has at least N trailing zeros.
• Calculate the number of 5's in the prime factorization of the factorial to determine the trailing zeros.

• Use binary search to find the smallest number with at least N trailing zeros.

• Consider edge cases like N = 0 or N = 1 for factorial trailing zeros problem.
Answered by AI
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, your task is to return the head of the reversed linked list.
Example:
Input:
The given linked list is 1 -> 2 -> 3 -&g...read more
Ans. 
To reverse a singly linked list of integers, return the head of the reversed linked list.
• Iterate through the linked list, reversing the pointers to point to the previous node instead of the next node.

• Keep track of the previous, current, and next nodes while traversing the list.

• Update the head of the reversed linked list to be the last element of the original list.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

Timing - 12:00 Pm to 12:40 PM

Q1. 
Implementing a Priority Queue Using Heap
Ninja has been tasked with implementing a priority queue using a heap data structure. However, he is currently busy preparing for a tournament and has requested yo...read more
Ans. 
Implement a priority queue using a heap data structure by completing the provided functions: push(), pop(), getMaxElement(), and isEmpty().
• Understand the operations: push() to insert element, pop() to remove largest element, getMaxElement() to return largest element, and isEmpty() to check if queue is empty.

• Implement a heap data structure to maintain the priority queue.

• Handle different types of queries based on the inp...read more
Answered by AI
Add your answer
Q2. 
Largest BST Subtree Problem
Given a binary tree with 'N' nodes, determine the size of the largest subtree that is also a BST (Binary Search Tree).
Input:
The first line contains an integer 'T', represen...read more
Ans. 
The problem involves finding the size of the largest subtree that is also a Binary Search Tree in a given binary tree.
• Traverse the binary tree in a bottom-up manner to check if each subtree is a BST.

• Keep track of the size of the largest BST subtree encountered so far.

• Use recursion to solve the problem efficiently.

• Consider edge cases like empty tree or single node tree.

• Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

Timing - 6:00 PM - 6:30 PM

Q1. Can you design a system similar to Splitwise and identify three features that you would change or improve?
Ans. 
Design a system similar to Splitwise and suggest three features for improvement.
• Implement a real-time notification system for updates on shared expenses

• Integrate a feature for automatic currency conversion for international transactions

• Enhance the user interface with data visualization tools for better expense tracking
Answered by AI
Add your answer

Basic questions on core subject

One coding question with 5 marks

Q1. Self intro brief discussion on projects questions related to projects core subject questions like digitial electronics basic python questions coding questions like palindrome
Add your answer

Easy to moderate level questions.

There will be 3 coding que , easy , medium, hard

General Aptitude Question

Q1. Project related question
Add your answer
Q2. One programming question factorial of 5
Add your answer

Q1. Basic behavioral question
Add your answer

Q1. Questions based on selected track.
Add your answer

The programming languages available for coding were determined by the chosen track (AI-ML in my case), which included Python and Java. Two coding challenges centered on array and string manipulation, with difficulty levels categorized as easy and medium.

Q1. Total of 13 questions. No interviewer. AI based Interview. Questions included Technical questions , a coding question and HR questions as well.
Add your answer

MCQ and essay writing

Q1. What are Oops concepts ?
Ans. 
Oops concepts are the principles of Object Oriented Programming, including Inheritance, Encapsulation, Polymorphism, and Abstraction.
• Inheritance: Allows a class to inherit properties and behavior from another class.

• Encapsulation: Bundling data and methods that operate on the data into a single unit.

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

• Abstraction: Hiding the complex implementatio...read more
Answered by AI
Add your answer
Q2. What is join and types of join?
Ans. 
Join is used to combine rows from two or more tables based on a related column between them.
• Types of joins include inner join, outer join (left, right, full), cross join, self join.

• Inner join returns rows when there is at least one match in both tables.

• Outer join returns all rows from one table and matching rows from the other table.

• Cross join returns the Cartesian product of the two tables.

• Self join is used to join a
Answered by AI
Add your answer

Q1. Tell be about yourself
Ans. 
I am a recent graduate with a degree in Computer Science and a passion for software development.
• Recent graduate with a degree in Computer Science

• Passionate about software development

• Experience with programming languages like Java and Python
Answered by AI
Add your answer
Q2. What are your hobbies
Ans. 
My hobbies include playing guitar, hiking, and reading science fiction novels.
• Playing guitar: I enjoy learning new songs and practicing different techniques.

• Hiking: I love exploring nature trails and challenging myself with long hikes.

• Reading science fiction novels: I find it fascinating to immerse myself in futuristic worlds and imaginative stories.
Answered by AI
Add your answer

Q1. Encapsulation inheritance oops etc
Add your answer
Q2. Bitwise operations
Add your answer