Problem Randal Schwartz stole Lisp’s decorate-sort-undecorate idiom when he came up with what we’d later call the Schwartzian transform. All […]

# Tag: common-lisp

## Sort 3 numbers in Common Lisp with the minimum number of operations

Problem I’m wondering is the following function returns a list of three numbers sorted in ascending order with the minimum […]

## BST with node count

Problem I took a simple BST implementation which is only really a set (i.e. just element, not key value), and […]

## Pairwise grouping of elements of a list

Problem I want to group the elements in an arbitrary long list into pairs and implemented the following so far: […]

## Generating a list (or a string) with random elements

Problem During implementation and testing of different small hobby projects I often reach the point where I need (at least […]

## Generating hard to guess session tokens

Problem Does this code create sufficiently hard-to-guess session tokens, assuming the server and client are communicating over HTTPS? Take 2 […]

## Print an integer and its digits reversed

Problem This Common Lisp program is an exercise to print an integer and its digits reversed to the screen: (defun […]

## Creating a repetitive string in Common Lisp

Problem I needed to have a Lisp function that could produce a string of a certain length, created by repeated […]

## Sum of all multiples of 3 or 5 below 1000 (Project Euler #1 – typical)

Problem I’m learning LISP and am starting with Project Euler. I would love some initial feedback on my LISP code […]

## Project Euler #2 (classic) – Sum of even fibonacci numbers below 4 million

Problem I’m looking to use LISP as best I can, not just get the right answer. This is very early […]

- 1
- 2