Tip 1: Practice at least 300+ DSA problems.
Tip 2: Build a strong foundation in core subjects.
Tip 3: Complete at least 3-4 projects.
Tip 1: Don't exaggerate or include false information on your resume.
Tip 2: Include at least 3-4 projects.
Timing: 11:00 A.M.
The environment was great because the interviewer was very friendly and humble.



You have a given 1 int array. You need to separate this array into 2 subarrays s1 and s2. After that do a summation of both subarrays so the summation of s1 is sum1 and summation of s2 is sum2. So you need to select 2 subarrays in a manner so that the mod of sum1 and sum2 is minimum.
Step 1: First, take the summation of the entire array.
Step 2: Now, divide the summation by 2 and use it as the target value.
Step 3: Find a subarray whose sum is closest to that target.
Step 4: I used dynamic programming (DP) to solve this problem.

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: