Example 1: Input: Output: 1 Explanation: 3 -> 3 is a cycle. Maximum OR sum of sub-arrays of two different arrays. Paytm. Note that in graph on right side, vertices 3 and 4 are swapped. In the worst case, the randomized function may always pick a corner element. Practice. Follow the steps below to solve the. Linked list can contain self loop. The time complexity of the given BFS algorithm is O(V + E), where V is the number of vertices and E is the number of edges in the graph. Enumeration 58. For each subarray find its all subarray by running two another for loops. The graph is connected. After that we will initialize our two subarray from (N – 2K) and (N – K) indices, where. Level up your coding skills and quickly land a job. The idea is similar to linear time solution for shortest path in a directed acyclic graph. Cycle sort is an in-place, unstable sorting algorithm that is particularly useful when sorting arrays containing elements with a small range of values. Traverse through all pairs again and search for X – (current pair sum) in the hash table. GfG Weekly + You = Perfect Sunday Evenings! Given a number N, the task is to find the largest prime factor of that number. 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 a node in our sum then we can’t take its any children or parents in consideration and vice versa. Given an integer array arr, partition the array into (contiguous) subarrays of length at most k. To add x to sum, -x can be subtracted from it because sum- (-x) = sum + x. Given an integer N, find its factorial. For example, instead of paying cost for a path, we may. Sum of two large numbers | Practice | GeeksforGeeks. Maximum size of subset of given array such that a triangle can be formed by any three integers as the sides of the triangle. Given a boolean 2D array of n x m dimensions where each row is sorted. Example 1: Input: N = 7 a [] = {2,6,1,9,4,5,3} Output:The task is to find minimum edges required to make Euler Circuit in the given graph. 594 views 1 month ago GFG POTD series. Output 45. We can find the largest and second-largest in O (n) time by traversing the array once. We will soon be covering solution for the problem where duplicate elements are allowed in subarray. Return - 1 if there are no cycles. Step 2: Pick edge 8-2. 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. This is the highest possible sum. e 5 only. You don't need to read input or print. Find the length of the longest subarray with atmost K occurrences of the integer X. Example 1. Example 3: Input: nums = [5,4,-1,7,8] Output: 23 Explanation: The subarray [5,4,-1,7,8] has the largest sum 23. 2) Initialize a count variable to 0. If max_so_far is less than max_ending_here then update max_so_far to max_ending_here. With over 1500+ candidates placed in 200+ companies in the last 1 year, Job-A-Thon brings you yet another chance to get placed in top companies. Send feedback. Examples : Input : 313551 Output : 531135 Explanations : 531135 is the largest number which is a palindrome, 135531, 315513 and other numbers can also be formed but we need the highest of all of the palindromes. Find Complete Code at GeeksforGeeks Article: video is contributed by Anant PatniPlease Like,. Level up your coding skills and quickly land a job. You don't need to read input or print anything. Given two strings denoting non-negative numbers X and Y. To find a subarray with median greater or equal to X at least half of the elements should be greater than or equal to X. Recommended: Please solve it on “ PRACTICE ” first, before moving on to the solution. Return -1 if there are no cycles. You are given an array Arr of size N. Calculate the sum of X and Y. Given an array of positive integers. This is the best place to expand your knowledge and get prepared for your next interview. 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. The task is to find the sum of weights of the edges of the Minimum Spanning Tree. Example 1: Input: X = "25", Y = "23" Output: 48 Explanation: The sum of 25 and 23 is 48. 1) First find the leaf node that is on the maximum sum path. If “n != 1” , then a recursive call the function “largestSum” to find the largest sum of the subarray “arr [0…n-1]” excluding the last element “arr [n-1]”. 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. After partitioning, each subarray has their values changed to become the maximum value of that subarray. Find the 0-based index of the first. To find the largest subarray having a sum greater than zero, we check the value of. 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. This Repository contains my solution for the problems I practice on Leetcode and GeeksForGeeks. Menu. To convert, we do following. Therefore the output will be 3. The assertion is clearly true for a graph with at most one edge. Find the length of the largest subarray with equal number of 0s and 1s. e. The task is to return a linked list that represents the sum of these two numbers. Each cell may have multiple entry points but not more than one exit (ie. K’th smallest element in an unsorted array using Priority Queue(Max-Heap):. Find the total count of sub-arrays having their sum equal to 0. K'th smallest element is 5. Example 1: Input: 10 / 2 -25 / / 20 1 3 4 Output: 32 Explanation: Path in the g. The point at which they meet is the start of the loop. Find length of the longest subarray containing atmost two distinct integers. geeksforgeeks. For an undirected graph, we can either use BFS or DFS to detect the above two. Video. Note: The cells are named with an integer value from 0 to N-1. You have got a maze, which is a n*n Grid. It was developed by W. In this case, Kadane’s algorithm will produce the result. Then the next search space possible will be in the. Time Complexity: O (V+E) where V is the number of vertices and E is the number of edges. 138 subscribers. Example 1: Input: N = 2, S = 9 Output: 90 Explaination: It is the biggest num. Input: a [] = {10, -10, 20, -40} k = 6 Output: -10 Explanation: The 6th largest sum among sum of all contiguous subarrays is -10. a) Pick an arbitrary edge (u, v) from set E and add 'u' and 'v' to result. Linked List 72. Explanation: Subsequence { 11, 7 } and { 9, 2, 7 } has sum equal to 18. Note: edges [i] is defined as u, v and weight. An empty linked list is considered as c. So, this DSA sheet by Love Babbar contains 450 coding questions which will help in: Understanding each and every concept of DSA. No cycle is formed, include it. Therefore, sum is = 2 + 3 + 1 + 5 = 11. For the given query of: Type 1: given l and r (they are positions), and task is to print the Largest sum Contiguous Subarray. 2) Once we have the target leaf node, we can print the maximum sum path by traversing the tree. It's uses O (N) additional storage. Example 1: Input: N = 4 , M = 4 Arr[][] = {{0, 1, 1, 1},Note: If the Graph contains a negative cycle then return an array consisting of only -1. Note: edges [i] is defined as u, v and weight. From a given cell, we are allowed to move to cells (i+1, j) and (i, j+1) only. Among them { 9, 2, 7 } is longest. Back to. Find the maximum sum among such. Your task is to complete the function largest () which. Initialize ans, start and end variables as -1, 0, and N respectively. Find the product of the maximum product subarray. Practice. Count of largest sized groups while grouping according to product of digits; Find the subsequence with given sum in a superincreasing sequence; Find the size of largest group where groups are according to the xor of digits; Maximum number of times Array can be reduced in half when its all elements are evenThe task is to complete the function isPalindrome() which takes head as reference as the only parameter and returns true or false if linked list is palindrome or not respectively. 0 = arr [i+1] + arr [i+2] + . Given an undirected and connected graph and a number n, count total number of cycles of length n in the graph. Union Find 79. Solved 3 Linked list problems using Recursion and two-pointers approach:. Where trace (A) is the sum of the elements on the. We can solve this problem similar to two pointers method. Maximum sub-array is defined in terms of the sum of the elements in the sub-array. Solve company interview questions and improve your coding intellect Given an Undirected simple graph, We need to find how many triangles it can have. Solve company interview questions and improve your coding intellect. The maximum sum path may or may not go through the root. So this would be a O (N*N) complex right. If there are more than or equal to 3 positive elements or more than or equal to 3 negative elements, then the condition arr[i]+arr[j]+arr[k] = an element of the array cannot be true. e, low = mid + 1) Check if the element at the middle index is last 1 then return mid + 1. In that case you must submit your solution again to maintain the streak and earn a Geek Bit. We also add end to previous sum. The Greedy Choice is to pick the smallest weight edge that doesn’t cause a cycle in the MST constructed so farWelcome to our daily problem solving session where Siddharth will be tackling the Problem of The Day. Time Complexity : O(n 2) Auxiliary Space : O(1) Method 2 (Using Auxiliary Array) The idea is based on the below observations. Convert all even weight edges into two. Solve. Return the largest sum of the given array after partitioning. The path may start and end at any node in the tree. Q9: Two numbers are in the ratio 2:3. The task is to find the maximum value achievable by a + shaped pattern. So, this DSA sheet by Love Babbar contains 450 coding questions which will help in: Understanding each and every concept of DSA. Detailed solution for Split Array – Largest Sum - Problem Statement: Given an integer array ‘A’ of size ‘N’ and an integer ‘K'. 3rd cycle: 11 12 13. 1. Subtract each element of the subarray with the maximum. b) Remove all edges from E which are either incident on u or v. Each cell may have multiple entry points but not more than one exit (ie. In the sum, data of node itself and data of its immediate children is to be taken. Example 1: Input: N = 3 value [] = {1,3,4} x (position at which tail is connected) = 2 Output: True Explanatio. the used approach of using sum at each node until the node is again repeated in the cycle. NOTE: If there is a tie, then compare with segment's length and return segment which has maximum length. Find the Inversion Count in the array. Recommended Practice. ; Now create a max/min variable (let’s say m) with value. Remove all nodes which don't lie in any path with sum>= k; Maximum spiral sum in Binary Tree; Sum of nodes at k-th level in a tree represented as string; Sum of all the numbers that are formed from root to leaf paths; Merge Two Binary Trees by doing Node Sum (Recursive and Iterative) Find root of the tree where children id sum for every node. e. Given an array of integers. Follow the steps below to solve the given problem: We will calculate the total sum of the given array. Output : 7 Explanation : 3rd smallest element in the given array is 7. Max Sum value chain is {1, 2} with values {10, 25}, hence 35 is answer. An empty tree is SumTree and the sum of an empty tree can be considered as 0. Tree. The idea is to. Examples of linear data structures are array, stack, queue, linked list, etc. Given adjacency list adj as input parameters . Each cell may have multiple entry points but not more than one exit (ie. Complete the function sum() which takes array arr and single integer n, as input parameters and returns an integer denoting the answer. Solve. Output. Below image is a dry run of the above approach: Below is the implementation of the above approach:Output: Length of the longest contiguous subarray is 3. Maximize the minimum difference between any element pair by selecting K elements from given Array. length <= 105 * -104 <= nums[i] <= 104 Follow up: If you have figured out the O(n) solution, try coding another. If the sum is greater than k, then-largest subarray having a sum greater than k is arr [0. Following is an example of SumTree. e c}. Return the length of the longest cycle in the graph. Solved the problem of finding the starting point of a cycle in Linked list; Day 78. We can generate Egyptian Fractions using Greedy Algorithm. Your task is to complete the function LargestSubset. 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. The sum of nodes considering 2 as the root of subtree is 2 = 2. If this value is removed from currsum then the desired sum can be obtained. 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. The space complexity is also O(V + E) since we need to store the adjacency list and the visited array. Example 2: Given a weighted, undirected and connected graph of V vertices and E edges. Return the largest sum of the given array after partitioning. Examples: Input : K = 3 8 / 7 10 / / 2 9 13 Output : 32 Explanation: 3rd largest element is 9 so sum of all elements greater than or equal to 9 are 9 + 10 + 13 = 32. low = 1 high = min (N, M) Next Search Space: In each iteration find the mid of the search space and then Finally, check that all subarrays of that size have the sum less than K. Declare a variable count with value 0 to store the final answer. In this case, Kadane’s algorithm will produce the result. Mark the current element as next. Back to Explore Page. The sum of right-subtree is 1 The sum of tree is 13. Inputs to queries are left top and right bottom indexes of submatrix whose sum is to find out. Medium Accuracy: 32. Range query for Largest Sum Contiguous Subarray. Sub-array A is greater than sub-array B if sum (A) > sum (B). Beginner's DSA Sheet; Love Babbar Sheet; Top 50 Array Problems; Top 50 String Problems; Top 50 DP Problems; Top 50 Graph Problems; Top 50 Tree Problems; Contests. First we store the prefix sum in a separate array so that any subarray sum can be calculated in constant time. In case of multiple subarrays, return the subarray indexes which come first on moving from left to right. Jobs. There are as many such arrays as the length of the window. Return -1 if there are no cycles. The task is to return a linked list that represents the sum of these two numbers. 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. A brute force approach is to store all the contiguous sums in another array and sort it and print the k-th largest. Return -1 if it is not possible. Auxiliary Space: O (V+E) If you like GeeksforGeeks and would like to contribute, you can also write an article using write. 1st case : If sum is less than k, increment end by one position. This is the best place to expand your knowledge and get prepared for your next interview. So, the minimum spanning tree formed will be having (9 – 1) = 8 edges. Sum of array elements possible by appending arr [i] / K to the end of the array K times for array elements divisible by K. An empty tree is also a S. Example 1: Input: N = 2, S = 9 Output: 90 Explaination: It is the biggest number with sum of digits equals to 9. Note: edges [i] is defined as u, v and weight. Given head, the head of a singly linked list, find if the linked list is circular or not. Solution. Find Complete Code at GeeksforGeeks Article: Like, Comment and Share the Video among you. To convert, we do following. Time Complexity: O (n^2) The worst-case time complexity of the above solution is still O (n 2 ). Your task: You dont need to read input or print anything. So in the result vector, we will add arr [currIndex]. 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. Approximate Algorithm for Vertex Cover: 1) Initialize the result as {} 2) Consider a set of all edges in given graph. Given two decimal numbers represented by two linked lists of size N and M respectively. An interview-centric & placement-preparation course designed to prepare you for the role of SDE for product and service-based companies. Prefix Sum 136. Example. You don't need to read input or print anything. The graph is represented as an adjacency matrix of size n*n. For example, if input is {1, 101, 2, 3, 100, 4, 5}, then output should be 106 (1 + 2 + 3 + 100), if the input array is {3, 4, 5, 10}, then output should be 22 (3 + 4 + 5 + 10) and if the input. Maximum size of subset of given array such that a triangle can be formed by any three integers as the sides of the triangle. Relax all the edges (u,v,weight) N-1 times as per the below condition: dist [v] = minimum (dist [v], distance. P: If ‘a’ is the initial term and ‘d’ is a common difference. Every node has been assigned a given value. Recommended: Please solve it on “ PRACTICE ” first, before moving on to the solution. Minimize sum of product of same-indexed elements of two arrays by reversing a subarray of one of the two arrays. The idea is to reduce the problem to 1 D array. Approach: The is to do a Breadth First Traversal (BFS) for a graph. + 3 more. e. Input: source = 0, destination = 4. Let see an example. Explanation: Optimal subarrays are {5, -2, 3} and {5} with maximum sum = 11. Examples: Input : 12345 Output : 15 Input : 45632 Output :20. Maximize array product by changing any array element arr [i] to (-1)*arr [i] - 1 any number of times. Move both slow and fast pointers one node at a time. Explanation: Sum of both the pairs {7, 9} and {9, 8} are greater. We need to find the maximum length of cable between any two cities for given city map. The solution is based on the fact that “ If a graph has no odd length cycle then it must be Bipartite, i. Nodes are labeled from 0 to n-1, the task is to check if it contains a negative weight cycle or not. entry/exit points are unidirectional doors like valves). Sum of upper triangle and lower triangle. The sum of nodes considering -4 as the root of subtree is -4 = -4. 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 task is to complete the function maxSubarraySum() which takes Arr[] and N as input parameters and returns the sum of subarray with maximum sum. , we use Topological Sorting . Note: Here Size is equal to the number of nodes in the subtree. Run a loop and insert the first K elements in the deque. If e has one end in X and the other. Approach: The Idea is to compute the indices of the largest three elements in the array. Practice. Example 1: Input: n = 3 arr = [1,2,3] Output: [1,2] Explanation: Largest Divisble Subset is [1,2]. Example 1: Input: N = 5, arr [] = {1, 101, 2, 3, 100} Output: 106 Explanation: The maximum sum of a increasing sequence is obtained from {1, 2, 3, 100}, Example 2: POTD link ::: you like this content please hit like and subscribe. The task is to calculate the sum of the largest sum cycle in the maze(Sum of a cycle is the sum of node number of all nodes in that cycle). Practice. Here f z = 3 >= K. e. The idea is similar to the previous post. Level up your coding skills and quickly land a job. Examples: {-10, 2, -1, 5}, {-2, 4, -1, 4, -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). Maximum path sum in a triangle. Every node has been assigned a given value. World Cup Hack-A-Thon; GFG Weekly Coding Contest; Job-A-Thon: Hiring. Given a weighted directed graph with n nodes and m edges. 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. The task is to reverse every k nodes (where k is an input to the function) in the linked list. A sheet that covers almost every concept of Data Structures and Algorithms. Where trace (A) is the sum of the elements on the. Your Task: You don't need to read or print anything. Expected Time Complexity: O (Log N) Expected Space Complexity: O (1) Constraints: 1 <= N <= 100000. next is the next greater element for the popped element. Example 1: Input: Output: 1 Explanation: 3 -> 3 is a cycle Example 2: Input: Output: 0 Explanation: no cycle in the graph. Largest possible 5 digit number is 93000 with sum 12. Given the 2 nodes. A linked list is called circular if it not NULL terminated and all nodes are connected in the form of a cycle. Steps to implement-. Your task is to complete the function kthSmallest () which takes the array. 2. Practice. Example 1: Input: N = 5 Arr[]. A Tree is BST if the following is true for every node x. Now we will use Kadane’s Algorithm to find the maximum subarray sum and minimum subarray sum. INPUT FORMAT First line has the number of cells N Second line has list of N. Find elements in given Array that are a factor of sum of remaining elements. ; Increase the. Note: Subarray here means a continuous part of the array. Follow the steps below to solve the problem: Store all the edges corresponding to all the unique weight in a map M. Your task is to complete the function isCyclic () which takes the integer V denoting the number of vertices and adjacency list adj as input parameters and returns a. Example: Given an array of integers of size ‘n’, Our aim is to calculate the maximum sum of ‘k’ consecutive elements in the array. Largest number with given sum | Practice | GeeksforGeeks. Clearly, if this is the max sum formed then the. In that case you must submit your solution again to maintain the streak and earn a Geek Bit. The idea is similar to linear time solution for shortest path in a directed acyclic graph. Expected Time Complexity: O (n*m) Expected Auxiliary Space: O (n*m) Constraints: 1 ≤ n, m ≤ 500. Every cell of the maze contains these numbers 1, 2 or 3. Third line for each testcase contains two cell numbers whose nearest meeting cell needs to be found. Hence, print the value 2. Course Description. Naive Approach: The naive approach is to generate all the possible subarray and print that subarray which has maximum sum. Given a singly linked list of size N of integers. Kth largest sum contiguous subarray using Prefix Sum and Sorting approach: The basic idea behind the Prefix Sum and Sorting approach is to create a prefix sum. I used a dfs on graph approach in. Menu. The task is to find the sum of weights of the edges of the Minimum Spanning Tree. For example below graph have 2 triangles in it. In every topic, you can start from questions according to your comfort level. Solved 3 Linked list problems using Recursion and two-pointers approach:. For subsets found to be not containing K consecutive array elements, calculate their sum. 5xMethods And Algorithms Used1. Assume that every graph with no odd cycles and at most q edges is bipartite and let G be a graph with q + 1 edges and with no odd cycles. 89% Submissions: 109K+ Points: 4. A cell in the given maze has a value '-1' if it is a blockage or dead-end, else 0. Your task is to return maximum score possible in the given array Arr. 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. Run two for loops to find all subarray. Console. The length of this cycle is 3, so 3 is returned. Example 2: Input: N = 3, S = 20 Output: 992 Explaination: It is the biggest. Maximum sub-array is defined in terms of the sum of the elements in the sub-array. Two Sum Using remainders of the elements less than x: The idea is to count the elements with remainders when divided by x, i. 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. The task is to check if the given linked list is palindrome or not. Input : arr [] = {10, 1, 3, 15, 30, 40, 4, 50, 2, 1} K = 3 Output : 3 15 30 40 4 50. a strictly increasing. cpp. Now let’s see how the two-pointer technique works. Can you solve this real interview question? Binary Tree Maximum Path Sum - Level up your coding skills and quickly land a job. Expected Time Complexity: O (n*m) Expected Space Compelxity: O (n) Constraints: 1 <= n <= 100. Contests. e at currIndex = 4). NOTE: If there is a tie, then compare with segment's length and return segment which has maximum length. Time Complexity: O(N 2) Auxiliary Space: O(1) Efficient Approach: We can optimize the above approach by using the below steps. Level up your coding skills and quickly land a job. Find the maximum for each and every contiguous subarray of size K. Find Complete Code at GeeksforGeeks Article: Like, Comment and Share the Video among you. Print out the node having the maximum number of inorder weights. Given a matrix of size M x N, there are large number of queries to find submatrix sums. Example 1: Input: 1 / 4 4 / 6. Note: The cells are named with an integer value from 0 to N-1. Largest Sum Cycle. Based on the above idea, for the new array, median of any subarray to be greater than or equal to X, its sum of elements. Find the length of the longest sub-sequence such that elements in the subsequence are consecutive integers, the consecutive numbers can be in any order. Below is the complete algorithm for doing this: 1) Initialize the first as 0 (i. All unique combinations whose sum equals to K (Combination Sum II) Shortest possible combination of two strings. Find three element from given three arrays such that their sum is X | Set 2. The idea is to check if R is odd or even and calculate Kth largest odd number accordingly. 4) Return result. From subarray Arr [i. Find length of the longest subarray containing atmost two distinct integers. ans = max (max_so_far, sum – min_so_far) = (12, 11 – (-11)) = 22. Maximum sum subarray having sum less than or equal to given sum. 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. This is the best place to expand your knowledge and get prepared for your next interview. Function Description: The sum of the largest sum cycle in the maze. Note: The above code assumes that there is at least one positive element in the array. Given adjacency list adj as input parameters . Check for all the values in the array:- If min_so_far is equaled to sum, i. We need to find the max sum of sums of M subarrays of size K (non-overlapping) in the array. Sub-array A is greater than sub-array B if sum (A) > sum (B). Sum of products of all combination taken (1 to n) at. 2nd cycle: 5 6 10 9. 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. Find the missing element. Given an array A[] of size N, return length of the longest subarray of non- negative integers. create an empty vector 'edge' of. . If any of the subarray with size K has the sum equal to the given sum then print YES otherwise print NO. The two sub-arrays are [1, 2, 5] [2, 3]. Run two loops to find all subarrays. After filling the array, we use the sliding window concept of size k. Find the total count of sub-arrays having their sum equal to 0. If there is no cycle in the graph then return -1. If we calculate A 3, then the number of triangles in Undirected Graph is equal to trace (A 3) / 6. 0 You are given a maze with N cells. Follow the given steps to solve the problem: Create a Hashmap ( hm) to store a key-value pair, i.