Skip to main content

Featured

say hello world with C++ - Solution in Hacker Rank - hackerranksolutions8

  Objective This is a simple challenge to help you practice printing to  stdout . You may also want to complete  Solve Me First  in C++ before attempting this challenge. We’re starting out by printing the most famous computing phrase of all time! In the editor below, use either  printf  or  cout  to print the string  Hello ,World!  to  stdout . The more popular command form is  cout . It has the following basic form: cout<<value_to_print<<value_to_print; Any number of values can be printed using one command as shown. The  printf  command comes from C language. It accepts an optional format specification and a list of variables. Two examples for printing a string are: printf("%s", string);   printf(string); Note that neither method adds a newline. It only prints what you tell it to. Output Format Print   Hello ,World!   to stdout. Sample Output Hello, World! Solution:- //Say Hello, ...

Lower Bound-STL in C++ – Solution in Hacker Rank - hackerranksolutions8

 

Problem

You are given N integers in sorted order. Also, you are given Q queries. In each query, you will be given an integer and you have to tell whether that integer is present in the array. If so, you have to tell at which index it is present and if it is not present, you have to tell the index at which the smallest integer that is just greater than the given number is present. Lower bound is a function that can be used with a sorted vector. Learn how to use lower bound to solve this problem by


Input Format :

The first line of the input contains the number of integers N. The next line contains N integers in sorted order. The next line contains Q, the number of queries. Then Q lines follow each containing a single integer Y.Note that if the same number is present multiple times, you have to print the first index at which it occurs. Also, the input is such that you always have an answer for each query.

Constraints :

  • 1 <= N <= 10^5
  • 1 <= Xi <= 10^9, where Xi is ith element in the array.
  • 1 <= Q <= 10^5
  • 1 <= Y <= 10^9

Output Format :

For each query you have to print “Yes” (without the quotes) if the number is present and at which index(1-based) it is present separated by a space.
If the number is not present you have to print “No” (without the quotes) followed by the index of the next smallest number just greater than that number.
You have to output each query in a new line.


Sample Input :

 8
 1 1 2 2 6 9 9 15
 4
 1
 4
 9
 15

Sample Output :

 Yes 1
 No 5
 Yes 6
 Yes 8

Solution :

//Lower Bound-STL in C++ - Hacker Rank Solution
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() 
{
   /* Enter your code here. Read input from STDIN. Print output to STDOUT */ 
   /* Lower Bound-STL in C++ - Hacker Rank Solution START */  
   int m, n, num, i, val;
   cin >>m;
   vector <int> v(m);
   for(i = 0; i < m; i++)
       cin >> v[i];
   cin>>n;
   for(i = 0; i < n; i++)
   {
       cin >> val;
       vector <int>::iterator low = lower_bound(v.begin(), v.end(), val);
       if (v[low - v.begin()] == val)
       {
           cout << "Yes " << (low - v.begin() + 1) << endl;
       }
       else
       {
           cout << "No " << (low - v.begin() + 1) << endl;
       }
   }
   /* Lower Bound-STL in C++ - Hacker Rank Solution END */
 return 0;
}

Comments