Wed. Jul 24th, 2024

# Month: July 2020

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

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

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…

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

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…

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

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…

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

#### LeetCode – Stack – Remove Outermost Parentheses

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

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

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…

#### Welcome to Tech News at DevOpsPal

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…

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

Given an array of integers nums. A pair (i,j) is called good if nums == nums and i < j. Return the number of good pairs. Example 1: Input: nums…