|
Microsoft technical interview questions |
Operation
★What is the difference between a chain table and an array?
★Why do you choose this method to create a chain table?
★Select an algorithm to organize a chain table. Why do you choose this method? Now we use O (n) time.
★Let's talk about the advantages and disadvantages of various stock classification algorithms.
★Use an algorithm to reverse the order of a chain table. Do it again without recursion.
★An algorithm is used to insert a node into a circular chain table, but the node cannot traverse the chain table.
★Sort an array using an algorithm. Why do you choose this method?
★Use an algorithm to match a common string.
★Reverse a string. Optimized speed. Optimized space.
★Reversing the order of words in a sentence, for example, converting "My name is Chris" to "Chris calls me" to achieve the fastest speed and the least movement.
★Find a substring. Optimized speed. Optimized space.
★Compares two strings and uses the O (n) time and constant space.
★Suppose you have an array consisting of 1001 integers, which are arranged randomly, but you know that all integers are between 1 and 1000 (including 1000. In addition, only one digit appears twice. Suppose you can only process the array once and use an algorithm to find the number that is repeated. If you use a secondary storage method in the operation, can you find an algorithm that does not use this method?
★No multiplication or addition is required to increase by 8 times. Now we use the same method to increase the number by seven times.