You are given two linked lists representing two non-negative integers, where each node contains a single digit, and the digits are stored in reverse order. Your task is to add these two numbers and return the result as a linked list. You can assume that the input does not contain leading zeros except for the number 0 itself.
Reverse the digits of a signed 32-bit integer. If the reversed integer is outside the range of a signed 32-bit integer, return 0. You are restricted from using 64-bit integers.
Given an integer, return true if the number is a palindrome. A number is a palindrome if it reads the same forwards and backwards. If the number is negative, it is automatically not a palindrome.
You are given a positive integer and need to convert it into a Roman numeral. Roman numerals are constructed by combining symbols from the set: I, V, X, L, C, D, M, where each symbol has a specific value. The conversion rules are based on subtractive notation for values like 4 (IV), 9 (IX), and so on, to avoid using symbols multiple times where not allowed.
Given two integers dividend and divisor, divide dividend by divisor without using multiplication, division, or modulus operators. Truncate the result towards zero and return the quotient.
