Tip 1 : Practice DSA daily
Tip 2 : Work on your projects
Tip 3 : Fundamental concepts on core subjects
Tip 1 : Mention your Skills and Projects
Tip 2 : Keep it simple and one page resume is enough
10 MCQ question on Kotlin and 2 DSA questions



V is the number of vertices present in graph G and vertices are numbered from 0 to V-1.
E is the number of edges present in graph G.
The Graph may not be connected i.e there may exist multiple components in a graph.
MCQ(10 questions), DSA(2 questions)


Input: ‘arr’ = [1, 1, 2] and ‘k’ = 2
Output: 2
Explanation: If we want to make two subarrays, there are two possibilities: [[1], [1, 2]] and [[1, 1], [2]]. We can see that the maximum sum of any subarray is minimized in the second case. Hence, the answer is 2, which is the maximum sum of any subarray in [[1, 1], [2]].



[1, 2, 3, 4] is a strictly increasing array, while [2, 1, 4, 3] is not.
They asked some DSA questions and some questions on my projects.



Two cards are said to be of different types if they have different numbers written on them.
What are your strengths and weakness?
Why do you want to join Bajaj Finserv?
What are your short term and long term goals?
Are you willing to relocate to Pune?

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