Microsoft Two Pointers Questions

31 two pointers problems asked at Microsoft interviews

Easy (13)Medium (16)Hard (2)

Questions

Title	Difficulty	Acceptance	Frequency
Merge Sorted Array	Easy	54.4%	83.7%
Longest Palindromic Substring	Medium	37.4%	75.8%
Trapping Rain Water	Hard	66.8%	75.7%
3Sum	Medium	38.6%	72.9%
Container With Most Water	Medium	59.6%	67.7%
Sort Colors	Medium	69.2%	65.8%
Remove Duplicates from Sorted Array	Easy	62.3%	64.5%
Move Zeroes	Easy	63.6%	59.7%
Next Permutation	Medium	44.8%	59.0%
Remove Element	Easy	61.4%	58.1%
Rotate Array	Medium	44.5%	55.8%
Find the Index of the First Occurrence in a String	Easy	46.3%	54.6%
Reverse Words in a String	Medium	55.6%	52.4%
4Sum	Medium	40.0%	52.2%
Happy Number	Easy	59.3%	51.9%
Merge Strings Alternately	Easy	82.1%	51.9%
Intersection of Two Linked Lists	Easy	63.2%	50.3%
Remove Nth Node From End of List	Medium	51.0%	49.5%
Intersection of Two Arrays	Easy	77.5%	47.2%
Palindrome Linked List	Easy	57.5%	47.2%
Meeting Rooms II	Medium	52.6%	44.1%
Assign Cookies	Easy	54.7%	41.2%
Remove Duplicates from Sorted Array II	Medium	64.3%	37.7%
Rotate List	Medium	41.2%	36.2%
Find Median from Data Stream	Hard	54.2%	36.0%
Remove Duplicates from Sorted List II	Medium	51.3%	34.7%
Is Subsequence	Easy	48.9%	32.8%
3Sum Closest	Medium	48.1%	31.1%
Linked List Cycle	Easy	53.9%	30.3%
Partition List	Medium	60.6%	24.1%
Two Sum II - Input Array Is Sorted	Medium	64.6%	22.6%

Showing 31 questions