Greedy Algorithm to Validate Stack Sequences
Given two sequences pushed and popped with distinct values, return true if and only if this could have been the result of a sequence of push and pop operations …
Depth First Search Algorithm with Hash Set to Find Elements in a Contaminated Binary Tree
Given a binary tree with the following rules: root.val == 0 If treeNode.val == x and treeNode.left != null, then treeNode.left.val == 2 * x + 1 If treeNode.val …
Algorithms to Count How Many Numbers Are Smaller Than the Current Number
Given the array nums, for each nums find out how many numbers in the array are smaller than it. That is, for each nums you have to count the …
Finding the Closest Divisors
Given an integer num, find the closest two integers in absolute difference whose product equals num + 1 or num + 2. Return the two integers in any order. …
Greedy Solution to Reconstruct a 2-Row Binary Matrix
Given the following details of a matrix with n columns and 2 rows : The matrix is a binary matrix, which means each element in the matrix can be …
How to Use jOOQ Library to Write SQL in Java using Fluent Style?
The jOOQ (https://www.jooq.org/) is a rich Java Library that allows us to write SQL using fluent style. It generates type-safe SQL and avoids SQL injections rather than building your …