Nothing here yet.
Nothing here yet.
Jun 24, 2021 · 4 min read · Problem Statement You are given a very large integer n, represented as a string, and an integer digit x. The digits in n and the digit x is in the inclusive range [1, 9] and n may represent a negative number. You want to maximize n's numerical...
Join discussion
Jun 23, 2021 · 3 min read · Problem Statement You are given a string num, representing a large integer. Return the largest-valued odd integer (as a string) that is a non-empty substring of num, or an empty string "" if no odd integer exists. A substring is a contiguous sequence...
Join discussionJun 23, 2021 · 3 min read · Problem Statement You are given an array of strings words (0-indexed). In one operation, pick two distinct indices i and j, where words[i] is a non-empty string, and move any character from words[i] to any position in words[j]. Return true if you can...
Join discussion