Tip 1 : do dsa regular, atleast 300-400 qwuestions
Tip 2 : makes projects
Tip 1 : one page resume
Tip 2 : attach links of code



Subsequences of string "abc" are: ""(empty string), a, b, c, ab, bc, ac, abc.
Step 1: I first applied brute force. It was given the TLE.
Step 2: I used DP to solve this.



The same letter cell should not be used more than once.
For a given word “design” and the given 2D board
[[q’, ‘v’, ‘m’, ‘h’],
[‘d’, ‘e’, ‘s’, ‘i’],
[‘d’, ‘g’, ‘f’, ‘g’],
[‘e’, ‘c’, ‘p’, ‘n’]]
The word design can be formed by sequentially adjacent cells as shown by the highlighted color in the 2nd row and last column.

I simply tried backtracking and this question get solved.



a) Duplicate elements may be present.
b) If no such element is present return -1.
Input: Given a sequence of five numbers 2, 4, 5, 6, 8.
Output: 6
Explanation:
In the given sequence of numbers, number 8 is the largest element, followed by number 6 which is the second-largest element. Hence we return number 6 which is the second-largest element in the sequence.
Step1: I used brute force that was O(n^n) time complexity.
Step 2: I used two variables to solve the problem.



Input:
'a' = 8, 'b' = 5
Output:
5 8
Explanation:
Initially, the value of 'a' and 'b' is 8 and 5, respectively.
After swapping, the value of 'a' is 5, and the value of 'b' is 8.
I simply give the below solution:
x = x + y
y= x - y
x =x - y
PRINT x, y
What is Joins?
Natural Joins
Do you know SQL commands?
Discussion on my projects.
Features of OOPS.
My Introduction
Projects
Location Preference
able to work in night shift?
Are you aware of bond?
Why do you want to join TCS?

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
To make an AI less repetitive in a long paragraph, you should increase: