print out the powset of a set. use any programming language you want.
Software Engineer Interview Questions
420,052 software engineer interview questions shared by candidates
Pets +------------------+--------------+------+-----+---------+----------------+ | Field | Type | Null | Key | Default | Extra | +------------------+--------------+------+-----+---------+----------------+ | id | int(11) | NO | PRI | NULL | auto_increment | | breed | varchar(255) | NO | | NULL | | | acquisition_date | datetime | NO | | NULL | | +------------------+--------------+------+-----+---------+----------------+ Customers +-------+--------------+------+-----+---------+----------------+ | Field | Type | Null | Key | Default | Extra | +-------+--------------+------+-----+---------+----------------+ | id | int(11) | NO | PRI | NULL | auto_increment | | name | varchar(255) | NO | | NULL | | +-------+--------------+------+-----+---------+----------------+ Sales +-------------+----------+------+-----+---------+-------+ | Field | Type | Null | Key | Default | Extra | +-------------+----------+------+-----+---------+-------+ | customer_id | int(11) | NO | PRI | NULL | | | pet_id | int(11) | NO | PRI | NULL | | | date | datetime | NO | | NULL | | +-------------+----------+------+-----+---------+-------+ Q1 How many pets of each breed has the shop ever owned?
Write a function that will return the second longest string in a list of strings. You have to do a single pass on the list.
How to add a counter to www.google.com to track the billionth user.
Solve a Kakuro item - Given S - the sum, N - number of slots and P - you can use numbers between 1 - P. You should only use a number once and same numbers are considered as the same solution. Example: S=6, N=2, P=6 Answers: 1. 4,2 2. 5,1 3. 3,3
Assume you have a binary number 00110010, you apply some function on it and the number changes to some random number 10100011. Write a function to determine which numbers flipped from 0 to 1 and which bits flipped from 1 to 0. (You will have to write 2 different functions for 0 to 1 and 1 to 0).
Many sticks with length, every time combine two, the cost is the sum of two sticks' length. Finally, it will become a stick, what's the minimum cost?
they asked me to code for such a question: the input was a string and I was supposed to output the longest sub string with only 2 distinct chars in the sub string.
The dude basically asked me "what weird things have you found in using C?" Odd question...
Giving you a starting position on a chessboard. Giving you an end position. If you are only allowed to walk diagonally, how many steps do you need to take to get to the end position?
Viewing 1111 - 1120 interview questions