the interviewer ask me how to optimize the strstr() brute force method, and I said we can use KMP algorithm to do it, then he move on, and don't ask me to implement it.
Software Engineer Interview Questions
467,443 software engineer interview questions shared by candidates
Questions - Print all paths in a binary tree - Function to find the square root of a number - Pretty print JSON object - How would you design home feed? - Simple regex matcher
1. Binary Tree level order traversal 2. Given a string and a pattern '.' Matches any single character. '*' Matches zero or more of the preceding element.), find the first substring matching this pattern.
given sorted circularly linked list how would you insert an element in it?
How does ping work?
Determine if a string of parentheses is valid
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.
Viewing 2431 - 2440 interview questions
See Interview Questions for Similar Jobs
Principal EngineerFirmware EngineerMobile EngineerOperations Engineer.net DeveloperMobile DeveloperGame ProgrammerDevops EngineerQa EngineerTechnical Program ManagerJr Security AnalystSenior DeveloperData EngineerC DeveloperLead EngineerPython DeveloperAtg DeveloperApplication DeveloperSoftware Developer