git-osp-for-beginners

git-osp-for-beginners copied to clipboard

riyatyag-6

Letter Combinations of a Phone Number [Java-Solution required]

9

Given a string containing digits from `2-9` inclusive, return all possible letter combinations that the number could represent. Return the answer in **any order**. A mapping of digit to letters...

aditya109

iamanshulgit

Palindrome Number [C++-Solution required]

11

Given an integer `x`, return `true` if `x` is palindrome integer. An integer is a **palindrome** when it reads the same backward as forward. For example, `121` is palindrome while...

aditya109

Design Hit Counter [Java-Solution required]

2

**Question** : Design a hit counter which counts the number of hits received in the past `5` minutes (i.e., the past `300` seconds). Your system should accept a `timestamp` parameter...

hardikkhanna

Remove Duplicates from Sorted Array [C++-Solution required]

9

Given an integer array `nums` sorted in **non-decreasing order**, remove the duplicates [**in-place**](https://en.wikipedia.org/wiki/In-place_algorithm) such that each unique element appears only **once**. The **relative order** of the elements should be kept...

aditya109

Remove Duplicates from Sorted Array [C-Solution required]

4

Given an integer array `nums` sorted in **non-decreasing order**, remove the duplicates [**in-place**](https://en.wikipedia.org/wiki/In-place_algorithm) such that each unique element appears only **once**. The **relative order** of the elements should be kept...

aditya109

Combination Sum [C-Solution required]

2

Given an array of **distinct** integers `candidates` and a target integer `target`, return *a list of all **unique combinations** of* `candidates` *where the chosen numbers sum to* `target`*.* You may...

aditya109

Container With Most Water [Golang-Solution required]

5

Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of the...

aditya109

Letter Combinations of a Phone Number [Golang-Solution required]

2

Given a string containing digits from `2-9` inclusive, return all possible letter combinations that the number could represent. Return the answer in **any order**. A mapping of digit to letters...

aditya109