(let ((quine '((lambda (q) `(,q ',q)) '(lambda (q) `(,q ',q))))) (equal? quine (eval quine)))
Get better at programming through fun, rewarding coding exercises that test your understanding of concepts with Exercism.
Determine if a sentence is a pangram.
Create an implementation of the rotational cipher, also sometimes called the Caesar cipher.
Compute the prime factors of a given natural number.
Scheme supplies a small number of general-purpose features.
Inspired by lambda calculus, scopes and loops are expressed by defining and calling functions.
Some applications use Scheme as their extension language.
Both source code and data are expressed using nested lists.
Scheme supports exact and inexact numbers.
Scheme supports hygienic macros, allowing the syntax to be extended reliably.
Every language has its own way of doing things. Scheme is no different. Our mentors will help you learn to think like a Scheme developer and how to write idiomatic code in Scheme. Once you've solved an exercise, submit it to our volunteer team, and they'll give you hints, ideas, and feedback on how to make it feel more like what you'd normally see in Scheme - they'll help you discover the things you don't know that you don't know.Learn more about mentoring
The Scheme track on Exercism has 39 exercises to help you write better code. Discover new exercises as you progress and get engrossed in learning new concepts and improving the way you currently write.See all Scheme exercises
The best part, it’s 100% free for everyone.