Skip to content

Instantly share code, notes, and snippets.

View frag-o-matic's full-sized avatar

Frag O'Matic frag-o-matic

  • Bangalore, India
View GitHub Profile
frag-o-matic / string_compress.cpp
Created March 30, 2018 07:09
Week 1 Kata : String Compression
Problem for week 1: String Compression
Implement a method to perform string compression using counts of repeated characters. String "aabccdaaaaa" becomes "a2b1c2d1a5". The function needs to check for errors and raise an error in case -
1. resultant compressed string is larger
2. invalid character is found.
The only valid characters fall into [a-zA-Z] range.
frag-o-matic /
Last active June 29, 2017 18:29
D&H Ground Rules

Ground Rules for the D&H Slack

  • Please be respectful towards others and use your common sense
  • No Shitposting/Memes/Trolling outside of designated channels
  • If a conversation is going Off-topic (OT), please take it to #general or another appropriate channel. Other participants may request you to do so too. Feel free to respectfully request others to move OT conversations to an appropriate channel
  • Please refrain from political discussions (regional, national, international affairs and the like) on any channel! We're a tech slack, let's stick to it. Please create a private channel or ask to join an existing private channel for these discussions

Public Channels and Topics

Currently, there are 52 channels with dedicated topics. A small sampling:

Keybase proof

I hereby claim:

  • I am frag-o-matic on github.
  • I am frag_o_matic ( on keybase.
  • I have a public key ASBw2LP8Uk2YXVSMsf29T-YwNyInKBJy3t2Q1B7MUrBZYQo

To claim this, I am signing this object: