Empowering coders, one solution at a time
Empowering coders, one solution at a time
![[Solved] Equal Row and Column Pairs LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Equal-Row-and-Column-Pairs-LeetCode-Contest-Problem.png "[Solved] Equal Row and Column Pairs LeetCode Contest Problem")
Given a 0-indexed n x n integer matrix grid, return the number of pairs (Ri, Cj) such that row Ri and column Cj are equal. A row and column pair is considered equal if they contain the same elements in the same order (i.e. an equal array). Equal Row and Column…
![[Solved] First Letter to Appear Twice LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-First-Letter-to-Appear-Twice-LeetCode-Contest-Problem.png "[Solved] First Letter to Appear Twice LeetCode Contest Problem")
Given a string s consisting of lowercase English letters, return the first letter to appear twice. Note: A letter a appears twice before another letter b if the second occurrence of a is before the second occurrence of b. s will contain at least one letter that appears twice. First Letter to Appear Twice LeetCode Contest…
![[Solved] Number of Increasing Paths in a Grid LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Number-of-Increasing-Paths-in-a-Grid-LeetCode-Contest-Problem.png "[Solved] Number of Increasing Paths in a Grid LeetCode Contest Problem")
Number of Increasing Paths in a Grid: You are given an m x n integer matrix grid, where you can move from a cell to any adjacent cell in all 4 directions. Return the number of strictly increasing paths in the grid such that you can start from any cell and…
![[Solved] Number of People Aware of a Secret LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Number-of-People-Aware-of-a-Secret-LeetCode-Contest-Problem.png "[Solved] Number of People Aware of a Secret LeetCode Contest Problem")
On day 1, one person discovers a secret. Number of People Aware of a Secret: You are given an integer delay, which means that each person will share the secret with a new person every day, starting from delay days after discovering the secret. You are also…
![[Solved] Spiral Matrix IV LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Spiral-Matrix-IV-LeetCode-Contest-Problem.png "[Solved] Spiral Matrix IV LeetCode Contest Problem")
Spiral Matrix IV: You are given two integers m and n, which represent the dimensions of a matrix. You are also given the head of a linked list of integers. Generate an m x n matrix that contains the integers in the linked list presented in spiral order (clockwise), starting…
![[Solved] Decode the Message LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Decode-the-Message-LeetCode-Contest-Problem.png "[Solved] Decode the Message LeetCode Contest Problem")
Decode the Message: You are given the strings key and message, which represent a cipher key and a secret message, respectively. The steps to decode message are as follows: Use the first appearance of all 26 lowercase English letters in key as the order of the substitution table. Align the substitution…
![[Solved] Minimum Score After Removals on a Tree LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Minimum-Score-After-Removals-on-a-Tree-LeetCode-Contest-Problem.png "[Solved] Minimum Score After Removals on a Tree LeetCode Contest Problem")
Minimum Score After Removals on a Tree: There is an undirected connected tree with n nodes labeled from 0 to n – 1 and n – 1 edges. You are given a 0-indexed integer array nums of length n where nums[i] represents the value of the ith node. You are also given a 2D integer array edges of length n -…
![[Solved] Maximum Score Of Spliced Array LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Maximum-Score-Of-Spliced-Array-LeetCode-Contest-Problem.png "[Solved] Maximum Score Of Spliced Array LeetCode Contest Problem")
You are given two 0-indexed integer arrays nums1 and nums2, both of length n. You can choose two integers left and right where 0 <= left <= right < n and swap the subarray nums1[left…right] with the subarray nums2[left…right]. For example, if nums1 = [1,2,3,4,5] and nums2 = [11,12,13,14,15] and you choose left = 1 and right = 2, nums1 becomes [1,12,13,4,5] and nums2 becomes [11,2,3,14,15]. You may choose to apply…
![[Solved] Count Number of Ways to Place Houses LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Count-Number-of-Ways-to-Place-Houses-LeetCode-Contest-Problem.png "[Solved] Count Number of Ways to Place Houses LeetCode Contest Problem")
Count Number of Ways to Place Houses: There is a street with n * 2 plots, where there are n plots on each side of the street. The plots on each side are numbered from 1 to n. On each plot, a house can be placed. Return the…
![[Solved] Check if Matrix Is X-Matrix LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Check-if-Matrix-Is-X-Matrix-LeetCode-Contest-Problem.png "[Solved] Check if Matrix Is X-Matrix LeetCode Contest Problem")
Check if Matrix Is X-Matrix: A square matrix is said to be an X-Matrix if both of the following conditions hold: All the elements in the diagonals of the matrix are non-zero. All other elements are 0. Given a 2D integer array grid of size n x n representing…