Longest Valid Parentheses

gfg-potd

Given a string str consisting of opening and closing parenthesis ‘(‘ and ‘)‘. Find length of the longest valid parenthesis substring. A

Mirror Tree

gfg-potd

Given a Binary Tree, convert it into its mirror.             Examples: Input: 1   / \   2 3 Output: 3

Minimum Cost Of Ropes

gfg-potd

Given an array arr containing the lengths of the different ropes, we need to connect these ropes to form one rope. The cost to

Scroll to Top