Tukukkk

This is my attempt at the 4th problem on Project Euler:

#include "stdafx.h"

#include <string>

#include <vector>

#include <iostream>



using namespace std;



int palindromeCheck(int pp) {

    int temp = pp;

    string palindrome = std::to_string(pp);



    auto it1 = palindrome.begin();

    auto it2 = palindrome.end() - 1;



    while (it2 - it1 >= 1) {

        if (*it1 == *it2) {

            ++it1;

            --it2; 

        }

        else {

            return 0;

        }

    }

    return 1;

}



int main()

{

    int highestPalindrome = 0; 

    for (int x = 100; x <= 999; x++) {

        for (int y = 100; y <= 999; y++) {

            int newDigit = x * y;

            int paliCheck = palindromeCheck(newDigit);

            if (paliCheck == 1) {

                if (newDigit > highestPalindrome) {

                    highestPalindrome = newDigit;

                }

            }

        }

    }

    std::cout << highestPalindrome; 

}

I'm trying to get better at both C++ and problem-solving so any help/tips are appreciated.