Leetcode problem 136 - Final Prices With a Special Discount in a Shop
You are given an integer array prices where prices[i] is the price of the ith item in a shop.
Jonghan's learning path
Today I Learned as a developer
Recent posts
Leetcode problem 135 - N-ary Tree Postorder Traversal
Given the root of an n-ary tree, return the postorder traversal of its nodes’ values.
Leetcode problem 134 - Increasing Order Search Tree
Given the root of a binary search tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has ...
Leetcode problem 134 - Maximum Nesting Depth of the Parentheses
A string is a valid parentheses string (denoted VPS) if it meets one of the following:
Leetcode problem 133 - Minimum Number of Arrows to Burst Balloons
A valid parentheses string is either empty “”, “(“ + A + “)”, or A + B, where A and B are valid parentheses strings, and + represents string concatenation.