{ "slug": "delphi", "language": "Delphi Pascal", "repository": "https://github.com/exercism/xdelphi", "active": false, "exercises": [ { "slug": "hello-world", "difficulty": 1, "topics": [ "Text formatting", "Optional values" ] }, { "slug": "bob", "difficulty": 1, "topics": [ "Strings", "Control-flow (if-else statements)" ] }, { "slug": "leap", "difficulty": 1, "topics": [ "Integers" ] }, { "slug": "rna-transcription", "difficulty": 1, "topics": [ "Strings", "Transforming" ] }, { "slug": "hamming", "difficulty": 2, "topics": [ "Strings", "Filtering" ] }, { "slug": "bank-account", "difficulty": 2, "topics": [ "Classes" ] }, { "slug": "nucleotide-count", "difficulty": 2, "topics": [ "Dictionaries", "Strings" ] }, { "slug": "etl", "difficulty": 2, "topics": [ "Dictionaries", "Lists", "Transforming" ] }, { "slug": "grains", "difficulty": 2, "topics": [ "Integers", "Recursion" ] }, { "slug": "beer-song", "difficulty": 3, "topics": [ "Text formatting", "Algorithms" ] }, { "slug": "phone-number", "difficulty": 3, "topics": [ "Parsing", "Transforming" ] }, { "slug": "perfect-numbers", "difficulty": 3, "topics": [ "Integers" ] }, { "slug": "binary-search", "difficulty": 3, "topics": [ "Searching", "Arrays", "Recursion" ] }, { "slug": "clock", "difficulty": 3, "topics": [ "Time", "Structural equality" ] }, { "slug": "allergies", "difficulty": 4, "topics": [ "Bitwise operations", "Filtering" ] }, { "slug": "saddle-points", "difficulty": 4, "topics": [ "Matrices", "Arrays", "Tuples" ] }, { "slug": "circular-buffer", "difficulty": 5, "topics": [ "Queues", "Classes" ] }, { "slug": "bowling", "difficulty": 6, "topics": [ "Algorithms", "Control-flow (loops)" ] }, { "slug": "book-store", "difficulty": 6 } ], "ignored": [ "bin", "img", "docs" ] }