got beer?

https://www.hackerrank.com/challenges/cpp-maps/problem #include #include #include #include #include #include #include using namespace std; int main() { int q = 0, t = 0, mark = 0; string name; map m; // Gives the iterator to the element name if it is found otherwise returns m.end() map::iterator itr; cin >> q; for (int i = 0; i > t; switch (t) { case 1: cin >> name >> mark; itr ..

https://www.hackerrank.com/challenges/cpp-sets/problem #include #include #include #include #include #include using namespace std; int main() { set s; set::iterator itr; int num, q, val; cin >> num; for (int i = 0; i > q >> val; if (q == 1) s.insert(val); else if (q == 2) s.erase(val); else { itr = s.find(val); if (itr == s.end()) cout

https://www.hackerrank.com/challenges/cpp-lower-bound/problem #include #include #include #include #include using namespace std; int main() { int n, q, y, temp; cin >> n; vector arr; for (int i = 0; i > temp; arr.push_back(temp); } //sort(arr.begin(), arr.end()); cin >> q; vector::iterator low; vector::iterator iter; iter = arr.begin(); for (int i = 0; i > y; low..

https://www.hackerrank.com/challenges/variable-sized-arrays/problem #include #include #include #include #include using namespace std; int main() { int n, q, i, j, len; cin >> n >> q; vector arr(n); for (int a = 0; a > len; arr[a].resize(len); // resize the container so that it contains n elements for (int b = 0; b > arr[a][b]; } } for (int c = 0; c < q; c++) {..

https://www.hackerrank.com/challenges/vector-erase/problem #include #include #include #include #include using namespace std; int main() { int n, x, temp, a, b; vector N; cin >> n; for (int i = 0; i > temp; N.push_back(temp); } cin >> x >> a >> b; vector::iterator iter = N.begin(); iter -= 1; N.erase(iter + x); N.erase(iter + a, iter + b); cout

https://www.hackerrank.com/challenges/c-tutorial-class/problem #include #include using namespace std; class Student { private: int age, standard; string first_name, last_name; public: int get_age() { return age; } string get_first_name() { return first_name; } string get_last_name() { return last_name; } int get_standard() { return standard; } void set_age(int a) { age = a; } void set_standard(i..

https://www.hackerrank.com/challenges/c-tutorial-stringstream/problem #include #include #include using namespace std; vector parseInts(string str) { vector result; stringstream ss; char ch; int n; // stringstream object called ss encapsulates a string // and allows access to string as we could access any other stream ss.str(str); while (ss >> n) { result.push_back(n); // gets rid of all the comm..

https://www.hackerrank.com/challenges/c-tutorial-pointer/problem #include #include void update(int *a,int *b) { // Complete this function int a_update, b_update; a_update = (*a) + (*b); b_update = abs((*a) - (*b)); *a = a_update; *b = b_update; } int main() { int a, b; int *pa = &a, *pb = &b; scanf("%d %d", &a, &b); update(pa, pb); printf("%d\n%d", a, b); return 0; }

https://www.hackerrank.com/challenges/breaking-best-and-worst-records/problem #include using namespace std; string ltrim(const string &); string rtrim(const string &); vector split(const string &); /* * Complete the 'breakingRecords' function below. * * The function is expected to return an INTEGER_ARRAY. * The function accepts INTEGER_ARRAY scores as parameter. */ vector breakingRecords(vector ..

https://www.hackerrank.com/challenges/kangaroo/problem #include using namespace std; string ltrim(const string &); string rtrim(const string &); vector split(const string &); /* * Complete the 'kangaroo' function below. * * The function is expected to return a STRING. * The function accepts following parameters: * 1. INTEGER x1 * 2. INTEGER v1 * 3. INTEGER x2 * 4. INTEGER v2 */ string kangaroo(i..

https://www.hackerrank.com/challenges/apple-and-orange/problem #include using namespace std; string ltrim(const string &); string rtrim(const string &); vector split(const string &); /* * Complete the 'countApplesAndOranges' function below. * * The function accepts following parameters: * 1. INTEGER s * 2. INTEGER t * 3. INTEGER a * 4. INTEGER b * 5. INTEGER_ARRAY apples * 6. INTEGER_ARRAY orang..

https://www.hackerrank.com/challenges/grading/problem #include using namespace std; string ltrim(const string &); string rtrim(const string &); /* * Complete the 'gradingStudents' function below. * * The function is expected to return an INTEGER_ARRAY. * The function accepts INTEGER_ARRAY grades as parameter. */ vector gradingStudents(vector grades) { int sNum = grades.size(); vector roundedGrad..

www.hackerrank.com/challenges/time-conversion/problem #include using namespace std; /* * Complete the timeConversion function below. */ string timeConversion(string s) { int hour = stoi(s.substr(0, 2)); string result; // AM: remove 'AM' and only consider 12 AM for conversion if (s[8] == 'A') { result.append(s, 0, 8); if (hour == 12) result.replace(0, 2, "00"); } // PM: remove 'PM' and add 12 to ..

https://www.hackerrank.com/challenges/mini-max-sum/problem #include using namespace std; vector split_string(string); // Complete the miniMaxSum function below. void miniMaxSum(vector arr) { int arrsize = 5; long totalsum = 0, max = 0, min = 0; vector sum(5); for (int i = 0; i < arrsize; i++) totalsum += arr[i]; for (int j = 0; j < arrsize; j++) sum[j] = totalsum - arr[j]; sort(sum.begin(), sum...

https://www.hackerrank.com/challenges/diagonal-difference/problem #include #include using namespace std; string ltrim(const string &); string rtrim(const string &); vector split(const string &); /* * Complete the 'diagonalDifference' function below. * * The function is expected to return an INTEGER. * The function accepts 2D_INTEGER_ARRAY arr as parameter. */ int diagonalDifference(vector arr) {..