largest sum cycle gfg practice. Input: a [] = {10, -10, 20, -40} k = 6 Output: -10 Explanation: The 6th largest sum among sum of all contiguous subarrays is -10. largest sum cycle gfg practice

 
Input: a [] = {10, -10, 20, -40} k = 6 Output: -10 Explanation: The 6th largest sum among sum of all contiguous subarrays is -10largest sum cycle gfg practice  In each DFS traversal:The graph contains 9 vertices and 14 edges

Example 1: Input: Output: 1 Explanation: 3 -> 3 is a cycle. Example 3: Input: nums = [5,4,-1. A brute force approach is to store all the contiguous sums in another array and sort it and print the k-th largest. Output: 3. Linked list can contain self loop. Check for all the values in the array:- If min_so_far is equaled to sum, i. For example, in the following 2D array, the maximum sum submatrix is highlighted with blue rectangle and sum of all elements in this submatrix is 29. We one by one remove every edge from the graph, then we find the shortest path between two corner vertices of it. Find the size of its largest subtree that is a Binary Search Tree. second and repeat step 1 until currIndex is not -1 or it does not. Given an array containing N integers and a positive integer K, find the length of the longest sub array with sum of the elements divisible by the given value K. Solve. Let see an example. Given adjacency list adj as input parameters . Follow the steps below to solve the. First of all consider every ‘0’ in the matrix as ‘-1’. In the worst case, the randomized function may always pick a corner element. Minimum weighted cycle is : Minimum weighed cycle : 7 + 1 + 6 = 14 or 2 + 6 + 2 + 4 = 14. 2. From the map, find the number of subarrays previously found having sum equal to currsum-sum. Approach: The Idea is to compute the indices of the largest three elements in the array. For example, the number 190 will be represented by the linked list, 1->9->0->null, similarly 25 by 2->5->null. Follow the below steps to Implement the idea: Initialize the variables max_so_far = INT_MIN and max_ending_here = 0. e 5 only. Note:- You have to return an ArrayList consisting of two. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Time Complexity of the above solution is O (n2). The path may start and end at any node in the tree. Longest subarray of only 0's or 1's with atmost K flips. Largest Sum. The Sum of a cycle is the sum of node numbers of all nodes in that cycle. So the first unit fraction becomes 1/3, then recur for (6/14 – 1/3) i. e. This is not true, The graph may have no hamiltonian cycle and in the same time have a circuit with a weight larger then n, consider just the case of a graph with tree vertices, say 1,2,3. A cell in the given maze has a value '-1' if it is a blockage or dead-end, else 0. The questions will be featured from a pool of public problems from the GFG Practice Portal. It takes O (log N) to balance the tree. Maximize array product by changing any array element arr [i] to (-1)*arr [i] - 1 any number of times. Sub-array A is greater than sub-array B if sum (A) > sum (B). Practice. We fix the left and right columns one by one and find the largest sub-array with 0 sum contiguous rows. Find the missing element. Q9: Two numbers are in the ratio 2:3. The idea is to reduce the problem to 1 D array. That is the search space for binary search is defined as –. For current node, check if the sum of nodes of current node is greater than sum of left or right subtree. Example: Given an array of integers of size ‘n’, Our aim is to calculate the maximum sum of ‘k’ consecutive elements in the array. The questions will be featured from a pool of public problems from the GFG Practice Portal. Input: N = 4 Arr[] = {-1,-2,-3,-4} Output: -1 Explanation: Max subarray sum is -1 of element (-1) Your Task: You don't need to read input or print anything. Note that in graph on right side, vertices 3 and 4 are swapped. We continue this process for all nodes in the tree and return the final sum. 0 Not attempted (1) AttemptedInput: a [] = {10, -10, 20, -40} k = 6 Output: -10 Explanation: The 6th largest sum among sum of all contiguous subarrays is -10. i] having length i + 1. You don't need to read input or print anything. Return -1 if there are no cycles. Example 1: Input: X = "25", Y = "23" Output: 48 Explanation: The. Given an integer array arr, partition the array into (contiguous) subarrays of length at most k. Approach: To solve the problem follow the below idea: This problem can be thought of as the maximum sum contiguous subarray (Kadane’s. The task is to find the sum of weights of the edges of the Minimum Spanning Tree. Return -1 if there are no cycles. Here adj [i] contains vectors of size 2, where the first integer in that. cpp. Level up your coding skills and quickly land a job. . Length of the longest common span with same sum is 6. Level up your coding skills and quickly land a job. After filling the array, we use the sliding window concept of size k. &nbsp; Example 1: Input: n = 3, edges. Solution Approach. The path may start and end at any node in the tree. An empty linked list is considered as c. &nbsp; Example 1: Input: n = 3, edges. K is the size of subarrays and M is the count of subarray. @Mingle_Tech @Code_Star #mingletech #Mingle_TechThank you for watching this video 💛geeks for geeks, Missing Number in matrix, Absolute List Sorting, Bal. The sum of nodes considering 2 as the root of subtree is 2 = 2. Times may get tough, but for you, Job-A-Thon will be enough! Do not miss out the Post Contest Analysis- Live: Youtube Link (10:30PM IST) Mentor: SunitiSum of the first n terms (S n): The sum of the first n terms of the AP series. Efficient Approach: This method uses the Sliding Window Technique to solve the given problem. Longest path is from 5 to 7 of length 5. Convert all even weight edges into two. For example, consider the following two graphs. Maximum OR sum of sub-arrays of two different arrays. Practice here: maximum result for that node will be equal to the sum of those two paths with the node. Output: No. The idea is to use shortest path algorithm. Given head, the head of a singly linked list, find if the linked list is circular or not. It may be assumed that size of array is more than m*k. Example. Given a list&nbsp;of non negative integers, arrange them in such a manner&nbsp;that they form the largest number possible. The problem has been solved using Graph concept ( DFS )The idea of Kadane’s algorithm is to maintain a variable max_ending_here that stores the maximum sum contiguous subarray ending at current index and a. Doing this ensures that the max heap always contains the K smallest elements encountered so far. A negative cycle is one in which the overall sum of the cycle comes negative. Follow the steps below to solve the problem: Initialize an adjacency list to create a graph from the given set of edges Edges[][]. If the sum of all elements is greater than S and its size is greater than K, then update answer with minimum of answer and length of the subarray. The point at which they meet is the start of the loop. Examples: Input : 7 / 12 2 / 11 13 5 / / 2 1 38 Output: 44 BST rooted under node 5 has the maximum sum 5 / 1 38 Input: 5 / 9 2 / 6 3 / 8 7 Output: 8 Here each leaf node represents a binary search tree. Maximum size of subset of given array such that a triangle can be formed by any three integers as the sides of the triangle. Back to Explore Page. Example 1: Input: n = 6 arr[] = {0,0,5,5,0,0} Output: 6. Given an undirected and connected graph and a number n, count total number of cycles of length n in the graph. Back to. You have to find the K-th largest sum of contiguous subarray within the array elements. Given an array a [] of size N, and Q queries of two types 1 and 2. Example 1: Input: E = [[0,1,9]] S = 0 Output: 0 9 Explanation : Shortest distance of all nodes from source is printed. Recommended Practice. Given a maze with&nbsp;N&nbsp;cells. Sub-array A is greater than sub-array B if sum (A) > sum (B). Largest Sum Contiguous Subarray using Dynamic Programming: For each index i, DP [i] stores the maximum possible Largest Sum Contiguous Subarray ending at index i, and therefore we can calculate DP [i] using the mentioned state transition: DP [i] = max (DP [i-1] + arr [i] , arr [i] ) Below is the implementation: C++. Jobs. Tree. The formula for the sum of n terms of AP: How do we check whether a series is an arithmetic progression or not? 1. Find the length of each subarray. Maximum sub-array is defined in terms of the sum of the elements in the sub-array. (Node having maximum sum weight ). Solved basic array problems from GFG Practice platform. To get alternating subsequences with maximum length and the largest sum, we will be traversing the whole list (length of list)-1 times for comparing signs. This is O (N) runtime: each edge (of which there's at most N) is followed at most 3 times in the graph, and the cache is updated exactly once for each node in the graph. A sheet that covers almost every concept of Data Structures and Algorithms. Example 2: Input: N = 2,K = 2 A [] = {10 5} Output: -1 Explanation: Can't make any increasing subsequence of length 2. Example 1: Input: 1 / \ 2 3 / \ / \ 4 5 6 7 Output: 28 Explanation Your task is to complete the function isNegativeWeightCycle () which takes n and edges as input paramater and returns 1 if graph contains negative weight cycle otherwise returns 0. Pick the rest of the elements one by one and follow the following steps in the loop. Level up your coding skills and quickly land a job. Input: arr[] = {3, 2, 7, 10} Output: 13 Explanation: The subsequence is {3, 10}. The task is to find the sum of weights of the edges of the Minimum Spanning Tree. Constraints: * 1 <= nums. Solve company interview questions and improve your coding intellect. Example 2: Input: nums = [1] Output: 1 Explanation: The subarray [1] has the largest sum 1. Find the product of the maximum product subarray. Type 2: given type, index, and value, update aindex = value. Follow the given steps to solve the problem: Let the array have R rows. Basic Accuracy: 69. 4) Return result. , 3. 4. Since there are total n elements, maximum sum is n for both arrays. If the weight is < n, then the original graph has no Hamiltonian cycle, otherwise it does. Given a maze with&nbsp;N&nbsp;cells. Therefore the output will be 3. &nbsp;Here adj[i] contains vectors of size 2,Given a binary tree, the task is to find the maximum path sum. Find the total count of sub-arrays having their sum equal to 0. The graph is represented as an adjacency matrix of size&nbsp;n*n. Largest possible 5 digit number is 93000 with sum 12. (Order of array remains unchanged). If maxm < 0, then print the value of maxm. World Cup Hack-A-Thon; GFG Weekly Coding Contest; Job-A-Thon: Hiring. Largest sum Zigzag sequence in a matrix; Largest area rectangular sub-matrix with equal number of 1's and 0's; Collect maximum coins before hitting a dead end; Find length of the longest consecutive path from a given starting character; Maximum points from top left of matrix to bottom right and return back; Longest Increasing Path in MatrixAdd this topic to your repo. Linked list is : 17 -> 22 -> 13 -> 14 -> 15 -> NULL Maximum element in linked list:22 Minimum element in. 1. If the size of the max heap exceeds K, pop (remove) the smallest element from the min heap. Declare a variable count with value 0 to store the final answer. Note:The cells are named with an integer value from 0 to N-1. The task is to reverse every k nodes (where k is an input to the function) in the linked list. The steps to construct the Subsequence is shown below: In a vector result, store the value of the element where the Maximum Sum Increasing Subsequence was found (i. Print the longest of all subsequences with maximum sum. Input : K = 2 8 / 5 11 / 2 7 3 Output : 19 Explanation: 2nd largest element is 8 so sum of all elements greater than or equal to 8 are 8 + 11 = 19. In that case you must submit your solution again to maintain the streak and earn a Geek Bit. Traverse through all pairs again and search for X – (current pair sum) in the hash table. Example 1: Input: edges = [3,3,4,2,3] Output: 3 Explanation: The longest cycle in the graph is the cycle: 2 -> 4 -> 3 -> 2. If you are a frequent user of our Practice Portal, you may have already solved the featured Problem of the Day in the past. Given adjacency list adj as input parameters . e. A back edge is an edge that is from a node to itself (selfloop) or one. The idea is similar to linear time solution for shortest path in a directed acyclic graph. Output : 7 Explanation : 3rd smallest element in the given array is 7. Given an integer N, find its factorial. Given adjacency list adj as input parameters . Example 2:Output: Maximum difference is 109. Explanation: The subarray having maximum sum with distinct element is {2, 3, 1, 5}. Move both slow and fast pointers one node at a time. The idea is to maintain a maximum (positive-sum). Algorithm to Find Negative Cycle in a Directed Weighted Graph Using Bellman-Ford: Initialize distance array dist [] for each vertex ‘v‘ as dist [v] = INFINITY. Practice. Example 1: Input: N = 3 value [] = {1,2,1. A-143, 9th Floor, Sovereign Corporate Tower, Sector-136, Noida, Uttar Pradesh - 201305Approach: The given problem can be solved by finding the last element which is greater than its next element, and swapping it with the next smaller element in the array. Sum of a cycle is the sum of nodeSum of two large numbers | Practice | GeeksforGeeks. The path may start and end at any node in the tree. Contests. Geekbits count & redemption. We fix the left and right columns one by one and find the largest sub-array with 0 sum contiguous rows for every left and right column pair. Example 1: Input: n = 3 arr = [1,2,3] Output: [1,2] Explanation: Largest Divisble Subset is [1,2]. Let e = uv be an edge of G and consider the graph H = G – uv. You don't to print answer or take inputs. Two Sum Using remainders of the elements less than x: The idea is to count the elements with remainders when divided by x, i. Return -1 if it is not possible. From subarray Arr [i. Practice. Matrix[i][j] denotes&nbsp;the weight of the edge from i to j. Clearing the DSA round for the Interviews, as these are the questions generally asked in the companies like Amazon, Microsoft, Google, etc. If no such row exists, return -1. Examples: Input: N = 4, Edge [] = {1, 2, 0, -1} Output: 3 Given an array Arr[] of N integers. If the stack is not empty, compare top most element of stack with next. Level up your coding skills and quickly land a job. The sum of right-subtree is 1 The sum of tree is 13. While finding all subarray calculate their size and sum of all elements of that subarray. Step 1-> 12345 % 10 which is equal-too 5 + ( send 12345/10 to next step ) Step 2-> 1234 % 10. the used approach of using sum at each node until the node is again repeated in the cycle. Example 1: Input : 1 / 2 3 Output : 1 3 Explanation : There are two levels in the tree : 1. If max_ending_here < 0 then update. Example 2: Input: N. No cycle is formed, include it. But in the case of the number of elements being large, the array in which we store the contiguous. This gives sum = 13. For example below graph have 2 triangles in it. Given a binary tree, the task is to find the maximum path sum. Hey guys, In this video, we'll be solving Largest Sum Contiguous Subarray Problem using Kadane's Algorithm. Given an undirected and unweighted graph. Time Complexity: O(N 2 *log(N)) Auxiliary Space: O(N) Efficient Approach: To optimize the above approach, the idea is to make use of Map. Learn Resume Building, C++, Java, DSA, Core Subjects, Aptitude, Reasoning, LLD, and much more! Flat 25% OFF + Access to Product-Based Test Series @No Cost!Your task is to complete the function rowWithMax1s () which takes the array of booleans arr [] [], n and m as input parameters and returns the 0-based index of the first row that has the most number of 1s. A global variable is set that is compared at each iteration with the local sum values to obtain the final result. Note: The cells are named with an integer value from 0 to N-1. Finally, we return the largest sum of digits. org or mail your article to review-team@geeksforgeeks. Auxiliary Space: O (1) ,since no extra space is used. Expected Time Complexity: O (n*m) Expected Space Compelxity: O (n) Constraints: 1 <= n <= 100. Example 1: Input: X = "25", Y = "23" Output: 48 Explanation: The sum of 25 and 23 is 48. Approach: The given problem can be solved by finding all the paths from a given source to a destination and using a Priority Queue to find the K th largest weight. If one side of the root is empty, then the function should return minus infinite (INT_MIN in case of. Given an array arr [] and an integer K. The element should occur more than once and the index of its first occurrence should be the smallest. Minimum and maximum node that lies in the path connecting two nodes in a Binary Tree. Connected Components for undirected graph using DFS: Finding connected components for an undirected graph is an easier task. Each cell may have multiple entry points but not more than one exit (i. The idea is to convert given problem to a simpler problem where we have to just check if there is cycle of odd length or not. In this case, Kadane’s algorithm will produce the result. The graph is represented as an adjacency. We initialize distances to all vertices as minus infinite and distance to source as 0, then we find a topological sorting of the graph. 138 subscribers. Sliding Window 100. If there is no cycle in the graph then return -1. Inputs to queries are left top and right bottom indexes of submatrix whose sum is to find out. Back to Explore Page Given a Binary Tree. The task is to check if the linked list has a loop. Counting 102. This is the highest possible sum of a. Expected Time Complexity: O (Log N) Expected Space Complexity: O (1) Constraints: 1 <= N <= 100000. For example, consider 6/14, we first find ceiling of 14/6, i. So, this DSA sheet by Love Babbar contains 450 coding questions which will help in: Understanding each and every concept of DSA. You are given an array&nbsp;Edge []&nbsp;of&nbsp;N&nbsp;integers,&nbsp;where Edge [i] The task is to find the largest sum of a cycle in the maze (Sum of a cycle is the sum of the cell indexes of all cells present in that cycle). This is the best place to expand your knowledge and get prepared for your next interview. e entry/exit points are unidirectional doors like valves). Given an integer array arr, partition the array into (contiguous) subarrays of length at most k. Auxiliary Space: O(n), where N represents the size of the given array. In that case you must submit your solution again to maintain the streak and earn a Geek Bit. Given a weighted directed graph with n nodes and m edges. And we have to count all such cycles that exist. gfg potd gfg potd todaygfg problem of the dayProblem Link:-Link:-h. Example 1: Input: N = 2, S = 9 Output: 90 Explaination: It is the biggest number with sum of digits equals to 9. Naive Approach: The naive approach is to generate all the possible subarray and print that subarray which has maximum sum. Function Description: The sum of the largest sum cycle in the maze. Can you solve this real interview question? Maximum Subarray - Given an integer array nums, find the subarray with the largest sum, and return its sum. Initialize ans, start and end variables as -1, 0, and N respectively. Naive Approach: The simplest approach to solve the problem is to generate all possible subarrays and for each subarray, check if all its elements are unique or not. Naive Approach: The basic way to solve the problem is as follows: Run a loop from 0 to N-1 and check the weight for every cell by traversing the whole Edge[] array. Graph 134. Find the contiguous sub-array(containing at least one number) which has the maximum sum and return its sum. Queries to check if the path between two nodes in a tree is a palindrome. Cycle sort is an in-place, unstable sorting algorithm that is particularly useful when sorting arrays containing elements with a small range of values. Given a binary tree with a value associated with each node, we need to choose a subset of these nodes such that sum of chosen nodes is maximum under a constraint that no two chosen node in subset should be directly connected that is, if we have taken. The two sub-arrays are [1, 2, 5] [2, 3]. Solved 3 Linked list problems using Recursion and two-pointers approach:. First we store the prefix sum in a separate array so that any subarray sum can be calculated in constant time. Example 1: Input: A[] = {2, 7, 6, 1, 4, 5} K = 3 Output: 4 Explanation: The subarray is {7, 6, 1, 4} with sum 18, which is divisible by 3. at any step, the sum of the square of digits obtained is a single-digit number except 1 or 7. entry/exit points are unidirectional doors like valves). . We first compute maximum sum till every index and store it in an array maxSum[]. No cycle is formed, include it. Every cell of the maze contains these numbers 1, 2 or 3. Example 1: Input: A[] = {2, 7, 6, 1, 4, 5} K = 3 Output: 4 Explanation: The subarray is {7, 6, 1, 4} with sum 18, which is divisible by 3. Approach: The given problem can be solved by finding all the paths from a given source to a destination and using a Priority Queue to find the K th largest weight. Given an array of positive integers. Solved 3 Linked list problems using Recursion and two-pointers approach:. Longest Increasing Subsequence having sum value atmost K. Example 2: Input:Approach 2: Recursive DFS. NOTE: If there is a tie, then compare with segment's length and return segment which has maximum length. Contests. Solve Problem. return a list of integers denoting the digits that make up the factorial of N. For the root node, sum of elements in left subtree is 40. This is because 1 and 7 are the only single-digit happy numbers. Example 2: Input: n = 7 A [] = {1, 2, 0, 3, 2, 4, 5} Output: 5 Explanation: The largest element of given array is 5. A Tree is BST if the following is true for every node x. Examples to illustrate the use of the Sliding window technique. If not possible returns -1. If max_ending_here < 0 then update max_ending_here = 0. Longest Increasing Subsequence having sum value atmost K. . Recommended Practice. Input : 331 Output : 313 Input : 3444 Output : Palindrome cannot be formed. Largest Sum Cycle | Graphs | GFG POTD | Feb 02 Problem Link: Given an array arr [] of N elements and a number K. Return - 1 if there are no cycles. Following is an example of SumTree. Approach: Depth First Traversal can be used to detect cycle in a Graph. It may be assumed that size of array is more than m*k. Once the graph traversal is completed, push all the similar marked numbers to an adjacency list and print the adjacency list accordingly. By connecting 1 to 3, we can create a Euler Circuit. Contests. Find the largest sum of a cycle in the maze; Determine whether a universal sink exists in a directed graph; Roots of a tree which give minimum height; Two Clique Problem (Check if Graph can be divided in two Cliques) Hypercube Graph; A Peterson Graph Problem; Channel Assignment Problem; Number of sink nodes in a graphGiven a weighted, undirected and connected graph of V vertices and E edges. Example 1: Input: N = 5 Output: 120 Explanation : 5! = 1*2*3*4*5 = 120 Example 2: Input: N = 10 Output: 3628800 Explanation :For m = 1, the number is 168 + 3 = 171, the sum of whose digits is 9. Example 1: Input: N = 4, Level up your coding skills and quickly land a job. The output for the above will be. Expected Time Complexity: O(N)Probability that the cut produced by Karger’s Algorithm is Min-Cut is greater than or equal to 1/(n 2) . If max_so_far is less than max_ending_here then update max_so_far to max_ending_here. Minimum Spanning Tree. Example 1: Input: 10 / 2 -25 / / 20 1 3 4 Output: 32 Explanation: Path in the g. The function “largestSum” takes array “arr” and it size is “n”. You don't need to read input or print anything. Example 1: Input: Output: 1 Explanation: 3 -&gt; 3 is a cycle Example 2: Input: Output: 0 Explanation: no cycle in the graph. , we use Topological Sorting . Solve. Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, GeeksforGeeks Courses are your key to success. Range query for Largest Sum Contiguous Subarray. 5xMethods And Algorithms Used1. Solved the problem Split Array Largest Sum using Binary Search; Binary-Search Repo: Day 83. The idea is to. Input: 10 / \ 2 5 \ -2 Output: 17 Explanation: Path in the given tree goes like 2 , 10 , 5. . A SumTree is a Binary Tree where the value of a node is equal to the sum of the nodes present in its left subtree and right subtree. Find length of the longest subarray containing atmost two distinct integers. Follow the given steps to solve the problem: Create a Hashmap ( hm) to store a key-value pair, i. This is the best place to expand your knowledge and get prepared for your next interview. Linked List 72. Personalised Dashboard. Expected Time Complexity: O (n*m) Expected Space Compelxity: O (n) Constraints: 1 <= n <= 100. Given a binary tree. Your task is to complete the function fibSum () which takes an integer N as input parameter and returns the sum of all the Fibonacci number from F0 to FN. Follow the steps below to solve the given problem: We will calculate the total sum of the given array. Examples: {-10, 2, -1, 5}, {-2, 4, -1, 4, -1}. Given two decimal numbers represented by two linked lists of size N and M respectively. Max Sum value chain is {1, 2} with values {10, 25}, hence 35 is answer. Split the given array into K subarrays such that the maximum subarray sum achievable out of K subarrays formed is minimum possible. Continue this process until head not equal to NULL. Back to Explore Page. Platform to practice programming problems. e. Example 1: Input: N = 8 K = 3 A [] = {8 5 9 10 5 6 19 8} Output: 38 Explanation: Possible increasing subsequence of length 3 with maximum possible sum is 9 10 19. 89% Submissions: 109K+ Points: 4. Proof: Let there be a unique Min-Cut of given graph and let there be C edges in the Min-Cut and the edges be {e 1, e 2, e 3, . Given an array A of size N. Your Task: You don't need to read input or print anything. Steps to implement-. Follow the below steps to Implement the idea: Initialize the variables max_so_far = INT_MIN and max_ending_here = 0. Analysis of Graph Coloring Using Greedy Algorithm: The above algorithm doesn’t always use minimum number of colors. Practice. Streak count. Run two for loops to find all subarray. In the sum, data of node itself and data of its immediate children is to be taken. Example 1: The above graph has two cycles of length 4 and 3, the product of cycle lengths is 12. If next is greater than the top element, Pop element from the stack. Example 1: Input: N = 7 a [] = {2,6,1,9,4,5,3} Output:Given an array arr[] of size N and an integer K. Example 1: The task is to find the largest sum of a cycle in the maze (Sum of a cycle is the sum of the cell indexes of all cells present in that cycle). Follow the below steps to solve the problem: Initialize a min heap (priority queue) pq. Given an array A[] of size N, return length of the longest subarray of non- negative integers. This is the best place to expand your knowledge and get prepared for your next interview. Replace each element of an array with 1 if it is greater than or equal to X, else replace it with -1. An efficient solution is to use hashing. 1.