1. Tell me about yourself.
2. Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.
3. Describe the design and architecture of LinkedIn.
4. Bipartite Graph Problem Statement Determine if a given graph is bipartite. A graph is bipartite if its vertices can be divided into two independent sets, 'U' and 'V', such that every edge ('u', 'v') connects a vertex from 'U' to 'V' or a vertex from 'V' to 'U'. Input: You are provided with a 2D array 'edges' containing 0s and 1s, where 'edges[i][j]' = 1 indicates a bi-directional edge between vertices 'i' and 'j'. Output: Return a boolean value for each test case, indicating whether the graph is bipartite. Example: Input: N = 3edges = [[0, 1, 1], [0, 0, 1], [0, 0, 0]] Output: true Constraints: 1 <= T <= 10 2 <= N <= 300 0 <= edges[i][j] <= 1 Note: If edges[i][j] = 1, it implies a bi-directional edge exists between 'i' and 'j'. You are not required to print the output; just implement the function.
5. Given an array of integers and a window of size k, find the maximum (or minimum) of each window as it slides through the 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.
