Hexlet SICP
  • Contents
  • Exercises
  • How to read
  • Rating
  • Book

  • Login
  • Register

  • English English
    Русский Русский
  1. Contents
  2. 2 Building Abstractions with Data
  3. 2.2 Hierarchical Data and the Closure Property
  4. 2.2.3 Sequences as Conventional Interfaces
Previous chapter Next chapter
2.2. Hierarchical Data and the Closure Property

2.2.3. Sequences as Conventional Interfaces

Exercises:

  • 2.33 . List-manipulation operations as accumulations
  • 2.34 . Horner's rule
  • 2.35 . Count-leaves as an accumulation
  • 2.36 . Accumulate-n
  • 2.37 . Matrix operations
  • 2.38 . Folds
  • 2.39 . Reverse in terms of folds
  • 2.40 . Unique pairs
  • 2.41 . Ordered triples
  • 2.42 . Eight queens puzzle
  • 2.43 . Optimization of queens

Was completed by:

  • Pavel
  • Demid Kashirin
  • Anton Burenkov
  • Dmitry Smirnov
  • Mikhail Rubashkin
  • Khakim Aidarkhanov
  • Dmitry Barskov
  • misha
  • Кирилл568
  • timon1410
  • A. D.
  • vaziliybober

There are no comments yet.

Authentication required

You must log in to post a comment.

Login

© Hexlet

  • About
  • Source code
  • Slack #hexlet-volunteers

Help

  • Knowledge
  • Blog
  • Recommended books

Other open-source projects

  • Hexlet Editor
  • Hexlet CV
  • Hexlet Friends

Additionally

  • Code Basics
  • CodeBattle
  • Hexlet Guides