i
QUICK HEAL TECHNOLOGIES
Filter interviews by
I was interviewed in Feb 2017.
Top trending discussions
I applied via Campus Placement and was interviewed in Jan 2016. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
To find a loop in a linked list, we use Floyd's cycle-finding algorithm.
Floyd's cycle-finding algorithm uses two pointers, one moving at twice the speed of the other.
If there is a loop in the linked list, the two pointers will eventually meet.
To detect the meeting point, we reset one of the pointers to the head of the linked list and move both pointers at the same speed.
The meeting point is the start of the loop.
LRU, MRU and LFU are caching algorithms used to manage memory in computer systems.
LRU stands for Least Recently Used and removes the least recently used items from the cache when the cache is full.
MRU stands for Most Recently Used and removes the most recently used items from the cache when the cache is full.
LFU stands for Least Frequently Used and removes the least frequently used items from the cache when the cache i...
posted on 17 May 2022
I was interviewed before May 2021.
Round duration - 60 minutes
Round difficulty - Easy
Timing - flexible 12 hours window to take the test. (9AM - 9PM)
Test was proctored
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
...
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.
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'....
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
Round duration - 40 minutes
Round difficulty - Easy
Timing - 9:00 AM - 9:40 AM
You are provided with a positive integer N. Your goal is to determine the smallest number whose factorial has at least N trailing zeros.
N = 1
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.
Given a singly linked list of integers, your task is to return the head of the reversed linked list.
The given linked list is 1 -> 2 -> 3 -&g...
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.
Round duration - 40 minutes
Round difficulty - Easy
Timing - 12:00 Pm to 12:40 PM
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...
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...
Given a binary tree with 'N' nodes, determine the size of the largest subtree that is also a BST (Binary Search Tree).
The first line contains an integer 'T', represen...
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
Round duration - 40 minutes
Round difficulty - Medium
Timing - 6:00 PM - 6:30 PM
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
Tip 1 : For fresher role, System design is not very important.
Tip 2 : Do at least 1-2 good quality projects.
Tip 1 : Have 1-2 good engaging projects in resume.
Tip 2 : Internships are helpful.
posted on 20 Nov 2023
Basic questions on core subject
One coding question with 5 marks
posted on 6 Apr 2024
I applied via Campus Placement and was interviewed before Apr 2023. There were 2 interview rounds.
Easy to moderate level questions.
There will be 3 coding que , easy , medium, hard
posted on 15 Jan 2024
I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.
General Aptitude Question
posted on 14 Dec 2024
I was interviewed in Nov 2024.
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.
posted on 2 Sep 2024
I applied via Campus Placement and was interviewed before Sep 2023. There were 3 interview rounds.
MCQ and essay writing
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...
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
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
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.
posted on 1 Aug 2024
based on 1 review
Rating in categories
Area Sales Manager
92
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Support Engineer
89
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
85
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
75
salaries
| ₹0 L/yr - ₹0 L/yr |
QA Engineer
52
salaries
| ₹0 L/yr - ₹0 L/yr |
Gen
McAfee
Kaspersky Lab
Oracle