Problem Description Given a directed graph. The task is to do Breadth First Traversal of this graph starting from 0. geeksforgeeks Solution class Solution { // Function to return Bread...

Problem Description You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money. Return the fewest number of coin...

This question is part of NeetCode150 series. Problem Description Given a string s, return the longest palindromic substring in s. leetcode Solution This question is similar to: Longest Palindr...

This question is part of NeetCode150 series. Problem Description Given a string s, return the longest palindromic substring in s. leetcode Solution class Solution { //Time complexity: O(n...

This question is part of NeetCode150 series. Problem Description You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only co...

This question is part of NeetCode150 series. Problem Description You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses ...

This question is part of NeetCode150 series. Problem Description Given an integer array nums, return the length of the longest strictly increasYou are given an integer array cost where cost[i] is...

Problem Description Given an array of positive elements, you have to flip the sign of some of its elements such that the resultant sum of the elements of array should be minimum non-negative(as c...

Problem Description Given a non-empty array nums containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal. l...

Problem Description Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack. In other words, given two integer arrays val[0....