Skip to content
Programmingoneonone
Programmingoneonone
  • Home
  • CS Subjects
    • IoT ? Internet of Things
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
  • HackerRank Solutions
    • HackerRank Algorithms Solutions
    • HackerRank C problems solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
Programmingoneonone

HackerEarth Nice Queries problem solution

YASH PAL, 31 July 2024
In this HackerEarth Nice Queries problem solution, You are given an array A of length N which is initialized with 0. You will be given Q queries of two types:
1 k: set value 1 at index k in array A
2 y: print the smallest index x which is greater than or equal to y and having value 1. If there is no such index print 1.
HackerEarth Nice Queries problem solution

HackerEarth Nice Queries problem solution.

#include <iostream>
#include <map>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
map<int, int> m;
map<int, int> ::iterator it;
int n,q,a,y,z;
cin>>n>>q;
while(q--)
{
cin>>y>>z;
if(y==1)
{
m[z]=1;
}
else{
it = m.lower_bound(z);

if ( it != m.end() )
{
cout << (it )->first <<"n";
}
else
cout<<"-1n";
}
}
return 0;
}
coding problems solutions

Post navigation

Previous post
Next post

Pages

  • About US
  • Contact US
  • Privacy Policy

Programing Practice

  • C Programs
  • java Programs

HackerRank Solutions

  • C
  • C++
  • Java
  • Python
  • Algorithm

Other

  • Leetcode Solutions
  • Interview Preparation

Programming Tutorials

  • DSA
  • C

CS Subjects

  • Digital Communication
  • Human Values
  • Internet Of Things
  • YouTube
  • LinkedIn
  • Facebook
  • Pinterest
  • Instagram
©2025 Programmingoneonone | WordPress Theme by SuperbThemes