You have a n number of cities. Lets say city 1 has some information that needs to be sent to all other n-1 cities using minimal cost. Cost between each pair of cities is given. any number of cities can transmit the information once they receive the information but the overall total cost should be minimum
Given two files that has list of words (one per line), write a program to show the intersection.
If i give you a team of software engineers will you be able to make a market product of your final year project, If yes then explain what be the theme on which you will base your product?
Reverse words in a sentence (a char[]) without using additional space. eg. "Hello there children" -> "children there Hello"
Three of my 150 friends have phone numbers ending in a permutation of the digits 0, 1, 4, and 9. Is this surprising?
Determine if a string is valid based on placement of parenthesis. i.e. "123(13(44))" is valid but ")234(12)(" is not.
Given an array of strings with commit ids, and a predicate isBuggy that returns if a single commit is buggy, write a program that finds the first buggy commit. - When a commit is buggy, we assume that all its children are buggy. - When a commit is not buggy, we assume that all its ancestors are not buggy. After solving it, I had to describe its time complexity and spatial complexity and how would I choose the test cases.
How do you swap 2 variable without using temporaries. (My version is given 2 register and 1 ALU, how do you swap the value of the 2 register without using external register or temporaries)
If you have a 600 digit number with only 0's and 1's, and exactly 300 1's, can the number be a square?
There is a body of water that starts with 1 square unit, and doubles in size every day (2 units after 2 days, 4 units after 4 days). It takes 100 days to fill up. How many days would it take to fill if you started with 2 square units?
Viewing 621 - 630 interview questions