LeetCode Question · Nov 2021 · USA

Amazon | OA | Minimum operation | Minimum Addition

1,489 views 2 replies

Question Details

Q1) Minimum Addition long long solve(long long n){ string s=to_string(n); sort(s.begin(),s.end()); string s1="",s2=""; for(int i=0;i<s.size();i++){ if(i&1) s2+=s[i]; else s1+=s[i]; } long long n1=stol(s1),n2=stol(s2); return n1+n2; } Q2) You are give…

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Arrays Binary Search Strings