← All problemsSign in

Naresh Solves the Challenge

Naresh heard about the NPL announcement and practicing very hard to win it.While practicing, he faced a problem which he couldn't solve.So, he challenged you to solve the problem .The problem is as follow. You are given an array A of integers of size N and an integer K.you have to find number of i,j pairs following the given rules. - i=1 constraints - 15 - 15 - 1input format First line consi

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start