{"push_id":3183032877,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"96a5a213101fc83835266a4bbebec001d9e556de","before":"76087a377a3c9458c47bfdde942720cc59e498c1","commits":[{"sha":"96a5a213101fc83835266a4bbebec001d9e556de","author":{"name":"Chumki Roy","email":"114f08f2062aadfd3bf0f995dddfbc38546b374f@gmail.com"},"message":"Nuts and Bolts!\n\nA disorganized carpenter has a mixed pile of bolts and nuts and would like to find the corresponding pairs of bolts and nuts. Each nut matches exactly one bolt and vice versa. By trying to match a bolt and a nut the carpenter can see which one is bigger, but she cannot compare two bolts or two nuts directly. Can you help the carpenter match the nuts and bolts quickly?\n\nIn other words: You are given a collection of nuts of different size and corresponding bolts. You can choose any nut & any bolt together, from which you can determine whether the nut is larger than the bolt, smaller than the bolt or matches the bolt exactly. However, there is no way to compare two nuts together or two bolts together. (i.e. we cannot sort all nuts or sort all bolts). Write an algorithm to match each bolt to its matching nut.\n\nYou can make the following assumptions:\n\nThere are equal number of nuts and bolts\nA given nut uniquely matches a bolt. i.e. There are no extra unmatched nuts or extra bolts. i.e. every nut has one and only one matching bolt and vice-versa.","distinct":true,"url":"https://api.github.com/repos/chumkiroy/Problems/commits/96a5a213101fc83835266a4bbebec001d9e556de"}]}
{"actor":{"display_login":"chumkiroy"}}