{"push_id":2298268956,"size":3,"distinct_size":3,"ref":"refs/heads/master","head":"e3bcde40d0349167f702a1bd505415787b589d60","before":"4f30dab02f4c9e5bd91084dee1c902b7cdf4fb9c","commits":[{"sha":"1cf56c483461a6517f6255aa2d0ec2f106a0919c","author":{"name":"Sean McGieson","email":"c61f1f59de266ea4ebcb94c85e2ede3708f9bc66@gmail.com"},"message":"Changed Algogithim and kept complexity\n\nNow is storing letters in order they appear in 2D array.  O(1) additional space as the array size is known and is a simple hash table.","distinct":true,"url":"https://api.github.com/repos/oseanstream/InterviewQuestionsReview/commits/1cf56c483461a6517f6255aa2d0ec2f106a0919c"},{"sha":"a6ac12f32d7d07b8609dfaf2af1bc1c0333af8ee","author":{"name":"Sean McGieson","email":"c61f1f59de266ea4ebcb94c85e2ede3708f9bc66@gmail.com"},"message":"Final Version\n\nFixed Algorithm for a more specific check on return value.  Specifically The first character in the 2d array should not be '0' whereas the 2nd should be.","distinct":true,"url":"https://api.github.com/repos/oseanstream/InterviewQuestionsReview/commits/a6ac12f32d7d07b8609dfaf2af1bc1c0333af8ee"},{"sha":"e3bcde40d0349167f702a1bd505415787b589d60","author":{"name":"Sean McGieson","email":"c61f1f59de266ea4ebcb94c85e2ede3708f9bc66@gmail.com"},"message":"Final Commit\n\nThis time for saved.","distinct":true,"url":"https://api.github.com/repos/oseanstream/InterviewQuestionsReview/commits/e3bcde40d0349167f702a1bd505415787b589d60"}]}
{"actor":{"display_login":"oseanstream"}}