Write a function/method with this signature: bool MyFunc(string term, string input) {} The method should return true if the search term is found in the input string, even when there are other characters in between. Examples: "aba", "bbbbabbxxxxxxbb" returns false "aba", "bbbbabbxxxxxxab" returns true Basically, do I see an 'a', then 'b', then another 'a' before I run off the end of the input string?
Practice questions on Trees, Linked Lists, Arrays.
Debugging questions will be of 7 questions for 21 minutes. Ex: An array will be sorted in descending you need to change the code to sort it in ascending.
Logic questions/debugging in the first section. A work simulation in the 2nd part with a coding challenge.
Tell me about a time when you disagreed with the work direction you were given, and how you resolved it.
(onsite questions) Tell me about the code you wrote? Walk me through how it works. Is there anyway you think you can optimize it?
Questions included in my description
Write an algorithm that does an in-order traversal of a tree recursively. Now, write the same algorithm iteratively.
Code a function in C to get the largest consecutive addition of integer numbers fron an array.
Searching a page in 100 million pages. What data structure would be optimal?
Viewing 401 - 410 interview questions