CT22512

Farhan Counts the charms

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

In the gull cliffs of Screech Point, Farhan the registry keeper keeps careful count of the charms. chart the migration season, every figure matters. 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| <= 1784; s contains lowercase English letters.

Example 1:

Input: bbbbbiiiijjjjsppppppbbbbsssvvvaaaaiiiiittttaaaaaasssssffuuuuuddddppjjlllooobbbbyyyyyaaaaadduuummmmmmvviiiioooppppppkqqqqqqwwwwwwzlllleeeerrrrqdddzzzlxxxoggooooosnnnnrrrrrrnnnnnnffggggggxmmmzzzzzsssssbbbbbbxxxxxxggggggppppppllllllffffmmgggnnmuuffllllliiiiaaaaooooozzzzzztttzyyyyykkkkkkjjjjjjjggggwmmmxxxxkkkkpoooohhhhhhxxxxxeeeeezzzziiiiilllxxxkkknnnnniiggbbbbbbllllttjjjtttbbeedccssssssiiiiiaaaaarrrrrrkkkyyyyyaaaaaaseuuuuuukkkvvvvvvggggooppppppqgttttttrrrzzzzzvvvvvvssssssxxzzzzzzjjjjjjsssssmmmmlllddppppppssssssgggggpnnnrrrrrrdddaaaabbbbeegggggbbbaaaywwccllhhddmmmwwwwwwezzzzvvvccccyggggccccmmmmmmfffffeeeekkkkhhhhzzzwwwwwwvrddddddaeeeeeqccccccaaiiiiiqqqqqccccmmmiiiiiissssssbbhhhhhhcccwwmmxxxggggiixxxxhhhhlllldddddssssesssnnnnnnccccuuuuutttttqqqqvvvvrrrreeiiiimmmmmkkkoooonppppphttttwfooooootpppppwwwwwwdddhrrrrrrrriiivvbbbbbttiiiiwwwwwkkkksoookuuuutttnnnnnmmmmyyyyyyyyyypphhhhjjjqqqhhhhdddddmooooxxxxxxlllllppnnnnnnbcnnnnnssssseeemmmmmmbbbkkkkwwwwwwnnnqqqqqqqqqqqqfllllrrzzzznnnnlllllmmmqqqqqqooffffrrrrrrrrrrrlllliinnnnnnnnjjjjjiiiiibxxxqqqssiinnneeeeeuuuuuuqqqcccccccccttttqqppppppqqjjooooonnnnnsssswwwnuuuyyyyyybdddddnnnnncccccccccnpppnnnnnnccccccyyyyyzzzzzzohhhhhccccttttttpppwhhhhhnnnttbbbbboooooojjjjlllyyyxxxxeeeeeeyyyyycccccnnnnnxxxxxnnaaaaakkkkkkcbbbbboootooogwwwwwtttddryuuugggssssssssvvvvvmppppptttttaaeeeeqccccyyooooxxxxcczzzffffffqqqrrrrdddddgggqqrdddddllllloooollllllyyywcnnnnnnfiiejjjjjmmmmmmvvrrrrmmmmmcccccesssssjjjjxxxxxxvvvbbbbgggqbbbbbbxpttyyyyyuuussssobcyyyyyyhhhhhhffffcxxxxxxttttttmm
Output: b5i4j4s1p6b4s3v3a4i5t4a6s5f2u5d4p2j2l3o3b4y5a5d2u3m6v2i4o3p6k1q6w6z1l4e4r4q1d3z3l1x3o1g2o5s1n4r6n6f2g6x1m3z5s5b6x6g6p6l6f4m2g3n2m1u2f2l5i4a4o5z6t3z1y5k6j7g4w1m3x4k4p1o4h6x5e5z4i5l3x3k3n5i2g2b6l4t2j3t3b2e2d1c2s6i5a5r6k3y5a6s1e1u6k3v6g4o2p6q1g1t6r3z5v6s6x2z6j6s5m4l3d2p6s6g5p1n3r6d3a4b4e2g5b3a3y1w2c2l2h2d2m3w6e1z4v3c4y1g4c4m6f5e4k4h4z3w6v1r1d6a1e5q1c6a2i5q5c4m3i6s6b2h6c3w2m2x3g4i2x4h4l4d5s4e1s3n6c4u5t5q4v4r4e2i4m5k3o4n1p5h1t4w1f1o6t1p5w6d3h1r8i3v2b5t2i4w5k4s1o3k1u4t3n5m4y10p2h4j3q3h4d5m1o4x6l5p2n6b1c1n5s5e3m6b3k4w6n3q12f1l4r2z4n4l5m3q6o2f4r11l4i2n8j5i5b1x3q3s2i2n3e5u6q3c9t4q2p6q2j2o5n5s4w3n1u3y6b1d5n5c9n1p3n6c6y5z6o1h5c4t6p3w1h5n3t2b5o6j4l3y3x4e6y5c5n5x5n2a5k6c1b5o3t1o3g1w5t3d2r1y1u3g3s8v5m1p5t5a2e4q1c4y2o4x4c2z3f6q3r4d5g3q2r1d5l5o4l6y3w1c1n6f1i2e1j5m6v2r4m5c5e1s5j4x6v3b4g3q1b6x1p1t2y5u3s4o1b1c1y6h6f4c1x6t6m2

