1 like 0 dislike
42,210 views

retagged | 42,210 views

1 like 0 dislike

Author of this sheet : https://www.linkedin.com/in/kumark1/

Set A :

(Most Fundamental and Most Important)

Solution :

(Focus more on Hashng based solutions mentioned . Set and Map are mainly ued for Hashing.)

(Very Important)

P5 : Will be updated.

(Very Important)

Set B :

P2 : (Minimal length subarray of sum K)

https://stackoverflow.com/questions/64418218/smallest-subarray-with-sum-equal-to-k

Try to think of a hashing solution for this problem , assume that numbers in the array can be negative integers as well..

P3 :

https://www.interviewbit.com/problems/subarray-with-given-xor/

P12 : https://leetcode.com/problems/two-sum/description/ (https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/ Requires two pointers!)

P13 : https://leetcode.com/problems/3sum/description/ (https://leetcode.com/problems/3sum-closest/)

P14 : https://leetcode.com/problems/4sum/description/

### If you have solved set A && set B , you are now pretty much prepared from an interview point of view , you can try set C to raise the bar :) :)

Set C :

p1 :

A nice PDF containing most important problems for Hashing : https://drive.google.com/file/d/1SVAHLw6pGg1wfcxflP8P-YmuT9FC-uWM/view?usp=sharing

by Expert (109,130 points)
selected