Number of Good Pairs
Problem Statement – Given an array of integers nums, return the number of good pairs. A pair (i, j) is called good if nums[i] == nums[j] and i < j Logic
Category Problem of Day
How to Find Minimum Depth of Binary Tree in Java
Question – Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. Logic to solve the minimum depth of the…
Transpose of Matrix Java
Question – Write a Program to find the transpose of a square matrix of size N*N. Transpose of a matrix is obtained by changing rows to columns and columns to rows. Logic – Interchange transpose matrix, rows and columns Let’s…
