Grokking Google Coding Interview
Ask Author
Back to course home

0% completed

Vote For New Content
Solution: Arithmetic Slices
Table of Contents

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Problem Statement

Given an integer array nums, return the number of arithmetic subarrays of nums.

If any integer array consists of at least three elements and if the difference between any two consecutive elements is the same, it is called arithmetic.

A subarray is a contiguous subsequence of the array.

Examples

Example 1:

  • Input: [1, 3, 5, 7, 9, 10, 11]
  • Expected Output: 7
  • Justification: The segments that form arithmetic sequences are [1, 3, 5], [3, 5, 7], [5, 7, 9], [1, 3, 5, 7], [3, 5, 7, 9], [1, 3, 5, 7, 9], and

.....

.....

.....

Like the course? Get enrolled and start learning!

Table of Contents

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible