Housing.com
10+ GSSPEC Interview Questions and Answers
Given a string 'S' of length 'L', return the length of the longest substring without repeating characters.
Example:
Suppose given input is "abacb", then the length ...read moreGiven a Binary Tree with integer nodes, your task is to find the maximum level sum among all the levels in the Binary Tree. The sum of any level in a tree is the sum of all the nodes present at...read more
You have been given a circular array/list ‘ARR’ containing ‘N’ integers. You have to find out the maximum possible sum of a non-empty subarray of ‘ARR’.
A circular array is an array...read more
You have been given a string 'STR' of words. You need to replace all the spaces between words with “@40”.
Input Format:
The first line contains a single integer ‘T’ representing the number of test...read moreYou are given a non-empty string containing no spaces (say sentence) and a dictionary of list of non-empty strings (say the list of words). You are supposed to construct and return all possible sen...read more
Given an array/list of length ‘N’, where the array/list represents the boards and each element of the given array/list represents the length of each board. Some ‘K’ numbers of painter...read more
You have been given two integers ‘NUM1’ and ‘NUM2’ as a string. Your task is to print the sum of both the numbers.
Input Format:
The first line contains a single integer ‘T’ representing the...read moreQ8. Given an array, return true, if it can be partitioned into two subarrays whose sum of elements are same, else return false Example: Input: {5,1,5,11} Output: true (as it can be divided into {5,1,5} {11} where 5...
read moreCheck if an array can be partitioned into two subarrays with equal sum.
Iterate through the array and calculate the total sum of all elements.
If the sum is odd, return false as it cannot be divided into two equal parts.
If the sum is even, try to find a subset with sum equal to half of the total sum.
Use dynamic programming or backtracking to find the subset sum.
Q9. Add two integers which cannot be stored even in long long int?
It is not possible to add two integers that cannot be stored even in long long int.
The maximum value that can be stored in long long int is 9,223,372,036,854,775,807.
Any two integers whose sum exceeds this value cannot be stored in long long int.
In such cases, a different data type or approach is required to handle the large numbers.
Q10. input: “kitten%20pic.jpg” output: “kitten pic.jpg” %20 -> ‘ ‘ %3A -> ‘?’ %3D -> ‘:’ modify your input in place. no string library functions. void DecodeURL(string str
The function decodes a URL-encoded string by replacing specific characters with their corresponding symbols.
Iterate through each character in the input string
If the character is '%', check the next two characters to determine the replacement symbol
Replace the '%XX' sequence with the corresponding symbol
Continue until all occurrences of '%XX' are replaced
Q11. Find out the maximum contiguous circular sum in array, array may contain positive as well as negative numbers?
The maximum contiguous circular sum in an array is the maximum sum that can be obtained by wrapping the array around in a circular manner.
To find the maximum contiguous circular sum, we can use Kadane's algorithm twice.
First, we find the maximum sum using Kadane's algorithm for the non-circular array.
Then, we find the maximum sum using Kadane's algorithm for the circular array by subtracting the minimum sum subarray from the total sum of the array.
The maximum of these two sum...read more
Q12. Length of longest substring with no repeating character (Full running code)?
Find the length of the longest substring without any repeating characters.
Use a sliding window approach to iterate through the string.
Keep track of the characters seen so far using a set.
Update the maximum length of the substring whenever a repeating character is encountered.
Q13. Given a binary tree, print sum of each level ?
Given a binary tree, print sum of each level
Use a breadth-first search (BFS) algorithm to traverse the tree level by level
Keep track of the sum of each level using a separate variable for each level
Print the sum of each level after traversing the entire tree
Q14. rotated sorted array problem
Rotated sorted array problem involves finding a target element in a rotated sorted array.
Use binary search to find the pivot point where the array is rotated.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle cases where the target element is at the pivot point or not present in the array.
More about working at Housing.com
Interview Process at GSSPEC
Top Software Developer Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.
