**Intro to Tutorial Challenges**

### Problem Statement :

About Tutorial Challenges Many of the challenges on HackerRank are difficult and assume that you already know the relevant algorithms. These tutorial challenges are different. They break down algorithmic concepts into smaller challenges so that you can learn the algorithm by solving them. They are intended for those who already know some programming, however. You could be a student majoring in computer science, a self-taught programmer, or an experienced developer who wants an active algorithms review. Here's a great place to learn by doing! The first series of challenges covers sorting. They are listed below: Tutorial Challenges - Sorting Insertion Sort challenges Insertion Sort 1 - Inserting Insertion Sort 2 - Sorting Correctness and loop invariant Running Time of Algorithms Quicksort challenges Quicksort 1 - Partition Quicksort 2 - Sorting Quicksort In-place (advanced) Running time of Quicksort Counting sort challenges Counting Sort 1 - Counting Counting Sort 2 - Simple sort Counting Sort 3 - Preparing Full Counting Sort (advanced) There will also be some challenges where you'll get to apply what you've learned using the completed algorithms. About the Challenges Each challenge will describe a scenario and you will code a solution. As you progress through the challenges, you will learn some important concepts in algorithms. In each challenge, you will receive input on STDIN and you will need to print the correct output to STDOUT. There may be time limits that will force you to make your code efficient. If you receive a "Terminated due to time out" message when you submit your solution, you'll need to reconsider your method. If you want to test your code locally, each test case can be downloaded, inputs and expected results, using hackos. You earn hackos as you solve challenges, and you can spend them on these tests. For many challenges, helper methods (like an array) will be provided for you to process the input into a useful format. You can use these methods to get started with your program, or you can write your own input methods if you want. Your code just needs to print the right output to each test case. Sample Challenge This is a simple challenge to get things started. Given a sorted array () and a number (), can you print the index location of in the array? Example Return for a zero-based index array. If you are going to use the provided code for I/O, this next section is for you. Function Description Complete the introTutorial function in the editor below. It must return an integer representing the zero-based index of . introTutorial has the following parameter(s): int arr[n]: a sorted array of integers int V: an integer to search for Returns int: the index of in The next section describes the input format. You can often skip it, if you are using included methods or code stubs. Input Format The first line contains an integer, , a value to search for. The next line contains an integer, , the size of . The last line contains space-separated integers, each a value of where . The next section describes the constraints and ranges of the input. You should check this section to know the range of the input.

### Solution :

` ````
Solution in C :
In C++ :
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int V, N;
cin >> V >> N;
int temp = 0;;
for(int i = 0; i < N; i++){
cin >> temp;
if(temp == V){
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
}
In Java :
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int v = in.nextInt();
int n = in.nextInt();
int[] ar = new int[n];
for(int i=0;i<n;i++){
ar[i]=in.nextInt();
}
int i=0;
while (ar[i]<v){
i++;
}
System.out.println(i);
}
}
In C :
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main() {
int n,size,i,dub,ans;
scanf("%d",&n);
scanf("%d",&size);
for(i=0;i<size;i++)
{scanf("%d",&dub);
if(dub==n)
ans=i;}
printf("%d",ans);
return 0;
}
In Python3 :
val = int(input())
size = int(input())
arr = [int(i) for i in input().split()]
x = 0
for j in arr:
if val == j:
break
x = x+1
print(x)
```

## View More Similar Problems

## Median Updates

The median M of numbers is defined as the middle number after sorting them in order if M is odd. Or it is the average of the middle two numbers if M is even. You start with an empty number list. Then, you can add numbers to the list, or remove existing numbers from it. After each add or remove operation, output the median. Input: The first line is an integer, N , that indicates the number o

View Solution →## Maximum Element

You have an empty sequence, and you will be given N queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the stack. 3 -Print the maximum element in the stack. Input Format The first line of input contains an integer, N . The next N lines each contain an above mentioned query. (It is guaranteed that each

View Solution →## Balanced Brackets

A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and (). A matching pair of brackets is not balanced if the set of bra

View Solution →## Equal Stacks

ou have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of

View Solution →## Game of Two Stacks

Alexa has two stacks of non-negative integers, stack A = [a0, a1, . . . , an-1 ] and stack B = [b0, b1, . . . , b m-1] where index 0 denotes the top of the stack. Alexa challenges Nick to play the following game: In each move, Nick can remove one integer from the top of either stack A or stack B. Nick keeps a running sum of the integers he removes from the two stacks. Nick is disqualified f

View Solution →## Largest Rectangle

Skyline Real Estate Developers is planning to demolish a number of old, unoccupied buildings and construct a shopping mall in their place. Your task is to find the largest solid area in which the mall can be constructed. There are a number of buildings in a certain two-dimensional landscape. Each building has a height, given by . If you join adjacent buildings, they will form a solid rectangle

View Solution →