Networking, hardware, OS, Linux etc
Resident Services Coordinator Interview Questions
3,357 resident services coordinator interview questions shared by candidates
Given a 2 dimensional grid (represented as a 2D array) that had an area filled in with a certain color, find the perimeter, or border length, of that area. So if the area was a 2 by 2 square, the border length would be 8. Constraint: Ignore other colors filled in the grid and only count consider the elements around a starting point. Ignore outliers
Find the maximum number of distinct contiguous subarrays of the given array which contain atmost 'k' odd numbers
Study up on your algorithms and data structures. Make sure you're comfortable with using common data structures and algorithms to solve more specific problems, but also be prepared to answer questions with no connection to any previously learned tricks. You should be able to come up with time complexities as easily as breathing. For everything you write, you have to be able to explain your thinking. In some cases, you will be asked to verbally articulate a complete solution before writing any code at all. In general, what they seem to be looking for is observable proof of your problem solving ability in real time. You don't need a freakishly high IQ or vast knowledge base of CS information to succeed, though I imagine that would help. To prepare, sites like leetcode seem to work fine, but in my opinion they put way to much emphasis on test cases and actually running code to be used for interview preparation. I often found that I would work a problem until I'd thought of the solution, then abandon it after a few minutes of trying to debug some edge case that wasn't working. This kind of behavior is obviously inappropriate on the job, but it helped me focus on the conceptual problem solving skills needed for the interviews.
Under NDA. In general: questions on string parsing and use of recursion and dynamic programming.
Design Question, given an Iterator of Iterators. Design next and has next functions so that next function returns the next element from the next iterator and has next returns whether or not the next iterator has any elements.
I was asked to solve questions roughly leetcode-medium in difficultly.
I cannot say what the specific question is, but in general, brush up on your algorithms class.
Lots of questions regarding all areas, I talked alot about networking and therefore got alot of networking related questions but also basic IT questions. A real range
What brands do you like?
Viewing 2741 - 2750 interview questions