We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  • HackerRank Home
  • |
  • Prepare
  • Certify
  • Compete
  • Apply
  • Hiring developers?
  1. Prepare
  2. Interview Preparation Kit
  3. Dictionaries and Hashmaps
  4. Count Triplets

Count Triplets

Problem
Submissions
Leaderboard
Discussions
Editorial
HackerRank Logo
|
  1. Prepare
  2. Interview Preparation Kit
  3. Dictionaries and Hashmaps
  4. Count Triplets
Exit Full Screen View
  • Problem
  • Submissions
  • Leaderboard
  • Discussions
  • Editorial

You are given an array and you need to find number of tripets of indices such that the elements at those indices are in geometric progression for a given common ratio and .

Example

There are and at indices and . Return .

Function Description

Complete the countTriplets function in the editor below.

countTriplets has the following parameter(s):

  • int arr[n]: an array of integers
  • int r: the common ratio

Returns

  • int: the number of triplets

Input Format

The first line contains two space-separated integers and , the size of and the common ratio.
The next line contains space-seperated integers .

Constraints

Sample Input 0

4 2
1 2 2 4

Sample Output 0

2

Explanation 0

There are triplets in satisfying our criteria, whose indices are and

Sample Input 1

6 3
1 3 9 9 27 81

Sample Output 1

6

Explanation 1

The triplets satisfying are index , , , , and .

Sample Input 2

5 5
1 5 5 25 125

Sample Output 2

4

Explanation 2

The triplets satisfying are index , , , .

  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Helpdesk
  • Careers
  • Terms Of Service
  • Privacy Policy

Cookie support is required to access HackerRank

Seems like cookies are disabled on this browser, please enable them to open this website