Search for a command to run...
Articles tagged with #java
Problem You are given an array prices where prices[i] is the price of a given stock on the i<sup>th</sup> day. Find the maximum profit you can achieve. You may complete at most two transactions. Note: You may not engage in multiple transactions simul...
Problem You are given an integer array prices where prices[i] is the price of a given stock on the ith day. On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of the stock at any time. However, you can sell ...
Problem Given a list of accounts where each element accounts[i] is a list of strings, where the first element accounts[i][0] is a name, and the rest of the elements are emails representing emails of the account. Now, we would like to merge these acco...
Spanning Tree A tree in which we have N nodes and N-1 edges and all nodes are reachable from each other. Some of the possible Spannig trees Minimum Spanning Tree A spanning tree where the total sum of all the edges is the smallest possible is call...
Problem You're given a binary tree. Your task is to find the size of the largest subtree within this binary tree that also satisfies the properties of a Binary Search Tree (BST). The size of a subtree is defined as the number of nodes it contains. (l...
Problem Implement the BSTIterator class that represents an iterator over the in-order traversal of a binary search tree (BST): (link) BSTIterator(TreeNode root) Initializes an object of the BSTIterator class. The root of the BST is given as part of ...