Write a function in language of your choice that takes in two strings, and returns true if they match. Constraints are as follows: String 1, the text to match to, will be alphabets and digits. String 2, the pattern, will be alphabets, digits, '.' and '*'. '.' means either alphabet or digit will be considered as a "match". "*" means the previous character is repeat 0 or more # of times. For example: Text: Facebook Pattern: F.cebo*k returns true
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,713 software engineer interview questions shared by candidates
Given a m*n grid starting from (1, 1). At any point (x, y), you has two choices for the next move: 1) move to (x+y, y); 2) move to (x, y+x); From point (1, 1), how to move to (m, n) in least moves? (or there's no such a path)
Write a recursive function to determine prime number
How to remove a node from a singly-linked list when only given the pointer to the node
Find max k elements among mostly sorted list.
Was asked how I would implement division without using division or mod operators. The answer should return in the form quotient r remainder.
Given 2 numbers x and y, check if x is an integer power of y. For instance, x = 8, y = 2 would return true and x = 10 and y = 2 would return false since the first one is an integer power but the second isn't.
How to reverse a number, e.g. 1234.
Print a singly-linked list backwards, in constant space and linear time.
Mark likes to listen to music while travelling. His iPod™ contains N songs and he wants to listen to L (not necessarily different) songs during a trip. So he creates a playlist such that: • Every song is played at least once. • A song can be played again only if at least K other songs have been played Mark wants to know how many different playlists are possible. Can you help Mark determine this number? As the number can be very large, display number modulo 1,000,000,007. You are given N, K and L.
Viewing 211 - 220 interview questions