Skip to content

Instantly share code, notes, and snippets.

View hrishikesh-mishra's full-sized avatar

Hrishikesh Mishra hrishikesh-mishra

View GitHub Profile
@hrishikesh-mishra
hrishikesh-mishra / LargestRectangleHistogram.java
Created March 14, 2017 12:29
Given an array with heights of rectangle (assuming width is 1), we need to find the largest rectangle area possible.
package com.hrishikesh.ns.stack;
/**
* Problem Statement:
* ;
* Given an array with heights of rectangle (assuming width is 1), we need
* to find the largest rectangle area possible.
* ;
*
* @author hrishikesh.mishra
@hrishikesh-mishra
hrishikesh-mishra / FixedSizeArrayQueue.java
Created March 14, 2017 12:29
Fixed size array queue using circular array to optimize memory.
package com.hrishikesh.ns.queue;
import java.util.StringJoiner;
/**
* Problem
* Fixed size array queue using circular array to optimize memory.
*
* @author hrishikesh.mishra
* @link http://hrishikeshmishra.com/fixed-size-array-based-queue/
@hrishikesh-mishra
hrishikesh-mishra / DynamicSizeArrayQueue.java
Created March 14, 2017 12:29
Dynamic size array based queue.
package com.hrishikesh.ns.queue;
import java.util.StringJoiner;
/**
* Problem:
* Dynamic size array based queue.
*
* @author hrishikesh.mishra
* @link http://hrishikeshmishra.com/dynamic-size-array-based-queue/
package com.hrishikesh.narashima.ch5queue;
import com.hrishikesh.narashima.ch4stack.ListNode;
import java.util.Objects;
import java.util.StringJoiner;
/**
*
package com.hrishikesh.ns.queue;
import com.hrishikesh.ns.stack.ListNode;
import java.util.Objects;
import java.util.StringJoiner;
/**
* Problem:
@hrishikesh-mishra
hrishikesh-mishra / LinkedStack.java
Created March 14, 2017 12:28
Linked Stack implementation
package com.hrishikesh.ns.stack;
import java.util.Objects;
import java.util.StringJoiner;
/**
* Problem:
* Linked Stack implementation
*
@hrishikesh-mishra
hrishikesh-mishra / DoubleQueueStack.java
Created March 14, 2017 12:28
Implement queue using two stack
package com.hrishikesh.narashima.ch5queue;
import com.hrishikesh.narashima.ch4stack.Stack;
/**
* <p>
* Implement queue using two stack
*
* </p>
* Created by hrishikesh.mishra
@hrishikesh-mishra
hrishikesh-mishra / DoubleStackQueue.java
Created March 14, 2017 12:28
DoubleStackQueue.java
package com.hrishikesh.narashima.ch5queue;
import com.hrishikesh.narashima.ch4stack.LinkedStack;
import com.hrishikesh.narashima.ch4stack.Stack;
/**
* <p>
* Implement queue using double stack.
*
@hrishikesh-mishra
hrishikesh-mishra / BinaryDeepestNodeFinder.java
Created March 14, 2017 12:28
Find deepest node of binary tree
package com.hrishikesh.ns.tree;
import com.hrishikesh.ns.queue.LinkedQueue;
import com.hrishikesh.ns.queue.Queue;
import java.util.Objects;
/**
* Problem:
* Find deepest node of binary tree
@hrishikesh-mishra
hrishikesh-mishra / BinarySearchTree.java
Created March 14, 2017 12:28
Binary Search Tree ADT
package com.hrishikesh.ns.tree;
/**
* Generate binary tree from sorted array
*
* @author hrishikesh.mishra
* @link http://hrishikeshmishra.com/generate-binary-tree-from-sorted-array/
*/
public class BinarySearchTreeGenerator {