README.md

LeetCode

Requirement

• JDK 8+

Usage

• Enter a name of the problem to solve.

  • Example :

    Enter LeetCode problem number to solve: 42
    LeetCode problem #42 Trapping Rain Water :
    Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. [https://leetcode.com/problems/trapping-rain-water]

    Enter length of input: 12
    Enter 12 integers indicating elevation of wall: 0 1 0 2 1 0 1 3 2 1 2 1
    Solution : [6]
    Execution Time : 17 ms