How to Determine the Leap Year?
A Leap year occurs mostly every 4 years, but every 100 years, we skip a leap year, unless it is divisible by 400. Leap Year Algorithm if (year is …
Python Algorithm to Determine an Armstrong Number
The k-digit number N is an Armstrong number if and only if the k-th power of each digit sums to N. Given a positive integer N, return true if …
How to Compute the Intersection of Two Arrays using Sorting + Two Pointer Algorithm?
Given two arrays, write a function to compute their intersection. Example 1: Input: nums1 = , nums2 = Output: Example 2: Input: nums1 = , nums2 = Output: Note: …
How to Compute the N-th Tribonacci Number using Iterative Dynamic Programming Algorithm?
The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0. …
How to Find the Largest Unique Number in Array (C++)?
Given an array of integers A, return the largest integer that only occurs once. If no integer occurs once, return -1. Example 1: Input: Output: 8 Explanation: The maximum …
How to Find the K-diff Pairs in an Array with Two Pointer or Hash Map?
Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as …