Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

Largest value of K such that both K and -K exist in Array in given index range [L, R]

Content has been removed on Author’s request.

Article Tags :
Arrays
DSA
Recommended Articles
1. Remove minimum number of elements such that no common element exist in both array
2. Check if every index i has an index j such that sum of elements in both directions are equal
3. Minimize operations to make both arrays equal by decrementing a value from either or both
4. Count of Pairs in given Array having both even or both odd or sum as K
5. Minimum index i such that all the elements from index i to given index are equal
6. Reduce Binary Array by replacing both 0s or both 1s pair with 0 and 10 or 01 pair with 1
7. Divide array into two arrays with their sum as both odd or both even
8. Generate an Array such that Average of triplet exist in given Array
9. Numbers in range [L, R] such that the count of their divisors is both even and prime
10. Count pairs in given Array having sum of index and value at that index equal
11. Sort Array such that smallest is at 0th index and next smallest it at last index and so on
12. Find Permutation of N numbers in range [1, N] such that K numbers have value same as their index
13. Length of longest subarray for each index in Array where element at that index is largest
14. Rearrange array such that even index elements are smaller and odd index elements are greater
15. Count of index range [L, R] in Array such that removing all its instances sorts the Array
16. Largest number having both positive and negative values present in the array
17. Array Index with same count of even or odd numbers on both sides
18. Count pairs (i, j) from an array such that |arr[i]| and |arr[j]| both lies between |arr[i] - arr[j]| and |arr[i] + arr[j]|
19. Check if it is possible to reach to the index with value K when start index is given
20. Queries for elements having values within the range A to B in the given index range using Segment Tree
21. Farthest index that can be reached from the Kth index of given array by given operations
22. Range Query on array whose each element is XOR of index value and previous element
23. Number of permutations such that sum of elements at odd index and even index are equal
24. Maximum length palindromic substring for every index such that it starts and ends at that index
25. Maximum range subarray for each index in Array such that A[i] = min(A[L], A[L+1], … A[R])