House Robber II Leetcode Solution

In the “House Robber II” problem, a robber wants to rob money from different houses. The amount of money in the houses is represented through an array. We need to find the maximum sum of money that can be made by adding the elements in a given array according to …

Read more

Minimum Score Triangulation of Polygon Leetcode Solution

Problem statement In the problem ” Minimum Score Triangulation of Polygon” we are given a value array where each element in the array represents the value of a N-sided polygon when labeled in a clockwise direction. Our task is to triangulate the polygon into N-2 triangles. The score to triangulate …

Read more

House Robber Leetcode Solution

Problem Statement In this problem there are houses in a street and House robber has to rob these houses. But the problem is that he can’t rob more than one house successively i.e which are adjacent to each other. Given a list of non-negative integers representing the amount of money …

Read more

Translate »