Create a class below these two method. I am able to find the solution using TreeMap and update the range with the final Time complexity is O(n^2). Is there any better solution? Love to learn from my mistake. \n\n```\nclass Solution{\n\tvoid addRange(int x , int y);\n\tboolean isPresent(int v);\n\t}\n```\n\n```\n    addRange(5,10)\n\taddRange(13,14)\n\tisPresent(3) -> false\n\tisPresent(5) -> true\n\tisPresent(14) -> true\n\taddRange(10,19)\n\tisPresent(16) -> true\n\tisPresent(19) -> true\n\tisPresent(3) -> false\n```

Create a class below these two method. I am able to find the solution using TreeMap and update the range with the final Time complexity is O(n^2). Is there any 