{"push_id":1458648181,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"46a0ffa1074d1e6b57f48cc8a63eb7fb8fc9a2a1","before":"c1c06f41bca0cf33dfc71fdd7c4e8b5c89906ffe","commits":[{"sha":"46a0ffa1074d1e6b57f48cc8a63eb7fb8fc9a2a1","author":{"name":"Karthik Venkataraman","email":"6bac7abbbf903ba1fa2796f538476330d3015cf7@cisco.com"},"message":"LeetCode Problem: Range Sum Query Mutable\n\n * LeetCode: https://leetcode.com/problems/range-sum-query-mutable/\n * Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.\n * The update(i, val) function modifies nums by updating the element at index i to val.","distinct":true,"url":"https://api.github.com/repos/kartven2/HackerRun/commits/46a0ffa1074d1e6b57f48cc8a63eb7fb8fc9a2a1"}]}
{"actor":{"display_login":"kartven2"}}