Question: Dynamic line You are tasked to analyze trend lines and predict some important metrics for the company, and you realize that the first step is
Dynamic line You are tasked to analyze trend lines and predict some important metrics for the company, and you realize that the first step is to master the science of finding line intersections. Initially, you have the Cartesian plane without any lines. You are given n queries of three types .+kb- add the line with equation y kx + b . -k b remove the line with equation y-kx +b. I is guaranteed that the line exists .? q Find the number of lines that intersect with the line y q at a point with an integer x-coordinate Complete the function dynamicLinelntersection which takes in an integer n denoting the number of queries and prints the answer of each? query in a single line. You will need to take the queries from the standard input. Input Format The first line contains one integer n. The next lines contain one of the following queries Constraints . g. k and b are integers Output Format For each ? query, print a single line containing a single integer denoting the answer to that query Sample Input 0 4 + 20 ? 2
Step by Step Solution
There are 3 Steps involved in it
To solve the problem of finding line intersections with an integer xcoordinate follow these steps Steps 1 Initialize Data Structures Use a HashSet to ... View full answer
Get step-by-step solutions from verified subject matter experts
