Tip 1 : Do lots of competitive programming
Tip 2 : Practice more using coding platform like LeetCode or CodeChef.
Tip 3 : Focus more on time and space complexities and explore different ways to solve problem.
Tip 1 : Put some impactful projects in your resume.
Tip 2 : Do not put false things and over skills in your resume.
Timing-60 minutes is the Duration Of Assessment
you need to give the test within 5 days of getting the test mail.
Test is conducted virtually through TCS platform. Test covers DSA, OOPS concept, DBMS, SQL, Programming and some general question related to Leadership Principles and workstyles.




1
1 1
1 2 1
1 3 3 1
Here for the third row, you will see that the second element is the summation of the above two-row elements i.e. 2=1+1, and similarly for row three 3 = 1+2 and 3 = 1+2.
Approach-
Pick last row of res-> [1]
add [0] in the starting or ending -> [0,1,0]
add 2 value from temp-> 0+1=1, 1+0=1 => [1,1]
append in row[] -> [1,1]
append row in res -> [[1],[1,1]]
return res
Solution-
res=[[1]]
for i in range(numRows-1):
temp=[0]+res[-1]+[0]
row=[]
for j in range(len(res[-1])+1):
row.append(temp[j]+temp[j+1])
res.append(row)
return res
we need to answer questions related to DBMS, SQL, programming, OOPS concept, Leadership Principles, candidate behavior questions and workstyles.
For Example-
What is relational and non relational database?
What is sql and no-sql?
What is DDL, DML and also explain its types?
Do you agree with your seniors whether that guy is correct or not.
Are you open to learn new technology or still want to work on those technologies on which you are familiar.
We need to solve 1 or 2(based on interviewer) coding question within 1 hour in which we need to explain our approach before writing the code and we need to give optimal solution of the approach.
Interviewer also ask some other question related to DBMS, SQL, OOPS concept and etc.



Input: Consider the following Binary Tree:
Output:
Following is the level-order traversal of the given Binary Tree: [1, 2, 3, 5, 6, 4]
Solution in Python:-
class Solution:
def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:
if root is None:
return []
s1=[root]
s2=[]
level=[]
res=[]
while s1 != [] or s2 !=[]:
while s1:
root=s1.pop()
level.append(root.val)
if root.left is not None:
s2.append(root.left)
if root.right is not None:
s2.append(root.right)
res.append(level)
level=[]
while s2:
root=s2.pop()
level.append(root.val)
if root.right is not None:
s1.append(root.right)
if root.left is not None:
s1.append(root.left)
if level != []:
res.append(level)
level=[]
return res
we need to answer questions related to DBMS, SQL, programming, OOPS concept, Leadership Principles, candidate behavior questions and workstyles.
For Example-
Difference between relational and non relational database?
What is foreign key in SQL queries?
What is the output of given program?
What is OPPS concept and its types?
Difference between function overloading and function overriding?
Write a query to find out second highest salary of an employee.
Do you agree with your seniors whether that guy is correct or not.
Are you open to learn new technology or still want to work on those technologies on which you are familiar.

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: