Bridge Hands

The bridge hands problem on programming praxis in Common Lisp.

One-swap sorting problem in common lisp.

One-swap sorting problem in common lisp.

Given an array of unique integers, determine if it is possible to sort the array by swapping two elements of the array. For instance, the array [1,2,6,4,5,3,7] can be sorted by swapping 3 and 6, but there is no way to sort the array [5,4,3,2,1] by swapping two of its elements. You may use O(n) time, where the array has n integers, and constant additional space.

Leonardo Numbers

The Leonardo Numbers problem @ Programming Praxis

My solution in Common Lisp

Let Over Lambda "This is Lisp"

But this is lisp. We're very non-functional and very proud of it.

— Doug Hoyte Let Over Lambda