Tip 1 : Practice different and quality questions from LeetCode, Interviewbit.
Tip 2 : Prepare subjects like OS, OOPS, DBMS.
Tip 1 : Keep it short and attractive.
Tip 2 : Be confident about everything you write in your resume.
This was an online technical round on the SHL platform. The link of the test was shared to us around 3 PM.
There were 4 sections and each section had limited time. You can NOT go back to the question you have already attempted.
The webCam was not on.
Section 1: Automata/ Debugging
Section 2: Coding
Section 3: Amazon Principles/Personality Based
Section 4: Aptitude/Verbal
N = 3
K = 2
A = [ 1, 2, 3 ]
Explanation :
The bitwise ‘AND’ of all subarrays of size <= 2 are :
From index 1 :
Subarray of length 1 has ‘AND’ = 1.
Subarray of length 2 has ‘AND’ = 1 & 2 = 0.
From index 2 :
Subarray of length 1 has ‘AND’ = 2.
Subarray of length 2 has ‘AND’ = 2 & 3 = 2.
From index 3 :
Subarray of length 1 has ‘AND’ = 3.
‘XOR’ of all these ‘AND’ operations = 1 ^ 0 ^ 2 ^ 2 ^ 3 = 2.
So, final result = 2.
For given N = 4, M = 4,
The connection between system node 0 and 1 is a critical connection.
Time: 9 am to 10 am
Mode of Interview: Amazon Chime Video
LiveCode: To write code, it was not a compiler.
The interviewer was very nice.
Each product can cross the integer limits, so we should take modulo of the operation.
Take MOD = 10^9 + 7 to always stay in the limits.
Can you try solving the problem in O(1) space?
Time: 3 pm to 4 pm
Mode of Interview: Amazon Chime Video
LiveCode: To write code, it was not a compiler
The interviewer was time adamant and not very supportive. A shadow interviewer was also there.
1. get(key) - Return the value of the key if the key exists in the cache, otherwise return -1.
2. put(key, value), Insert the value in the cache if the key is not already present or update the value of the given key if the key is already present. When the cache reaches its capacity, it should invalidate the least recently used item before inserting the new item.
Type 0: for get(key) operation.
Type 1: for put(key, value) operation.
1. The cache is initialized with a capacity (the maximum number of unique keys it can hold at a time).
2. Access to an item or key is defined as a get or a put operation on the key. The least recently used key is the one with the oldest access time.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL keyword removes duplicate records from a result set?