Category Archives: Problem Solving

Chocolate Feast Problem

By James | June 10, 2021

Little Bobby loves chocolate. He frequently goes to his favorite 5 & 10 store, Penny Auntie, to buy them. They are having a promotion at Penny Auntie. If Bobby saves enough wrappers, he can turn them in for a free chocolate. Example n = 15 c = 3 m = 2 Answer 5 + 2… Read More »

Minimum Distances between Similar numbers in an array

By James | June 8, 2021

0 Comment

The distance between two array values is the number of indices between them. Given , find the minimum distance between any pair of equal elements in the array. If no such value exists, return -1. Example arr = [3, 2, 1, 2, 3]; Minimum Distance = 2 (Distance between 2’s)