Bit shifting:

int solveMeFirst(int a, int b) {
    while (b != 0) {
        int carry = a & b;
        a = a ^ b;
        b = carry << 1;
    }

    return a;
}

**Here is problem solution in Python Java c++ c and javascript **- https://programmingoneonone.com/hackerrank-solve-me-first-problem-solution.html

Group Travel Team specializes in organizing seamless group trips, offering expert planning for family vacations, corporate retreats, school outings, and more. They handle everything from accommodations to customized itineraries, ensuring a stress-free travel experience. With their focus on providing tailored solutions and group discounts, they make group travel hassle-free and enjoyable for everyone involved.

Here is my c++ solution : https://youtu.be/55kgGHzTTzo

#include <iostream>
using namespace std;

int solveMeFirst(int a, int b) {
  return a + b;
}

int main() {
  int num1, num2;
  int sum;
  cin>>num1>>num2;
  sum = solveMeFirst(num1,num2);
  cout<<sum;
  return 0;
}