Reverse an Integer, a PriorityQueue question. Know your time complexitys and data structures, especially heaps

Question

Abishek Ramasubramanian · Accepted Answer

Scanner scanner;
long a, revNo;
int lastDigit;
boolean signChanged;

scanner = new Scanner(System.in);
a = scanner.nextLong();
revNo = 0;
lastDigit = 0;
signChanged = false;

if(a  0) {
	lastDigit = (int)a % 10;
	a = a / 10;
	revNo = revNo * 10 + lastDigit;
}

if(signChanged)
	revNo = revNo * -1;


System.out.println(revNo);

LP · Answer

int num = 12564;
    string sN = to_string(num);
    
    int left = 0;
    int right = sN.size() - 1;
    int tmp;
    
    while(left < right)
    {
        tmp = sN[left];
        sN[left] = sN[right];
        sN[right] = tmp;
        left++;
        right--;
    }
    
    num = atoi(sN.c_str());
    cout << num << endl;

Bloomberg

Bloomberg interview question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches