Navbar menu
(Move to ...)
Home
Python
HTML
JavaScript
Quiz
AS400 / IBM iSeries
Contact Us
▼
LeetCode Solution - Problem Pow(x, n)
›
Implement pow(x, n), which calculates x raised to the power n (i.e., x^n). Example 1: Input: x = 2.00000, n = 10 Output: 1024.00000
LeetCode Solution - Problem Factorial Trailing Zeroes
›
Given an integer n, return the number of trailing zeroes in n!. Note that n! = n * (n - 1) * (n - 2) * ... * 3 * 2 * 1. Example 1: Input: n ...
LeetCode Solution - Problem Palindrome Number
›
Given an integer x, return true if x is a palindrome, and false otherwise. Example 1: Input: x = 121 Output: true Explanation: 121 reads as...
LeetCode Solution - Problem Reverse Integer
›
Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer ...
LeetCode Solution - Problem Single Number
›
Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution wi...
LeetCode Solution - Problem Fizz Buzz
›
Given an integer n, return a string array answer (1-indexed) where: answer[i] == "FizzBuzz" if i is divisible by 3 and 5. answer[i...
HackerRank Python Solution - Regex and Parsing - Validating Roman Numerals
›
You are given a string, and you have to validate whether it's a valid Roman numeral. If it is valid, print True. Otherwise, print False....
HackerRank Python Solution - Regex and Parsing - Group(), Groups() & Groupdict()
›
group(): A group() expression returns one or more subgroups of the match. >>> import re >>> m = re.match(r'(\w+)@(\w+)...
HackerRank Python Solution - Regex and Parsing - Re.start() & Re.end()
›
start() & end(): These expressions return the indices of the start and end of the substring matched by the group. >>> import re...
HackerRank Python Solution - Regex and Parsing - Re.findall() & Re.finditer()
›
re.findall(): The expression re.findall() returns all the non-overlapping matches of patterns in a string as a list of strings. >>>...
‹
›
Home
View web version