[f]izzbuzzer

Looking for good programming challenges?

Use the search below to find our solutions for selected questions!

Archive for November 2016

Find missing duplicate in array

Problem statement Given an array that con­tains dupli­cates of all the num­bers except one num­ber. Find the missing number. Solution We could of course use a HashMap that maps each number to the number of occurrences. This will have a a space complexity of . A better solution is to . . . Read more

Dortmund Dilemma challenge

Problem statement Borussia Dortmund are a famous football ( soccer ) club from Germany. Apart from their fast-paced style of playing, the thing that makes them unique is the hard to pronounce names of their players ( błaszczykowski , papastathopoulos , großkreutz etc. ). The team’s coach is your friend. . . . Read more

Missing number in array [0…N]

Problem statement Given an array A = [1, 2, 3, 5, 6, 7 ] and number . This means that the array consists of the numbers from . However, as you see, is missing in . Print the missing number. Solution The solution proposed here makes use of the triangular . . . Read more

Find duplicate within k indices

Problem statement Given an array of values, design and code an algorithm that returns whether there are two duplicates within indices of each other? Do all, in running time and space. Solution The main idea is to always carry the last -visited elements with each iteration. public class FindDuplicateWithinN { . . . Read more

Bogosort challenge

Problem statement Logan is cleaning his apartment. In particular, he must sort his old favorite sequence, , of positive integers in nondecreasing order. He’s tired from a long day, so he invented an easy way (in his opinion) to do this job. His algorithm can be described by the following . . . Read more

Buy and sell stock once challenge

Problem statement Write a program that takes an array denoting the daily stock price, and returns the maximum profit that could be made by buying and then selling one share of stock. Solution public class BuySellStockOnce { public static int solve(int[] stockPrice) { int minimumSeenSoFar = stockPrice[0]; int[] maxProfit = . . . Read more

Cavity Map challenge

Problem statement You are given a square map of size . Each cell of the map has a value denoting its depth. We will call a cell of the map a cavity if and only if this cell is not on the border of the map and each cell adjacent . . . Read more

Keep gh-pages in sync with master

GitHub Pages is designed to host your personal, organization, or project pages directly from a GitHub repository. Add changes to your master branch echo “My Page” > index.html git add . git commit -m ‘Lorem Ipsum’ git push origin master Add changes to gh-pages git checkout gh-pages // go to . . . Read more

Misere Nim challenge

Problem statement Two people are playing game of Misère Nim. The basic rules for this game are as follows: The game starts with piles of stones indexed from to . Each pile (where ) has stones. The players move in alternating turns. During each move, the current player must remove . . . Read more

Next word

Problem statement Given a word , consisting of characters a-z, A-Z and 0-9, compute the next lexicographical word , with 0-9 < A-Z < a-z. Sample Input hLPk7 Output hLPk8 Solution import sys def nextWord(w): word = list(w) cursor = len(w) – 1 carry = True while carry and cursor . . . Read more