This is my solution to the LeetCode problem – Design Search Autocomplete System.

Difficulty: hard.

Continue reading LeetCode solution – Design Search Autocomplete System

Skip to content
## LeetCode solution – Design Search Autocomplete System

## LeetCode solution – Palindrome Pairs

## LeetCode solution – Merge k Sorted Lists

## LeetCode solution – Flipping an Image

## 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

This is my solution to the LeetCode problem – Design Search Autocomplete System.

Difficulty: hard.

Continue reading LeetCode solution – Design Search Autocomplete System

This is my own solution to the LeetCode problem – Palindrome Pairs.

Difficulty: hard.

These are two similar solutions to LeetCode problem – Merge k Sorted Lists.

Difficulty: hard.

This is a simple solution to LeetCode problem – Flipping an Image.

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.