Tip 1: Be extremely thorough with your resume
Tip 2: Consistency is key, Practice at least 5 questions daily in programming
Tip 3: Before the interview, know about the company and try to include your knowledge about the company in your discussion with the panel
Tip 1: Be thorough with DP, because most DP questions are asked
Tip 2: Be strong in OOPS and real-life examples of it
It happend in the morning from 10:30-12:00, it was conducted in hackerrank platform.



[1, 2, 3, 4] is a strictly increasing array, while [2, 1, 4, 3] is not.
1. Create an array `dp` of the same length as the input array, initialized with 1s.
2. Iterate over the input array from left to right, considering each element `nums[i]`.
3. For each element `nums[i]`, iterate over all the previous elements `nums[j]` (where `j` ranges from 0 to `i-1`).
4. If `nums[j]` is smaller than `nums[i]`, update `dp[i]` as the maximum value between `dp[i]` and `dp[j] + 1`. This means that if we can extend the LIS ending at `nums[j]` with `nums[i]`, we can form a longer LIS ending at `nums[i]`.
5. Finally, the maximum value in the `dp` array is the length of the longest increasing subsequence.



Create a DP vector of size n+1 and value -1 and variables pick and not pick.
Create a recursive function
If n < 0 possible stolen value is 0.
If n = 0 possible stolen value is hval[0].
If DP[n] != -1 possible stolen value is DP[n].
Set pick as pick = hval[n] + maxLoot(hval, n-2, DP)
Set not pick as notPick = maxLoot(hval, n-1, DP).
Set Dp[n] = max(pick, notPick) and return DP[n].



You are given ‘mat’ = [[1, 2, 2,], [3, 3, 4], [5, 6 ,7]]] and ‘K’ = 5, the elements of the matrix are [1, 2, 2, 3, 3, 4, 5, 6, 7], the 5th smallest element in the matrix is 3. Hence the answer is 3.
Follow the given steps to solve the problem:
Sort the input array in the increasing order
Return the element at the K-1 index (0 – Based indexing) in the sorted array
The round lasted for up to 1 hour duration.
Explain Joins
Difference between primary key and secondary key



Let the array be [1, 2, 3, 4, 4, 5]. In the given array ‘4’ occurs twice and the number ‘6’ is missing.
Traverse all elements and put them in a hash table. Element is used as the key and the count of occurrences is used as the value in the hash table.
Traverse the array again and print the element with count 1 in the hash table.
Build a movie booking ticketing system
what are OOPS concepts? explain 4 pillars of oops

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?