Filter interviews by
Clear (1)
Use binary search algorithm with slight modifications to handle rotated sorted array efficiently.
Find the pivot point where the array is rotated.
Determine which half of the array the target value lies in based on the pivot point.
Perform binary search on the appropriate half of the array.
I applied via Naukri.com and was interviewed in Oct 2024. There was 1 interview round.
1. two sum
2. Easy DP problem
1. Easy LL problem
2. Tree
Seeking new challenges and growth opportunities
Looking for a new challenge to further develop my skills
Interested in exploring new technologies and projects
Seeking opportunities for career advancement and growth
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.
Housing.com interview questions for designations
Get interview-ready with Top Housing.com Interview Questions
I was interviewed before Feb 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on DSA.
Given a binary tree with integer nodes, your task is to determine the maximum level sum among all the levels in the binary tree. The sum at any level is the sum of all ...
Find the maximum level sum in a binary tree with integer nodes.
Traverse the binary tree level by level and calculate the sum of nodes at each level.
Keep track of the maximum level sum encountered so far.
Return the maximum level sum as the output.
Find the maximum possible sum of a non-empty subarray from a given circular array/list ARR
containing N
integers.
The array is circular, mean...
Find the maximum sum of a non-empty subarray from a circular array.
Identify the maximum sum of a non-empty subarray within the circular array
Consider both normal and circular subarrays to find the maximum sum
Implement a function to solve the problem efficiently
Given two integers, NUM1
and NUM2
, as strings, your task is to compute and return the sum of these numbers.
The first line contains an integer T
, the number ...
Implement a function to compute the sum of two large integers given as strings.
Convert the input strings to integers and add them digit by digit from right to left, considering carry over.
Handle cases where one number is longer than the other by padding with zeros.
Return the final sum as a string.
Round duration - 60 minutes
Round difficulty - Easy
Briefly discussed about projects in resume and questions were completely related to projects mentioned. And then he asked questions based on DSA.
Given a string S
of length L
, determine the length of the longest substring that contains no repeating characters.
"abac...
Find the length of the longest substring without repeating characters in a given string.
Use a sliding window approach to keep track of the longest substring without repeating characters.
Use a hashmap to store the index of each character in the string.
Update the start index of the window when a repeating character is encountered.
Calculate the maximum length of the substring as you iterate through the string.
Return the m
Given a non-empty string sentence
containing no spaces and a dictionary of non-empty strings words
, your task is to construct and return all possible meaningful sen...
Given a string without spaces and a dictionary of words, generate all possible sentences by inserting spaces.
Use backtracking to generate all possible combinations of words from the dictionary to form sentences
Iterate through the string and try to match substrings with words from the dictionary
Recursively build sentences by adding words that match the substrings
Return all valid sentences formed
Round duration - 60 minutes
Round difficulty - Easy
Technical round where the interviewer asked me 2 DSA problems.
Given a string STR
consisting of words separated by spaces, your task is to replace all spaces between words with the characters "@40".
The first line contains an integ...
Replace spaces in a string with '@40'.
Iterate through the string and replace spaces with '@40'.
Use string manipulation functions to achieve the desired output.
Handle multiple test cases by looping through each input string.
Given an array/list representing boards, where each element denotes the length of a board, and a number ‘K’ of available painters, determine the minimum time required...
The problem involves determining the minimum time required to paint all boards with a given number of painters.
Iterate through the array to find the maximum board length.
Use binary search to find the minimum time required to paint all boards.
Optimize the painting process by assigning continuous sections of boards to painters.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
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
Check 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.
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 fr...
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
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.
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.
Top trending discussions
I was interviewed before Apr 2021.
Round duration - 45 minutes
Round difficulty - Easy
This was a test where 2 coding questions were to be solved in 45 minutes.
Given a column title as it appears in an Excel sheet, your task is to return its corresponding column number.
S = "AB"
28
The seq...
Convert Excel column title to corresponding column number.
Iterate through the characters in the input string from right to left
Calculate the value of each character based on its position and multiply by 26^index
Sum up the values to get the final column number
Determine if two given strings, str1
and str2
, are permutations of each other.
Two strings are permutations of each other if the characters of one string can be re...
Check if two strings are permutations of each other.
Create character frequency maps for both strings.
Compare the frequency maps to check if they are permutations.
Handle edge cases like empty strings or strings of different lengths.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I was interviewed before Feb 2021.
Round duration - 60 minutes
Round difficulty - Easy
It comprised of general aptitude questions and two coding questions. It was an offline test.
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not attack each other.
Generate and print valid configurations where queens are placed safely.
Consider constraints and time limit for efficient solution.
Exam...
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.
Iterate through the array and swap elements based on the values encountered.
Achieve sorting in a single scan over the array without using any extra space.
Round duration - 60 minutes
Round difficulty - Easy
After having a technical discussion about my CV. He gave me two questions to code.
Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These su...
Find all unique contiguous substrings of size two from a given string.
Iterate through the string and extract substrings of size two
Use a set to store unique substrings
Return the set as an array of strings
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.
If the two pointers meet at any point, there is a cycle in the linked list.
If one of the pointers reaches the end of the list (null), there is no cycle.
Round duration - 30 minutes
Round difficulty - Easy
This was supposed to be the HR round but out of surprise the interviewer started by giving me a question to code.
After I approached this question with the right solution he just asked about my family. After that he said to wait. After half an hour the results were announced. A total of three students were hired and I was amongst one of them.
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Some of the top questions asked at the Housing.com Software Developer interview -
based on 4 interviews
1 Interview rounds
based on 4 reviews
Rating in categories
Senior Accounts Manager
396
salaries
| ₹0 L/yr - ₹0 L/yr |
Accounts Manager
235
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Manager
76
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
62
salaries
| ₹0 L/yr - ₹0 L/yr |
Key Account Manager
46
salaries
| ₹0 L/yr - ₹0 L/yr |
MagicBricks
NoBroker
PropTiger.com
99acres