Tip 1 : Be Strong with DSA
Tip 2 : Be Strong with OOPS and Core CS Fundamentals
Tip 1 : One Page Resume
Tip 2 : Highlight your coding profiles
Online Test
4O MCQs
OS, (8 Questions)
DBMS, (8 Questions)
Networks, (8 Questions)
OOPS, (8 Questions)
Problem Solving, (8 Questions)
DSA problem solving



1. The given string will only contain 0 and 1.
An efficient solution is to use hashing.
1) Traverse string and keep track of counts of 1s and 0s as count_1 and count_0 respectively.
2) See if current difference between two counts has appeared before (We use hashing to store all differences and first index where a difference appears). If yes, then substring from previous appearance and current index has same number of 0s and 1s.



Let the array 'arr' be: [1, 0, 1].
Let ‘k’ be: 1
Then the subarrays having the number of ones equal to ‘k’ will be: [1], [1,0], [0,1], [1].

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?