VIT’27 | 2⭐ max(1478) Codechef | Leetcode max(1712) | Atcoder(8 Kyu) | MERN Developer | Passionate About Full-Stack Development & Problem Solving ...
🚀 Day 62/100 – CodeChef 💻 Solved “Digit Sum Parities” 💡 Idea: Find the next number whose digit sum has opposite parity (odd/even). 👉 Keep incrementing N until digitSum (N) % 2 changes ⚡ Brute ...
If Give an integer N . Write a program to obtain the sum of the first and last digit of this number. I didn't feel like extracting the digits so I just treated the number as a string. Easily ...
一部の結果でアクセス不可の可能性があるため、非表示になっています。
アクセス不可の結果を表示する