Tip 1 : Study and research are the key to success in IT field.
Tip 2 : Keep practicing DSA Questions.
Tip 3 : Ask questions from your mentors.
Tip 1 : Keep it short and crisp.
Tip 2 : Mention adjectives and implementation steps.



1. A subsequence is a sequence generated from a string after deleting some characters of string without changing the order of remaining string characters.
2. 'A' and 'B' will be non-empty strings.
Sort Array in Ascending order.
Loop from 0 to nums.length - 1
Compare array a[i] and a[1+1]
If they are equal, then return true.
When finish the loop, return False.



N = 5
JUMP = [1,2,3,4,5]
ANSWER:- The answer should be YES as you can jump from 1st index to 2nd index, from 2nd index to 4th index, and from 4th index to 5th index.
A man fell into a 50-meter deep well. He climbs 4 meters up and slips 3 meters down each day. How many days will it take for him to come out of the well?
On the first day, the man climbs 4 meters up and slips 3 meters down; therefore, he only climbs a total of 1 meter up. On the second day, he again climbs 1 meter up, so the total distance climbed is 2 meters by the end of the second day. Therefore, the man climbs 1 meter every day.



1. If ‘k’ is not present in the array, then the first and the last occurrence will be -1.
2. 'arr' may contain duplicate elements.
Input: 'arr' = [0,1,1,5] , 'k' = 1
Output: 1 2
Explanation:
If 'arr' = [0, 1, 1, 5] and 'k' = 1, then the first and last occurrence of 1 will be 1(0 - indexed) and 2.
At first use binary search. When your mid value will be equal to the target, then use two different binary search on the left part and right part of the mid.



1. There are no 2 adjacent elements having same value (as mentioned in the constraints).
2. Do not print anything, just return the index of the peak element (0 - indexed).
3. 'True'/'False' will be printed depending on whether your answer is correct or not.
Input: 'arr' = [1, 8, 1, 5, 3]
Output: 3
Explanation: There are two possible answers. Both 8 and 5 are peak elements, so the correct answers are their positions, 1 and 3.
If element at point is greater that Neighbour's, then return the element.
If element at point is greater than next element, then peak can occur on the left of this element.
If element at point is lesser than next element, then peak can occur on the right of this element.
If element at point is smaller than Neighbour's, then peak can occur on the right of this element.
Tell me about yourself.
Tell me about your family.
Why are you looking for a job?
Why do you think you are fit for this role?
Tip 1 : Be confident.
Tip 2 : Be clear and concise.
Tip 3 : Take a quick look about company and its business.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?