CT24688

Sable's Ember Ledger

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Deep in the quays of Driftwood, Sable studies rows of charms entries. One clean number will settle the guild's oldest argument. Task: Compress s using run-length encoding: replace each maximal run of equal characters c repeated k times by c followed by k. Input format: One line with a single lowercase string s. Output format: Print the encoded string. Constraints: 1 <= |s| <= 1074; s contains lowercase English letters.

Example 1:

Input: uuuuuukkkkkuuukkkmmgggggqwzzlliiiiiixxxxxxxrrrrrgggggkkkkxxooooowwwwwwrrrrrrrhhhuuuooooooffddllllllcccciiiieerrrrkdddddllllllrnnnwwwiiiiiikkkkkkeeaaaalllhhhhaaaaoooovvlllwwwwjjjjjjppooggggggwwweeaagggaaaahhheommmmmggggffoooooooooommmmccccccxaaiuuuqqqqqqcccccmmmmmmuuuffjjjjjjjjjjjtttteeeeooooojmmmmxkkkkkkttvvvmmmibbbbggggggylllgggccccoohgggssstttttxxxxppppppiiiiiixxxrrrrriiiiiijaaxyyyyyuuuooorrtnnneeeeexxxxxfmmmmmsssyy
Output: u6k5u3k3m2g5q1w1z2l2i6x7r5g5k4x2o5w6r7h3u3o6f2d2l6c4i4e2r4k1d5l6r1n3w3i6k6e2a4l3h4a4o4v2l3w4j6p2o2g6w3e2a2g3a4h3e1o1m5g4f2o10m4c6x1a2i1u3q6c5m6u3f2j11t4e4o5j1m4x1k6t2v3m3i1b4g6y1l3g3c4o2h1g3s3t5x4p6i6x3r5i6j1a2x1y5u3o3r2t1n3e5x5f1m5s3y2

Example 2:

Input: dddddssssssjjjjcccccczggggggwwwweeeellnnnffccccccoooogghhpppppaaaaaccccvvvttthhhttttttfqqqccccccqqqjjrrrrrvvvooommmmxxxxxxsssssooojjggggggsskkkkkddddkpghbbbkzzzzyyyyyajxxaaaacccffffffqiiixxxxxxvvvvvxxxxxvvvvvvvvceelllllvvvvvvpppppprrriiiiyxfxzzzzxxxxxooooorrrrrrssbbbbbnnnnkkmmmmmmqqccccccbbbbbbmmbbbbbbnnpppppaaaaeeeeuutttmmqqqaaaaawwwwwwvvcccnnnnnnccccmmmccddddddteerrrrriccccccffbbbbbziiiijaaaaaazzpppkkkkkrrrrviiiiipppqviiiuuxmmmmmmeeeeeelllllllllljjjjjkkkccuuujjjjjsssssshhhhhahhhaaajjjjjjiiiiiijjjhhhssllvvvjjttssqfjjjjjjoottttmmmkkkkkuuttttttyyoozzzkkkffffffhhqqqqyjjwwwwwwuuueeeekkkfeemrrrrrjjjjoooooxxxxxxxxxxxxggzzzzztttttkkkkk
Output: d5s6j4c6z1g6w4e4l2n3f2c6o4g2h2p5a5c4v3t3h3t6f1q3c6q3j2r5v3o3m4x6s5o3j2g6s2k5d4k1p1g1h1b3k1z4y5a1j1x2a4c3f6q1i3x6v5x5v8c1e2l5v6p6r3i4y1x1f1x1z4x5o5r6s2b5n4k2m6q2c6b6m2b6n2p5a4e4u2t3m2q3a5w6v2c3n6c4m3c2d6t1e2r5i1c6f2b5z1i4j1a6z2p3k5r4v1i5p3q1v1i3u2x1m6e6l10j5k3c2u3j5s6h5a1h3a3j6i6j3h3s2l2v3j2t2s2q1f1j6o2t4m3k5u2t6y2o2z3k3f6h2q4y1j2w6u3e4k3f1e2m1r5j4o5x12g2z5t5k5

Example 3:

Input: ggggoooooppphhhhzzwwppppttlkkkkkoootttttmmmmjjjjjjxxukkmmyyyyyycccyyyeeehhhhhhkkkknnnmmmmmssssrrrtttthhhhiiddddde
Output: g4o5p3h4z2w2p4t2l1k5o3t5m4j6x2u1k2m2y6c3y3e3h6k4n3m5s4r3t4h4i2d5e1

Constraints:

1 <= |s| <= 1074; s contains lowercase English letters.

Loading...
Test Cases:No test cases
No test cases available.
Sable's Ember Ledger - EASY Coding Problem | CodeTikki