Ben Pereira articles - 53 total
LeetCode — 3264. Final Array State After K Multiplication Operations I
It’s an easy problem with the description being: You are given an integer array nums, an integer k,...
LeetCode — 2373. Largest Local Values in a Matrix
This is an easy problem with the description being: You are given an n x n integer matrix...
LeetCode — 2824. Count Pairs Whose Sum is Less than Target
It’s an easy problem with the description being: Given a 0-indexed integer array nums of length n...
LeetCode — 2798. Number of Employees Who Met the Target
It’s an easy problem with description being: There are n employees in a company, numbered from 0 to...
LeetCode — 3467. Transform Array by Parity
This is an easy problem with the description being: You are given an integer array nums. Transform...
LeetCode — 2161. Partition Array According to Given Pivot
This is a medium problem with the description being: You are given a 0-indexed integer array nums...
Singleton
At first glance, on the software world, singleton its’ a design pattern that means one unique...
LeetCode — 2807. Insert Greatest Common Divisors in Linked List
It’s a medium problem with the description being: Given the head of a linked list head, in which...
Leetcode — 1486. XOR Operation in an Array
It’s an easy problem with description being: You are given an integer n and an integer...
Leetcode — 3146. Permutation Difference between Two Strings
It’s an easy problem with description being: You are given two strings s and t such that every...
Leetcode — 2942. Find Words Containing Character
It’s an easy problem with description being: You are given a 0-indexed array of strings words and a...
Leetcode — 3280. Convert Date to Binary
It’s an easy problem with description being: You are given a string date representing a Gregorian...
Leetcode — 3289. The Two Sneaky Numbers of Digitville
It’s an easy problem with description being: In the town of Digitville, there was a list of numbers...
Leetcode — 3190. Find Minimum Operations to Make All Elements Divisible by Three
This is an easy problem with description being: You are given an integer array nums. In one...
Leetcode — 2769. Find the Maximum Achievable Number
This is an easy problem with description being: Given two integers, num and t. A number is...
Leetcode — Top Interview 150–125. Valid Palindrome
It’s an easy problem with description being: A phrase is a palindrome if, after converting all...
Leetcode — Top Interview 150–121. Best Time to Buy and Sell Stock
It’s an easy problem with the description being: You are given an array prices where prices[i] is...
Introduction to jOOQ
jooq.org states that jOOQ generates Java code from your database and lets you build type safe SQL...
Leetcode — Top Interview 150–169. Majority Element
It’s an easy problem with the description being: Given an array nums of size n, return the majority...
Leetcode — Top Interview 150 — Remove Element
It’s an easy problem that consists in: Given an integer array nums and an integer val, remove all...
Leetcode — 3110. Score of a String
It’s an easy problem from leet code with the description being: You are given a string s. The score...
Leet Code 75–746. Min Cost Climbing Stairs
It’s an easy problem from leet code 75 with the description being: You are given an integer array...
SQL 50–1068. Product Sales Analysis I
It’s an Leet Code easy problem from SQL 50 with the description being: Table:...
SQL 50–1378. Replace Employee ID With The Unique Identifier
It’s an easy problem from SQL 50 with the description being: Table:...
SQL 50–1683. Invalid Tweets
It’s an easy problem from SQL 50 with the description being: Table:...
SQL 50–1148. Article Views I
It’s an easy problem from SQL 50 with the description being: Table:...
SQL 50–595. Big Countries
It’s an easy problem with description being: Table: World +-------------+---------+ | Column Name...
SQL 50–584. Find Customer Referee
It’s an easy problem part of the SQL 50 interview plan that states: Table:...
Leet Code 75–933. Number of Recent Calls
This is an easy problem from Leet Code 75 with the description being: You have a RecentCounter...
Leet Code 75–2215. Find the Difference of Two Arrays
It’s an easy problem with the description being: Given two 0-indexed integer arrays nums1 and...