#### LeetCode – Arrays – Last Stone Weight

We have a collection of stones, each stone has a positive integer weight. Each turn, we choose the two heaviest stones and smash them together. Suppose the stones have weights x and y with x <= y. The result…

Skip to content
# Month: July 2020

#### LeetCode – Arrays – Last Stone Weight

#### LeetCode – Arrays – Next Greater Element I

#### LeetCode – Stack – Remove All Adjacent Duplicates In String

#### LeetCode – Stack – Build an Array With Stack Operations

#### LeetCode – Stack – Remove Outermost Parentheses

Given an array target and an integer n. In each iteration, you will read a number from list = {1,2,3..., n}. Build the target array using the following operations: You are guaranteed that the target array is…

#### LeetCode – Stack – Remove Outermost Parentheses

#### Kubernetes – Live Beginner/Elementary Master Course by Red hat Developers

#### Welcome to Tech News at DevOpsPal

#### LeetCode – Hashtable – Number of Good Pairs

#### You missed

We have a collection of stones, each stone has a positive integer weight. Each turn, we choose the two heaviest stones and smash them together. Suppose the stones have weights x and y with x <= y. The result…

You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1‘s elements in the corresponding places of nums2. The Next Greater Number of a number x in nums1 is…

Given a string S of lowercase letters, a duplicate removal consists of choosing two adjacent and equal letters, and removing them. We repeatedly make duplicate removals on S until we no longer can. Return the…

Given an array target and an integer n. In each iteration, you will read a number from list = {1,2,3..., n}. Build the target array using the following operations: You are guaranteed that the target array is…

A valid parentheses string is either empty (""), "(" + A + ")", or A + B, where A and B are valid parentheses strings, and + represents string concatenation. For example, "", "()", "(())()", and "(()(()))" are all valid parentheses strings. A valid…

DevNation events by Red Hat Developers are streaming virtual events. Sessions include real code and commands, live Q&A, and group interaction to help you get started. July 6, 2020 Master…

Hi everyone, finally we have started tech new updates here on DevOpsPal. News related to latest technologies, softwares, tools, versions, etc will be posted here on a frequent basis in…

Given an array of integers nums. A pair (i,j) is called good if nums[i] == nums[j] and i < j. Return the number of good pairs. Example 1: Input: nums = [1,2,3,1,1,3] Output: 4 Explanation: There are 4 good pairs (0,3), (0,4), (3,4), (2,5)…