Given a set of strings, a number 'n', and a function that takes a string and gives back a score, find the n largest scored strings in the set.
Software Engineer Interviews
Software Engineer Interview Questions
Software engineers write programs to design and develop computer software. Interviews are highly technical, so come ready to work through coding problems and math brainteasers. The specific questions you are asked will depend on what type of programming position you are looking for. Try researching a specific software discipline such as web development, application development, or system development.
Top Software Engineer Interview Questions & How to Answer
Question #1: How would you describe your programming task process?
Question #2: Which programming languages do you know and prefer?
Question 3: What is an example of a successful project that you completed?
418,794 software engineer interview questions shared by candidates
Game of Life - write a function to calculate next state of the board based on current state
Given two lists A and B containing sorted non-unique integers, return the elements in A but not B and the elements in B but not A.
Find the longest subsequence of duplicate numbers in an array of sorted numbers.
How would you improve Uber?
What is the output? int n = 1; puts(((char*)&n)[0]==1?"Y":"N");
CODING (weight: 50%) The string "PAYPAL IS HIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) P A H N A P L S I I G Y I R And then read line by line: PAHNAPLSIIGYIR Write the code that will take a string and make this conversion given a number of rows: String convert(String text, int nRows); convert("paypalishiring", 3) should return "pahnaplsiigyir"
Given a string "AABCCC" make a new string "2A1B3C"
Print a N x M matrix in diagonal from the upper left to lower right. However, with the following caveat. It's easy to just show the input and expect output. matrix: a b c d e f g h i j k output: aej bfk cg di h
Given many points, find k points that are closest to the origin.
Viewing 341 - 350 interview questions