this post was submitted on 23 Aug 2023
12 points (100.0% liked)

Programming Challenges

233 readers
1 users here now

Welcome to the programming.dev challenge community!

Three challenges will be posted every week to complete

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
12
[Easy] String Compression (self.challenges)
submitted 1 year ago* (last edited 1 year ago) by Ategon to c/challenges
 

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:

all 22 comments
sorted by: hot top controversial new old
[–] SleveMcDichael 4 points 1 year ago (1 children)
[–] Ategon 1 points 1 year ago
  • 8/8 test cases passed
  • Time: 0.005s
  • Characters: 530
[–] [email protected] 4 points 1 year ago* (last edited 1 year ago) (2 children)

C: gcc -O2 easy.c

In case formatting is messed up

#include 
#include 

void bail(char const *msg)
{
	fputs(msg, stderr);
	exit(EXIT_FAILURE);
}

int main(int argc, char **argv)
{
	int count = 0;
	char *p, c = 0;

	if (argc != 2) {
		bail("Improper invocation.\n");
	}

	for (c = *(p = argv[1]); *p; p++) {
		if (c == *p) {
			count++;
		} else {
			printf("%c%d", c, count);
			c = *p;
			count = 1;
		}
	}

	if (count) {
		printf("%c%d", c, count);
	}

	putchar('\n');

	return 0;
}
[–] Ategon 1 points 1 year ago
  • 8/8 test cases passed
  • Time taken: 0.003s
  • Characters: 487
[–] sizeoftheuniverse 1 points 1 year ago

A true C hax0r puts everything in one line, and doesn't peform any sanity checks!

#include 

int main(int argc, char **argv)
{
	int count = 1, t;
	char *p, c = 0;
	for (char c = *(p = argv[1]); *p; p++, t=(c==*p), ((!t) ? printf("%c%d",c,count):0), count = t ? (count+1) : 1, c=t?c:*p);
	return 0;
}
[–] graphicsguy 2 points 1 year ago

My broken brain just goes "but how would a decompressor know if '3101' was originally '30' or 101 '3's in a row?"

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

Bun, technically prints it to the console: throw[...Bun.argv[2].matchAll(/(.)+?(?!\1)/g)].map(([a,c])=>c+a.length).join("")

Breaks if there are more than 9 repeats or if you don't supply an argument.

[–] Ategon 2 points 1 year ago* (last edited 1 year ago)
  • 8/8 test cases passed
  • no runtime stats since I couldnt use the solution checker to check it (had to do manually)
  • Characters: 84
[–] gifti 2 points 1 year ago* (last edited 1 year ago)

Factor:

(command-line) last [ ] group-by [ length 48 + swap ] assoc-map "" concat-as print

[–] nieceandtows 2 points 1 year ago (1 children)

Python:

import sys

input_string = sys.argv[1]

compressed_string = ''
last_letter = ''
letter_count = 0

for letter in input_string:
    if letter != last_letter:
        if last_letter != '':
            compressed_string += last_letter + str(letter_count)
            letter_count = 0
        last_letter = letter
    letter_count += 1
compressed_string += last_letter + str(letter_count)

print(compressed_string)

[–] Ategon 1 points 1 year ago* (last edited 1 year ago)
  • 8/8 test cases passed
  • time taken: 0.011s
  • characters: 385
[–] [email protected] 2 points 1 year ago* (last edited 1 year ago) (1 children)

JavaScript (~~Deno~~Bun): bun easy.js aaabbhhhh33aaa

Golf attempt using RegExp to match homogenous substrings.

Original version

console.log(Deno.args[0].replace(/(.)\1*/g,a=>a[0]+(a.length+'')))

Slightly optimised by removing the frivolous conversion to string. I also made a somewhat silly opitmisation of using Bun.argv instead of Deno.args to save a character.

console.log(Bun.argv[2].replace(/(.)\1*/g,a=>a[0]+a.length))
[–] Ategon 1 points 1 year ago
  • 8/8 test cases passed
  • Time taken: 0.01s
  • Characters: 60
[–] 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

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

My solution (runs in O(n) time, but so do all the other solutions so far as far as I can tell):

from itertools import pairwise

def main(s: str) -> str:
    characters = [None] + list(s) + [None]
    transitions = []
    for (_, left), (right_idx, right) in pairwise(enumerate(characters)):
        if left != right:
            transitions.append((right_idx, right))
    repeats = [(stop - start, char) for (start, char), (stop, _) in pairwise(transitions)]
    return ''.join(f'{char}{length}' for length, char in repeats)

if __name__ == '__main__':
    from argparse import ArgumentParser
    parser = ArgumentParser()
    parser.add_argument('s')
    print(main(parser.parse_args().s))

Runthrough:
'aaabb' -> [None, 'a', 'a', 'a', 'b', 'b', None] -> [(1, 'a'), (4, 'b'), (6, None)] -> [(4 - 1, 'a'), (6 - 4, 'b')]

Golfed (just for fun, not a submission):

import sys
from itertools import pairwise as p
print(''.join(c+str(b-a)for(a,c),(b,_)in p([(i,r)for i,(l,r)in enumerate(p([None,*sys.argv[1],None]))if l!=r])))

[–] Ategon 2 points 1 year ago* (last edited 1 year ago)
  • 8/8 test cases passed
  • time taken: 0.191s
  • characters: 566
[–] Quasari 2 points 1 year ago* (last edited 1 year ago)

Ruby, just because I wanted a bit more practice. Again, I went to lowering character count, so it is ugly. I'm just using a anchor-runner pointer strategy to do the work. I tried to think of a regex to do the work for me, but couldn't think of one that would work.

i=ARGV[0]
o=''
a=r=0
l=i.length
while l>a
  r+=1
  if r>l||i[a]!=i[r] then
    o+=i[a]+(r-a).to_s
    a=r
  end
end
puts o