How to resolve the algorithm Substring step by step in the Quackery programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Substring step by step in the Quackery programming language

Table of Contents

Problem Statement

Display a substring:

If the program uses UTF-8 or UTF-16,   it must work on any valid Unicode code point, whether in the   Basic Multilingual Plane   or above it. The program must reference logical characters (code points),   not 8-bit code units for UTF-8 or 16-bit code units for UTF-16. Programs for other encodings (such as 8-bit ASCII, or EUC-JP) are not required to handle all Unicode characters.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Substring step by step in the Quackery programming language

Source code in the quackery programming language

  [ $ "abcdefgh" ] is s  ( --> $ )
  [ 2 ]            is n  ( --> n )
  [ 3 ]            is m  ( --> n )
  [ char d ]       is ch ( --> c )
  [ $ "cd" ]       is ss ( --> $ )

  s n split nip m split drop echo$ cr
  s n split nip echo$ cr
  s -1 split drop echo$ cr
  ch s tuck find split nip m split drop echo$ cr
  ss s tuck find$ split nip m split drop echo$ cr

  

You may also check:How to resolve the algorithm FizzBuzz step by step in the XPL0 programming language
You may also check:How to resolve the algorithm Population count step by step in the APL programming language
You may also check:How to resolve the algorithm Bitmap step by step in the PureBasic programming language
You may also check:How to resolve the algorithm Langton's ant step by step in the J programming language
You may also check:How to resolve the algorithm Unprimeable numbers step by step in the Arturo programming language