Qualys Interview Experience | Software Engineer | 4 Rounds
- Posted
- 20 Oct 2026
Summary
I completed four interview rounds at Qualys for a Software Engineer position, covering a screening, two technical face‑to‑face rounds, and a managerial interview.
How it went
Recently interviewed at Qualys for a Software Engineer role. The process consisted of 4 rounds, including one screening round, two technical face-to-face rounds, and one managerial round.
Sharing the questions I was asked to help others preparing for similar interviews.
Round 1: Screening Round
This round focused on my background, experience, and expectations.
- Introduce yourself.
- Explain the projects you have worked on.
- What technical skills and technologies have you worked with?
- Why are you looking for a job change?
- What is your current CTC?
- What are your salary expectations?
Round 2: Technical Interview 1 (Face-to-Face)
Projects and DSA:
- Introduce yourself and explain your projects in detail.
- Linked List Cycle II: Detect a cycle in a linked list and return the node where the cycle begins. Explain the approach, time complexity, and space complexity.
- Valid Parentheses: Check whether a string containing brackets is valid. Explain the time and space complexity.
- Rotate Array: Rotate an array to the right by
ksteps, wherekis non-negative. Explain the different approaches and their exact time and auxiliary space complexities. Discuss the reversal algorithm in detail, including why it performs three reversals and how many operations are performed for each reversal, including the effect ofk % n.
C++ concepts:
- What are virtual functions in C++?
- Explain compile-time polymorphism vs. runtime polymorphism in C++.
AI, algorithms, and cloud:
- Questions about my AI projects and their implementation.
- Explain the HNSW (Hierarchical Navigable Small World) algorithm.
- Questions related to Google Cloud SQL.
Round 3: Technical Interview 2 (Face-to-Face)
- Introduce yourself and explain your projects in detail.
- Explain REST APIs and write a POST API method.
- Explain Java multithreading and its concepts.
- What are the different HTTP status codes?
- What are constraints in SQL?
- Write SQL queries based on the given requirements.
- Doubly Linked List: Delete a node at a given position. Explain the approach, time complexity, and auxiliary space complexity.
- Doubly Linked List: Insert a node at a given position. Explain the approach, time complexity, and auxiliary space complexity.
- Explain binary search, its implementation, and its time and space complexity.
- Explain how a multi-agent system works.
- What are a supervisor agent and subagents? How do they communicate, delegate tasks, and coordinate their execution?
Round 4: Managerial Interview
This round focused on my projects, problem-solving approach, and general technical understanding.
- Introduce yourself.
- Explain your projects in detail.
- Discuss your AI projects, their architecture, implementation, and challenges.
- Answer cross-questions related to the AI projects.
- Why are you looking for a job change?
- What is DNS, and how does it work?
- What is DHCP, and why is it required?
- Your laptop is running slowly. How would you troubleshoot the issue step by step?
Overall Experience
The interview process covered DSA, C++, Java, SQL, REST APIs, cloud technologies, AI projects, multi-agent systems, and networking fundamentals.
Preparation tip: Be thorough with your projects, practise DSA with detailed complexity analysis, and prepare to explain the architecture and implementation of every technology mentioned in your resume.
Hope this helps anyone preparing for interviews at Qualys. All the best!
Questions asked (17)
- 01
Linked List Cycle II
Data Structures & Algorithms · Medium
Detect a cycle in a linked list and return the node where the cycle begins. Explain the approach, time complexity, and space complexity.
- 02
Valid Parentheses
Data Structures & Algorithms · Easy
Check whether a string containing brackets is valid. Explain the time and space complexity.
- 03
Rotate Array
Data Structures & Algorithms · Easy
Rotate an array to the right by
ksteps, wherekis non‑negative. Explain the different approaches and their exact time and auxiliary space complexities. Discuss the reversal algorithm in detail, including why it performs three reversals and how many operations are performed for each reversal, including the effect ofk % n. - 04
Explain HNSW Algorithm
Other
Explain the HNSW (Hierarchical Navigable Small World) algorithm.
- 05
Write POST API Method
Other
Explain REST APIs and write a POST API method.
- 06
Java Multithreading Concepts
Other
Explain Java multithreading and its concepts.
- 07
HTTP Status Codes
Other
What are the different HTTP status codes?
- 08
SQL Constraints
Other
What are constraints in SQL?
- 09
SQL Query Writing
Other
Write SQL queries based on the given requirements.
- 10
Doubly Linked List – Delete Node
Data Structures & Algorithms · Medium
Delete a node at a given position in a doubly linked list. Explain the approach, time complexity, and auxiliary space complexity.
- 11
Doubly Linked List – Insert Node
Data Structures & Algorithms · Medium
Insert a node at a given position in a doubly linked list. Explain the approach, time complexity, and auxiliary space complexity.
- 12
Binary Search
Data Structures & Algorithms · Easy
Explain binary search, its implementation, and its time and space complexity.
- 13
Multi‑Agent System Explanation
Other
Explain how a multi‑agent system works.
- 14
Supervisor and Subagent Communication
Other
What are a supervisor agent and subagents? How do they communicate, delegate tasks, and coordinate their execution?
- 15
DNS Explanation
Other
What is DNS, and how does it work?
- 16
DHCP Explanation
Other
What is DHCP, and why is it required?
- 17
Laptop Troubleshooting Steps
Other
Your laptop is running slowly. How would you troubleshoot the issue step by step?
How they prepared
Be thorough with your projects, practise DSA with detailed complexity analysis, and prepare to explain the architecture and implementation of every technology mentioned in your resume.