Q1. Given a table of rules, write a function to check if it contains conflicting rules. Two rules are conflicting if their conditions match but values do not. Conditions can contain don\'t cares denoted by \'-\'. Has to be done in O(n) time.\n\ne.g\n\t\tRule    Conditions   Value\n\t\tR1      C1,C2,C3       40\n\t\tR2      BCD1,BC5     40\n\t\tR3      BCD1,BC5     80\n\t\tHere, R2 and R3 conflict.\ne.g \n\t\tR1      C1,C2,C3       40\n\t\tR2      BCD1,BC5     50\n\t\tR3      BCD1,-          50\n\t\tR6      -,-,C3            40\n\t\tNo conflicts.\n\n\nQ2. same as Round 4: https://leetcode.com/discuss/interview-question/930843/google-l3-onsite\n\nQ3. Don\'t remember the exact question but it boiled down to [Employee Importance](https://leetcode.com/problems/employee-importance/)\n\nQ4. Given an n-ary tree, a monkey starts from the top of the tree and can climb to any of its children or stay at the same position (cannot jump more than one step). Write a function to find the probability of finding the monkey at a particular node at a time \'t\'.\n

Q1. Given a table of rules, write a function to check if it contains conflicting rules. Two rules are conflicting if their conditions match but values do not. C