ProDeveloperTutorial

Given an integer n, return all distinct solutions to the n-queens puzzle. Each solution contains a distinct board configuration of the…

The word can be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those horizontally or…

Note: The solution set must not contain duplicate subsets. Example: Input: nums = [1,2,3] Output: [ [3], [1], [2], [1,2,3], [1,3], [2,3],…

Example: Input: n = 4, k = 2 Output: [ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4], ] This problem can be solved in 2 ways. 1. Iterative 2.…

We can solve this by many different ways. Solution 1  Will be counting all the number of 0’s, 1’s and 2’s. Then insert those number of…

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in each row are…

Example 1: Input: [ [1,1,1], [1,0,1], [1,1,1] ] Output: [ [1,0,1], [0,0,0], [1,0,1] ] Example 2: Input: [ [0,1,2,0], [3,4,5,2], [1,3,1,5] ]…

Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents…

Given an absolute path for a file (Unix-style), simplify it. For example, path = “/home/”, => “/home” path =…

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along…