{"push_id":1915495106,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"a02328ffb34a2c7e07ea2985348ae9e3598a18e5","before":"2b88a1de0cc70e6cb536a55d3bd75888e352c41e","commits":[{"sha":"a02328ffb34a2c7e07ea2985348ae9e3598a18e5","author":{"name":"Karthik Venkataraman","email":"6bac7abbbf903ba1fa2796f538476330d3015cf7@cisco.com"},"message":"LeetCode Problem: ArithmeticSlices\n\n/*-\n * LeetCode Problem: https://leetcode.com/problems/arithmetic-slices/description/\n * A sequence of number is called arithmetic if it consists of at least three elements\n * and if the difference between any two consecutive elements is the same.\n * A zero-indexed array A consisting of N numbers is given.\n * A slice of that array is any pair of integers (P, Q) such that 0 <= P < Q < N.\n * A slice (P, Q) of array A is called arithmetic if the sequence:\n * A[P], A[p + 1], ..., A[Q - 1], A[Q] is arithmetic. In particular, this means that P + 1 < Q.\n * The function should return the number of arithmetic slices in the array A.\n */","distinct":true,"url":"https://api.github.com/repos/kartven2/HackerRun/commits/a02328ffb34a2c7e07ea2985348ae9e3598a18e5"}]}
{"actor":{"display_login":"kartven2"}}