two questions were asked: 1: to find the no of connected components in the graph with the value of of 1 in the 2D array consisting of 0 and 1 2:in the array given of consisting of any numbers like positive,negative and zero and constant T given we need to find how many contiguous segment are there having the sum exactly T.

Round 1(Technical):

Question 1: Introduce yourself Question 2: Tell me about the project you mentioned in the intro and further asked to draw model diagrams explaining the project like what modules you are using and where storing and all Question 3:write an sql query to insert some data in any rows Question 4:what is context switching?What is basically changes like full description? Question 5:The Problem: The Two-Strike Array Search The Setup: You are given a hidden, sorted boolean array of length N. The array consists of a continuous prefix of 0s followed by a continuous suffix of 1s (e.g., [0, 0, 0, 0, 1, 1, 1]). The Goal: Find the exact index k where the first 1 appears. The Constraints (The Catch): You have an API function get(index) that returns the value at that index, but it is heavily restricted: Total Query Limit: You can call get(index) a maximum of 150 times. The "Strike" Penalty: If get(index) returns 0, there is no penalty (you can hit 0s infinitely). However, if get(index) returns 1, you take a strike. You are allowed a maximum of two strikes. If you hit a 1 for a third time, the API breaks and you fail. Link to problem: https://leetcode.com/problems/egg-drop-with-2-eggs-and-n-floors/description/?hl=en-GB