Given a matrix of n x n dimensions, write an algorithm such that each number (from 1 to n) appears only once in a column and a row. (Look up magic square for an example)
Manager In Interview Questions
17,837 manager in interview questions shared by candidates
Implement LRU Cache
Given a Stack with n elements, write a method that always keeps the max of the stack?
Given a singly linked list, swap the kth node and the kth node from the end. Don't check for size.
Draw the system architecture of one of your projects
Basic Java Related questions
Do you have any questions for me?
Create an algorithm for sorting a peculiar arrays. If your fundamentals are strong (from K&R) and also from interview questions you will find on the net, and if you do at least a 100 of them, you should be able to hold your ground.
How to handle Exceptions in selenium?
Just what they want for the company. Don’t even care about the experience
Viewing 1911 - 1920 interview questions