ProDeveloperTutorial.com

Your answer should be of greedy approach. You should pack as many words you can in each line. If you cannot fit the whole word, then fill the…

Follow up: Can you solve it without using extra space? Solution Explanation: Take an extra pointer “fast” and assign its starting point to…

Note: Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory? Example 1: Input: [2,2,1]…

Before solving this problem, it is recommended that you go through “valid sudoku” problem. Check if the given board is valid Sudoku or not…

Return all possible palindrome partitioning of s. Example: Input: "aab" Output: [ ["aa","b"],…

You are given 2 words beginWord and endWord. You need to return the number of words, that will transform from beginWord to endWord beginWord =…

You are given an array with the price of the stock on the ith day. You need to max the profit by choosing a day to buy and choosing different…

Given a triangle, find the minimum path sum from top to bottom. In each step you can only move to adjacent numbers on the row below. For…

Determine if a 9×9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules: 1. Each row must…