Tec Bar » Algorithms https://www.tecbar.net Tue, 19 Dec 2017 20:49:54 +0000 en-US hourly 1 http://wordpress.org/?v=4.1 Jump Game II https://www.tecbar.net/jump-game-ii/ https://www.tecbar.net/jump-game-ii/#comments Tue, 06 Oct 2015 22:43:06 +0000 http://www.tecbar.net/?p=1056 Problem description: Level: medium Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal is to reach the … Continue reading →

The post Jump Game II appeared first on Tec Bar.

]]> https://www.tecbar.net/jump-game-ii/feed/ 0 Jump Game https://www.tecbar.net/jump-game/ https://www.tecbar.net/jump-game/#comments Tue, 06 Oct 2015 22:17:55 +0000 http://www.tecbar.net/?p=1050 Problem Description: Level: medium Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine if you are able to … Continue reading →

The post Jump Game appeared first on Tec Bar.

]]> https://www.tecbar.net/jump-game/feed/ 0 Climbing Stairs https://www.tecbar.net/climbing-stairs/ https://www.tecbar.net/climbing-stairs/#comments Mon, 05 Oct 2015 01:17:43 +0000 http://www.tecbar.net/?p=1032 Problem description Level: easy You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? … Continue reading →

The post Climbing Stairs appeared first on Tec Bar.

]]> https://www.tecbar.net/climbing-stairs/feed/ 0 Dynamic Programming Elements https://www.tecbar.net/dynamic-programming-elements/ https://www.tecbar.net/dynamic-programming-elements/#comments Sun, 04 Oct 2015 19:49:02 +0000 http://www.tecbar.net/?p=1018 What is Dynamic Programming? Dynamic Programming (DP) is a method for solving a complex problem by breaking it down into a collection of simpler subproblems in a recursive manner. DP is an algorithmic technique which is usually based on a … Continue reading →

The post Dynamic Programming Elements appeared first on Tec Bar.

]]> https://www.tecbar.net/dynamic-programming-elements/feed/ 0 Triangle problem https://www.tecbar.net/triangle-problem/ https://www.tecbar.net/triangle-problem/#comments Fri, 02 Oct 2015 06:18:23 +0000 http://www.tecbar.net/?p=1004 Problem description: Level: easy Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. Example For example, given the following triangle [crayon-69f0360c99e0c843917611/] The minimum path sum … Continue reading →

The post Triangle problem appeared first on Tec Bar.

]]> https://www.tecbar.net/triangle-problem/feed/ 0 Binary Tree Level Order Traversal https://www.tecbar.net/binary-tree-level-order-traversal/ https://www.tecbar.net/binary-tree-level-order-traversal/#comments Tue, 29 Sep 2015 23:27:54 +0000 http://www.tecbar.net/?p=981 Problem description Level: medium Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). Example Given binary tree {3,9,20,#,#,15,7}, return its level order traversal as: [ [3], [9,20], [15,7] … Continue reading →

The post Binary Tree Level Order Traversal appeared first on Tec Bar.

]]> https://www.tecbar.net/binary-tree-level-order-traversal/feed/ 0 Lowest Common Ancestor https://www.tecbar.net/lowest-common-ancestor/ https://www.tecbar.net/lowest-common-ancestor/#comments Tue, 29 Sep 2015 22:17:09 +0000 http://www.tecbar.net/?p=975 Problem Description level: medium Given the root and two nodes in a Binary Tree. Find the lowest common ancestor(LCA) of the two nodes. The lowest common ancestor is the node with largest depth which is the ancestor of both nodes. … Continue reading →

The post Lowest Common Ancestor appeared first on Tec Bar.

]]> https://www.tecbar.net/lowest-common-ancestor/feed/ 0 Binary Tree Maximum Path Sum Problem https://www.tecbar.net/binary-tree-maximum-path-sum-problem/ https://www.tecbar.net/binary-tree-maximum-path-sum-problem/#comments Tue, 29 Sep 2015 08:01:23 +0000 http://www.tecbar.net/?p=956 Problem Description Level: medium Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. Example Given the below binary tree: [crayon-69f0360c9a799266648986/] return 6 Analysis: 1. Consider divide and conquer … Continue reading →

The post Binary Tree Maximum Path Sum Problem appeared first on Tec Bar.

]]> https://www.tecbar.net/binary-tree-maximum-path-sum-problem/feed/ 0 Balanced Binary Tree Problem https://www.tecbar.net/balanced-binary-tree-problem/ https://www.tecbar.net/balanced-binary-tree-problem/#comments Fri, 25 Sep 2015 22:21:57 +0000 http://www.tecbar.net/?p=929 Problem description: level: medium Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by … Continue reading →

The post Balanced Binary Tree Problem appeared first on Tec Bar.

]]> https://www.tecbar.net/balanced-binary-tree-problem/feed/ 0 Maximum Depth of Binary Tree Problem https://www.tecbar.net/maximum-depth-of-binary-tree-problem/ https://www.tecbar.net/maximum-depth-of-binary-tree-problem/#comments Fri, 25 Sep 2015 22:06:17 +0000 http://www.tecbar.net/?p=925 Problem Description level: easy Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Have you met this question in … Continue reading →

The post Maximum Depth of Binary Tree Problem appeared first on Tec Bar.

]]> https://www.tecbar.net/maximum-depth-of-binary-tree-problem/feed/ 0