i
QSS Technosoft Inc.
Filter interviews by
I applied via LinkedIn and was interviewed in Oct 2024. There was 1 interview round.
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 50 minutes
Round difficulty - Medium
Round duration - 20 minutes
Round difficulty - Medium
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Given an array and a target sum, find pairs of elements that add up to the target sum.
Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.
If the complement exists, add the pair to the result list. Otherwise, add the current element to the hash set.
Sort the pairs based on the first element and then the second element to meet the required output form
Round duration - 20 minutes
Round difficulty - Easy
Round duration - 40 minutes
Round difficulty - Hard
Pointers in C/C++ are variables that store memory addresses. They are used to manipulate memory directly and improve performance.
Pointers are declared using an asterisk (*) before the variable name.
Pointers can be used to dynamically allocate memory using functions like malloc() and free().
Pointers can be used to pass variables by reference to functions.
Tip 1 : Do atleast 1 project
Tip 2 : Practice Data structure programming questions
Tip 3 : Prepare concepts with examples (Coding/Numericals)
Tip 1 : Mention Projects
Tip 2 : Mention only those technologies which you are confident enough.
Tip 3 : Mention extra curricular activities if have.
I applied via Campus Placement and was interviewed before Oct 2021. There were 2 interview rounds.
Scaling refers to increasing capacity of a system. Horizontal scaling adds more machines, while vertical scaling adds more resources to a machine.
Horizontal scaling involves adding more machines to a system to increase capacity
Vertical scaling involves adding more resources to a machine to increase capacity
Use cases for horizontal scaling include handling increased traffic or adding redundancy
Use cases for vertical sca...
I applied via Job Portal and was interviewed before Nov 2022. There were 2 interview rounds.
posted on 17 Oct 2024
I applied via Walk-in
To implement a queue using a stack, use two stacks and simulate the queue operations.
Use two stacks, one for enqueue operation and one for dequeue operation.
For enqueue operation, simply push elements onto the stack used for enqueueing.
For dequeue operation, if the dequeue stack is empty, pop all elements from enqueue stack and push onto dequeue stack.
Then pop from the dequeue stack to simulate dequeue operation.
A linked list is a data structure consisting of nodes where each node points to the next node in the sequence.
Create a Node class with data and next pointer
Initialize a head pointer to null
Add nodes by updating next pointers
Traverse the list by following next pointers
I applied via Campus Placement and was interviewed in Nov 2024. There was 1 interview round.
Easy to medium leetcode questions
posted on 27 Mar 2024
I applied via Company Website and was interviewed before Mar 2023. There were 3 interview rounds.
Normal aptitude questions
Python basic and some basic coding questions
Advance level coding question
posted on 14 Sep 2021
I appeared for an interview in Jan 2021.
Round duration - 30 minutes
Round difficulty - Medium
It was in the morning around 9:00Am-9:30AM. Platform used for this round was hacerrank. Questions were of moderate to difficult level.
You are given an array of integers ARR
and an integer X
. Your task is to determine the number of subarrays of ARR
whose bitwise XOR is equal to X
.
Count the number of subarrays in an array whose XOR is equal to a given value.
Iterate through the array and keep track of XOR values and their frequencies using a hashmap.
For each element in the array, calculate the XOR value with all previous elements and check if it equals the given XOR value.
Use the concept of XOR to efficiently solve the problem.
Handle edge cases like XOR value being 0 separately.
Time complexity ca...
Given a string STR
, return all possible non-empty subsequences with distinct characters. The order of the strings returned is not important.
STR = ...
Return all possible non-empty subsequences with distinct characters from a given string.
Iterate through all possible subsequences of the input string
Check for distinct characters in each subsequence
Return the distinct character subsequences as an array of strings
Round duration - 15 minutes
Round difficulty - Easy
It was in the night around 8:00PM-8:20PM. Interviewer was very calm in questioning. Platform used for this round was Skype and the questions focused more on personality rather than total.
Tip 1 : Practice aptitude questions a lot.
Tip 2 : Do some projects
Tip 3 : Research about company thoroughly
Tip 1 : It should be in proper format.
Tip 2 : Each skills should be mentioned properly.
based on 1 interview
Interview experience
Senior Software Engineer
104
salaries
| ₹5.7 L/yr - ₹22 L/yr |
Software Engineer
64
salaries
| ₹3.6 L/yr - ₹10 L/yr |
Software Developer
39
salaries
| ₹2.8 L/yr - ₹10 L/yr |
Technical Lead
22
salaries
| ₹9.6 L/yr - ₹22 L/yr |
Senior QA Engineer
17
salaries
| ₹4.8 L/yr - ₹8.8 L/yr |
Maxgen Technologies
Value Point Systems
JoulestoWatts Business Solutions
F1 Info Solutions and Services