1. How would you sort an array without using built-in sorting functions?
2. Left View of a Binary Tree Problem Statement Given a binary tree, your task is to print the left view of the tree. Example: Input: The input will be in level order form, with node values separated by a space. Use -1 to denote null nodes. Output: The Left View of the tree. Explanation: Consider the following tree structure:Level 1: Root = 1Level 2: Left = 2, Right = 3Level 3: Left = 4 (of 2), Right = 5 (of 3), Right = 6 (of 3)Level 4: Right = 7 (of 4)The Left View of this tree is: 1 2 4 7 Constraints: 0 <= N <= 105 1 <= data <= 105 Time limit: 1 second
3. Write a program to print prime numbers from 1 to n.
4. What data would you collect from customers to improve the sales of your supermarket?
5. Write a program to find the 2nd highest number in an unsorted array.
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.
