Reverse a linked list in place
Software Engineer Net Developer Interview Questions
665,793 software engineer net developer 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?
Given a list of integers that fall within a known short but unknown range of values, how to find the median value?
The dude basically asked me "what weird things have you found in using C?" Odd question...
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.
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).
Find the top minimal m elements of n elements in O(n) time
Input a matrix, where every number is greater or equal to the numbers on its right and bottom. Output a sorted array
Given an english sentence how can you tell if it is valid or not. For Eg. "Iworkatuber" is a valid sentence "Iworkatasdf" is an invalid sentence.
Write a class that can take in an endless stream of numbers, one integer at a time, can efficiently store the most recent n numbers and report their average in O(1) time.
Viewing 1281 - 1290 interview questions