Bit Mask, Parentheses, and Logic | Dataford Interview Questions

Solve problems involving a binary bit mask, valid parentheses, a logical AND operation, getting the middle character, and reverse factorial. Implement solve_tasks(mask, bit, left, right, parentheses, text, factorial_value). Return a dictionary with bit_set, logical_and, valid_parentheses, middle, and reverse_factorial; for even-length text, middle contains the two middle characters, and reverse_factorial is the integer k where k! equals the input, or -1 if none exists.

Constraints

0 <= mask < 2^31
0 <= bit < 31
left and right are booleans
parentheses contains only '(' and ')'
1 <= len(text) <= 10^5
1 <= factorial_value <= 10^18

Function Signature

def solve_tasks(mask, bit, left, right, parentheses, text, factorial_value):

Your question is Bit Mask, Parentheses, and Logic. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Constraints

0 <= mask < 2^31
0 <= bit < 31
left and right are booleans
parentheses contains only '(' and ')'
1 <= len(text) <= 10^5
1 <= factorial_value <= 10^18

Function Signature

def solve_tasks(mask, bit, left, right, parentheses, text, factorial_value):

Your question is Bit Mask, Parentheses, and Logic. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.