Determine if a string of parentheses is valid
Engineer Software Interview Questions
419,718 engineer software interview questions shared by candidates
About assembly implementation of spinlock?
Given a string that looks like this: Fall2014 BIO110, return 4 pieces of information: Season - Winter, Spring, Summer, Fall Year - 20XX Subject - BIO, ENGR, etc Course number The season and year cluster may be space separated. Season always comes before year. The subject and course number cluster may also be space separated. Subject always comes before course number. The season/year and subject/course clusters are always space separated. You are guaranteed that season/year cluster comes first. Season can also be given like this: W = Winter Sp = Spring Su = Summer F = Fall Years can be given without their prefix of "20". So if you're given Fall14, you should be able to extract a year of 2014. Subject and course number come as they are. You are guaranteed that subjects are purely alphabetical. Examples: Input: F 13 ENGR 110 Season: Fall Year: 2013 Subject: ENGR Course #: 110 Input: Su2015 BIO340 Season: Summer Year: 2015 Subject: BIO Course #: 340
The Max Bubble sort is O(n) at best, O(n^2) at worst, and its memory usage is O(1) . Merge sort is always O(n log n), but its memory usage is O(n). Explain which algorithm you would use to implement a function that takes an array of integers and returns the max integer in the collection, assuming that the length of the array is less than 1000. What if the array length is greater than 1000?
Given a string with open and closed parentheses, check if the string is balanced i.e. if every open bracket has a corresponding closed bracket.
Deep copy of a linked list, with an extra pointer to a random node.
Count the 1s in the number
Add two binary numbers represents in strings, those could be large values.
During the second interview, I was asked to implement LCA in a binary tree (not BST) on collabedit.com. I was close, but not close enough...
Questions asked included (only) printing the nodes of a linked list in reverse, finding the longest palindrome in a given string, finding maximum subarray sum (similar to Kadane's Algorithm) with the constraint that two numbers in the array that form the max sum cannot be next to each other.
Viewing 2461 - 2470 interview questions