Tip 1 : hardworking
Tip 2 : team work
Tip 3 : do assignment
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.

Let the array be [1, 3, 6, 7] and K=3. The possible k-element subsequences of the given array are: {1, 3, 6}, {1, 3, 7}, {1, 6, 7}, {3, 6, 7}. Applying AND operation on all possible subsequences we get values: 0, 1, 0, 2 respectively. The maximal AND value of these subsequences is 2, and only 1 subsequence {3, 6, 7} has this value.
Step 1 : I first applied bubble sort. It was not good enough.
Step 2 : Interviewer asked me to optimise the solution.
Step 3 : Then i gave solution with merge sort and interviewer was happy.
Timing( was it late night)
How was the environment?
Any other significant activity
How the interviewer was? (If it was there any interview)
What are semaphores?
What is virtual memory?
Tip 1 : Read Galvin for OS thoroughly.
Tip 2 : Do practice for SQL queries.
Please specify the following : -
Timing( was it late night)
How was the environment?
Any other significant activity
How the interviewer was? (If it was there any interview
What is virtual memory?

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?