Tip 1: Practice DSA algorithms extensively and solve as many questions as you can.
Tip 2: Prepare for the interview and try to cover all the basics from the academic subjects.
Tip 1: Keep it clean and neat; try to list your skills briefly.
Tip 2: Mention only the skills you are proficient in—don’t include anything you're not confident about.

The count of substrings will always fit in a 32-bit integer.
For 'n' = 5, 's’ = “abbac”.
Answer is 3.
These are the only 3 valid substrings { “abbac”, ”bbac”, ”bac” } satisfying all the constraints.



1. Every train will depart on the same day and the departure time will always be greater than the arrival time. For example, A train with arrival time 2240 and departure time 1930 is not possible.
2. Time will be given in 24H format and colons will be omitted for convenience. For example, 9:05AM will be given as "905", or 9:10PM will be given as "2110".
3. Also, there will be no leading zeroes in the given times. For example, 12:10AM will be given as “10” and not as “0010”.


Subsequences of string "abc" are: ""(empty string), a, b, c, ab, bc, ac, abc.

Input: ‘N’ = 3
Output:
*
***
*****
Asked to write a query to retrieve the details of employees whose current salary is greater than their previous month's salary.

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