Example 2:

Input: ccccssssssqqqrrrrrrrrssssiiirrrrddddddwqooossszzoooooooaaccccbiiiiiimvvvvjjjjfffffnnnnxxxxxxxxxxyyyymaaaaaehwwwweeeeeeuuuuuzzzzzzzzvvvbbbbbbttagvvvvvhhhhhhvvuuudmmmvvvvvvuvvvvvvvvvvrrrrfffffggggeevvvvtttoooosr
Output: c4s6q3r8s4i3r4d6w1q1o3s3z2o7a2c4b1i6m1v4j4f5n4x10y4m1a5e1h1w4e6u5z8v3b6t2a1g1v5h6v2u3d1m3v6u1v10r4f5g4e2v4t3o4s1r1

Example 3:

Input: nnnnbbbbbmmmmmmddffffyyyyooooiiiioooooiiiiixxiiiiiiilllllnaaaaahhhhhxxxxxxxxxxtttzmmffffzzzzziccccccaaddddddrrrrrrffffflllljmhhhhhvvbbssssuunnnddkkkkkcccccccjjkkkkeeeekkkkhhhhhheeeeuuuurrrrbbfffffiiiicccccuuuummmmmmllllllqqaaaeewwwccccnnnnnnddddpppsssssteecclrryqqqqdssllllxrrrrrrqqqqqxxxxpsssssnxkkvvvvvvxxxiiiiiuuuuuffrrrrrobblllldddddrrkkkkyyyyffffffffnnndddqqqqqqwwwwwiipppsssqqqqjjjjjjjjjjtttoooooggggggyyyyyyyqqqqqqqqqqqqnmmmmmmmmmmuuuuumeeeuuuuqqqqissssssaqqqqqppppppkzzzssaaaattttxyyyyyynnnbuuuuhhhiiiimmiiiiwwwhhrrrrrreeeeeeeeeeeccccttttthhaaaaaajjnnnnnpppppffffffeeezzzzzssggggiiiiikkkkzzzzzziiiiiiniiiiipuuuuwwwttttttwwcccccrvvvccuuuuuuwbbbbbnnnnnwwmmtddiiiiqqqqrrrrrrzzzfffffquuuuuoooqqqqqaaapppppvvmsssssnnnnnxxxxzzzzzvvvvvvxxxxyyyyllttkkkrrrruuuuuuuurrrrruuwwwiaattttqqqqqaaaaawwkyyyyyysssuujnnnnnnqqqqhhhhhhtttttyyyyzccxxxxyyyyyvvjjjjjfffmmmmnnnnnnkllllllxxxxxxxxzzzzzeeeeeqnrrrngggggnnnnllllljjjggvvvvziiiuuuaaaaakkkkooqqqqqqjjjjjjaaaaaxxxxxxhhhmmmmmmooooommmmjoooooonnrrrrrrccczzzzmmaaacccyyyyyydnnnnxxxoooooorrrrjjjjjjoooovvvvvvrrrrrwwwwiiiiiccccqqassssiilptttfffffrrrraaaaaapppppxxxkkkkkkoooaaocccchhhhrrrrjjjjjxxxxxxoommmmqqqmmmmmccssccckkkkkknvvppppqqqqyyyyyvvvvnnnnnttkkkkktttttbbbbbjjjjuuuuuuyyffxxxxxfffffppppppkkkkkjjjjwwwwvvvvjjjaaahhhhhqqqqquuuutttttuuuuvvvvvjjjjjbbbjjjjjjo
Output: n4b5m6d2f4y4o4i4o5i5x2i7l5n1a5h5x10t3z1m2f4z5i1c6a2d6r6f5l4j1m1h5v2b2s4u2n3d2k5c7j2k4e4k4h6e4u4r4b2f5i4c5u4m6l6q2a3e2w3c4n6d4p3s5t1e2c2l1r2y1q4d1s2l4x1r6q5x4p1s5n1x1k2v6x3i5u5f2r5o1b2l4d5r2k4y4f8n3d3q6w5i2p3s3q4j10t3o5g6y7q12n1m10u5m1e3u4q4i1s6a1q5p6k1z3s2a4t4x1y6n3b1u4h3i4m2i4w3h2r6e11c4t5h2a6j2n5p5f6e3z5s2g4i5k4z6i6n1i5p1u4w3t6w2c5r1v3c2u6w1b5n5w2m2t1d2i4q4r6z3f5q1u5o3q5a3p5v2m1s5n5x4z5v6x4y4l2t2k3r4u8r5u2w3i1a2t4q5a5w2k1y6s3u2j1n6q4h6t5y4z1c2x4y5v2j5f3m4n6k1l6x8z5e5q1n1r3n1g5n4l5j3g2v4z1i3u3a5k4o2q6j6a5x6h3m6o5m4j1o6n2r6c3z4m2a3c3y6d1n4x3o6r4j6o4v6r5w4i5c4q2a1s4i2l1p1t3f5r4a6p5x3k6o3a2o1c4h4r4j5x6o2m4q3m5c2s2c3k6n1v2p4q4y5v4n5t2k5t5b5j4u6y2f2x5f5p6k5j4w4v4j3a3h5q5u4t5u4v5j5b3j6o1

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Farhan Counts the charms - EASY Coding Problem | CodeTikki