Tip 1 : Prepare aptitude if you are applying for TCS
Tip 2 : Have strong knowledge of DSA
Tip 1 : Have projects in your resume
Tip 2 : Be real about your knowledge
F(n) = F(n-1) + F(n-2), Where, F(1) = 1, F(2) = 1
Step 1 : Think of brute force method
Step 2 : Further optimised in DP
Step 3 : Did more space optimisation
Step 1 : The call of recursive will return the LCS (largest common subsequence) of s.substring(i) and t.substring(j), where s.substring(i) is the suffix of s starting at index i.
If the indexes are large enough, at least one of the strings is empty. So no common subsequence exists. Return 0.
Step 2 : If s.charAt(i) == t.charAt(j), then we have found a common character. So whatever subsequ...
Step 1 : I give brute force answer which required O(n^2) time complexity.
Step 2 : I further give o(n) approach which required two variables solution.
The first line of input contains a single integer 't', representing the total number of te...
Step 1 : I took little time for doing pen paper.
Step 2 : After that my solution is ready I tell the interviewer about my code.
What is Joins?
What are Natural Joins?
Do you know SQL commands?
Write a SQL Query to obtain the employee list which have more than 4 leaves in one month?
Introduction and Projects
Able to work in night shift?
Are you aware of bond?
Why do you want to join TCS?