Sharooq

Two Sum Explained: From Brute Force to an Optimal Hash Map Solution

The Two Sum problem is one of the most popular coding interview questions. Although it looks simple, it introduces several important concepts that appear repeatedly in algorithm design, such as brute force search, sorting with two pointers, and hash maps.

Leetcode -

Two Pointers

Solution: Leetcode 27 Removing Elements from an Integer Array in Python

Given an integer array nums and an integer val, the task is to remove all occurrences of val in nums in-place. Additionally, we need to return the number of elements in nums that are not equal to val.

Leetcode -

Two Pointers

Solution: Leetcode 26 Removing Duplicates from Sorted Array in Python

The problem at hand is to remove duplicates from a sorted integer array nums in-place, such that each unique element appears only once. Additionally, we need to return the number of unique elements present in the modified array.

Leetcode -

Two Pointers

Solution: LeetCode 88 Merge Sorted Array

You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Merge nums1 and nums2 into a single array sorted in non-decreasing order.

Subscribe to Sharooq

Subscribe to Sharooq