This is a solution to the LeetCode problem – Letter Combinations of a Phone Number.

Difficulty: medium.

Continue reading LeetCode solution – Letter Combinations of a Phone Number

Skip to content
## LeetCode solution – Letter Combinations of a Phone Number

## LeetCode solution – First Unique Character in a String

## LeetCode solution – Min Stack

## LeetCode solution – Reverse Vowels of a String

## LeetCode solution – Binary Search

## Binary Search

## Java String split

## LeetCode solution – Plus One

## LeetCode solution – Island Perimeter

## LeetCode solution – Find Anagram Mappings

This is a solution to the LeetCode problem – Letter Combinations of a Phone Number.

Difficulty: medium.

Continue reading LeetCode solution – Letter Combinations of a Phone Number

The one-pass solution for LeetCode problem – First Unique Character in a String.

Continue reading LeetCode solution – First Unique Character in a String

This is my solution to the LeetCode problem – Min Stack. The implementation is based on LinkedList.

Implementation for the LeetCode problem – Reverse Vowels of a String.

Continue reading LeetCode solution – Reverse Vowels of a String

A simple iterative solution for LeetCode problem – Binary Search.

Iterative implementation of “binary search” in java.

One of the most common operations with String is splitting or tokenizing.

Difficulty: easy

Difficulty: easy

This is my solution to the LeetCode problem – Find Anagram Mappings.