Programming Challenges

234 readers

1 users here now

Welcome to the programming.dev challenge community!

Three challenges will be posted every week to complete

Tuesday (Easy)
Thursday (Medium)
Saturday (Hard)

Easy challenges will give 1 point, medium will give 2, and hard will give 3. If you have the fastest time or use the least amount of characters you will get a bonus point (in ties everyone gets the bonus point)

Exact duplicate solutions are not allowed and will not give you any points. Submissions on a challenge will be open for a week.

A leaderboard will be posted every month showing the top people for that month

founded 1 year ago

MODERATORS

Ategon

[Easy] String Compression (self.challenges)

submitted 1 year ago* (last edited 1 year ago) by Ategon to c/challenges

20 comments fedilink hide all child comments

Given a string, compress substrings of repeated characters in to a format similar to aaa -> a3

For example for the string aaabbhhhh33aaa the expected output would be a3b2h432a3

You must accept the input as a command line argument (entered when your app is ran) and print out the result

(It will be called like node main.js aaaaa or however else to run apps in your language)

You can use the solution tester in this post to test you followed the correct format https://programming.dev/post/1805174

Any programming language may be used. 1 point will be given if you pass all the test cases with 1 bonus point going to whoevers performs the quickest and 1 for whoever can get the least amount of characters

To submit put the code and the language you used below

People who have completed the challenge:

@[email protected] - N/A - 84 chars (javascript)
@[email protected] - 0.011s - 385 chars (python)
@[email protected]
- 0.003s - 487 chars (c) (fastest)
- 0.01s - 60 chars (javascript) (shortest)
@[email protected] - 0.005s - 530 chars (rust)
@[email protected] - 0.191s - 566 chars (python)
@[email protected] - 0.053s - 359 chars (factor) If you submitted in factor, ruby, cobol, etc. itll take me a bit longer to check since I havent set up running those yet. Should be soon

you are viewing a single comment's thread
view the rest of the comments

[–] Andy 2 points 1 year ago* (last edited 1 year ago) (1 children)

Factor:

USING: kernel strings command-line namespaces math.parser sequences io ;
IN: l

: c ( s -- C )
  "" swap
  [ dup empty? not ] [
    dup dup dup first '[ _ = not ] find drop
    dup not [ drop length ] [ nip ] if
    2dup tail
    [ number>string [ first 1string ] dip append append ] dip
  ] while drop
;

MAIN: [ command-line get first c print ]

Benchmark using compiled binary:

$ hyperfine "./compress/compress aaabbhhhh33aaa"

Benchmark 1: ./compress/compress aaabbhhhh33aaa
  Time (mean ± σ):       3.6 ms ±   0.4 ms    [User: 1.4 ms, System: 2.2 ms]
  Range (min … max):     3.0 ms …   6.0 ms    575 runs

[–] Ategon 1 points 1 year ago* (last edited 1 year ago) (1 children)

8/8 test cases passed
Time taken: 0.163 seconds
Characters: 359

I ran it using factor.com -run (path to file)

If theres a better way let me know, first time using factor

[–] Andy 1 points 1 year ago (1 children)

Thanks! Yeah to use the optimized compiler to create a faster runnable binary, I've put instructions on the first challenge: https://programming.dev/comment/1980496

[–] Ategon 2 points 1 year ago* (last edited 1 year ago)

new time taken: 0.053 seconds