Human-made Content Premium, Human-generated Content
Find Nth Fibonacci Number

Find Nth Fibonacci Number

Bruce Ediger

Daily Coding Problem: Problem #1790 [Easy]

Implement the function fib(n), which returns the nth number in the Fibonacci sequence, using only O(1) space.

Dead Lies Dreaming

Dead Lies Dreaming

Bruce Ediger

Dead Lies Dreaming, © 2020 by Charles Stross, ISBN 978-1-250-26702-1, A Tordotcom Book. Published by Tom Doherty Associates.

Divided Palindromes Daily Coding Problem

Divided Palindromes Daily Coding Problem

Bruce Ediger

Problem Statement

Given a list of words, find all pairs of unique indices such that the concatenation of the two words is a palindrome.

For example, given the list [“code”, “edoc”, “da”, “d”], return [(0, 1), (1, 0), (2, 3)].