Java development example - HenryXi.com

Climbing Stairs

Problem Description

Maximum Subarray

Problem Description

Longest Common Prefix

Problem Description

Longest Palindromic Substring

Problem Description

Hive case when example

Let's say you have table like following. You want to query the nums of each level.

Roman to Integer

Problem Description

Palindrome Number

Problem Description

Reverse Integer

Problem Description

Hive group by get last record

Let's say you have a table like following.

Hive not in example

We can use left join in Hive to implements in or not in operation. Now we have two tables A and B like following.

Implement Stack using Queues

Problem Description

Valid Parentheses

Problem Description

First Missing Positive

Problem Description

Combination Sum II

Problem Description

Combination Sum

Problem Description

Previous
3
4
5
6
7
8
9
Next