1. Explain the concept of a Binary Search Tree (BST).
2. What is API, testcases of the scenarios
3. Design a data structure that supports the following two operations: void addNum(int num) - Adds the integer num from the data stream to the data structure. double findMedian() - Returns the median of all elements so far. For example: addNum(1), addNum(2), findMedian() -> 1.5, addNum(3), findMedian() -> 2
4. How long have you been trading?
Browse through a variety of job opportunities tailored to your skills and preferences. Filter by location, experience, salary, and more to find your perfect fit.
We have sent an OTP to your contact. Please enter it below to verify.
Instantly access job listings, apply easily, and track applications.
