Problem List
Track your progress and exploring solved problems.
Selection Sort
Sort the elements with Selection Sort Algorithm
Two Sum
Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
3 Sum
Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
Search in Rotated Sorted Array
There is an integer array nums sorted in ascending order (with distinct values).
Product of Array Except Self
Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].
Maximum Subarray
Given an integer array nums, find the subarray with the largest sum, and return its sum.
Best Time to Buy and Sell Stock
You are given an array prices where prices[i] is the price of a given stock on the ith day.