Given an n x n grid, find the number of ways to get from the bottom left to the top right given that you can only move up or right each time and you cannot move to any node on the bottom diagonal half of the grid, i.e. row less than col.
Sr Software Engineer Interview Questions
67,191 sr software engineer interview questions shared by candidates
How would you manage a developer that was not closing tickets or whose output was subpar.
Give an API: int read4(char *buf) which reads 4 characters at a time from a file. The return value is the actual number of characters read. For example, it returns 3 if there is only 3 characters left in the file. By using the read4 API, implement the function int read(char *buf, int n) that reads n characters from the file.
1. Implement LinkedHashMap , how does it ensure O(1) for a get call. 2. Sort employee list , sorting can be applied on name,salary that will be decided on runtime. So we need to implement multiple comparators and pass the same to Collections.sort(list,new ComparatorName()). 3. In the above list make sure there is no duplicates, if fname and lname are same, they are duplicates.
Write a program to remove vowels from a given string
Interface , Abstract Class , SQL performance , Query optimization , Select nth record using 3 different ways
Compare 2 dates and return if they are equals ,difference between them is greater than month or less than a month. we could choose our own method arguments and return type .
Asked questions related to my job
Describe the challenges you faced? And tell about all your previous experience.
Algorithmic problem and writing code on shared document
Viewing 241 - 250 interview questions