Blinkit

Blink provides fast and affordable mobile broadband to Australians who need the freedom of internet access on the go. Launched in 2009, Blink is the telecommunications arm of FlexiGroup Limited ("FXL"​), which has over 20 years of experience providing flexible computing and electrical rental options for Australians. Blink provides our customers with access to the Internet and related services by partnering with the Optus Mobile 4G/3G/HSDPA and GSM network – a dual band network that covers 97% of the Australian population. We service individual customers, as well as certain approved small and medium business customers. We strive to make it “Too Easy” for customers to get connected to the internet, and our dedication to our customers was rewarded when we won The ATA’s Australian Contact Centre of the Year 2010 award. Our range of prepaid mobile broadband plans and pricing options are available from leading retailers across Australia. Blink mobile broadband is also a natural addition when Flexirenting or leasing laptops and notebooks. Flexirent customers are eligible for discounts on mobile broadband plans, and also have access to loan equipment. If you want to experience the Blink mobile broadband difference, call us now on 1800 254 654 to speak to our award winning team. _____________________________________________________________________________________

Interview Questions for Blinkit

1. Have you worked in the FMCG sector?

2. How can a rider earn 24000 monthly with 2.3 orders per hour?

3. How do you ensure a store runs efficiently?

4. What do you know about Blinkit?

5. Top View of Binary Tree Given a binary tree of integers, the task is to return the top view of the given binary tree. The top view of the binary tree is the set of nodes visible when viewed from the top. Input: The first line contains an integer 'T' which denotes the number of test cases. The first line of each test case contains elements of the tree in level-order format, with values separated by spaces. Use -1 to denote null nodes. Output: For each test case, return a list of integers representing the top view of the given tree. Example: For the given binary tree: The top view of the tree will be {10, 4, 2, 1, 3, 6}. Example Input: 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1 Explanation: Level 1: The root node is 1. Level 2: Left child of 1 is 2, right child of 1 is 3. Level 3: Left child of 2 is 4, right child is null (-1), left child of 3 is 5, right is 6. Level 4: Right child of 4 is 7, all other children are null (-1). 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1 Constraints: 1 <= T <= 100 0 <= N <= 1000 0 <= data <= 10^6 and data != -1 Where ‘N’ is the total number of nodes, and 'data' is the value of the binary tree node. Time limit: 1 sec Note: The input ends when all nodes at the last level are null (-1). You don't need to print the output. Implement the function to return the answer.