Skip to content

Instantly share code, notes, and snippets.

@flexelem
flexelem / QueueWithTwoStack.java
Created May 4, 2014
Queue implementation with using two stacks
View QueueWithTwoStack.java
import java.util.NoSuchElementException;
import java.util.Stack;
/**
* CLRS - Introduction to Algorithms Ex.10.1-6
*
* Show how to implement a queue using two stacks. Analyze the running time of the queue operations
*
* */
public class QueueWithTwoStack {
@flexelem
flexelem / StackWithTwoQueue.java
Created May 4, 2014
Implement a stack using two queues
View StackWithTwoQueue.java
import java.util.LinkedList;
import java.util.NoSuchElementException;
import java.util.Queue;
/**
* Show how to implement a stack using two queues. Analyze the running time of the queue operations.
*
*/
public class StackWithTwoQueue {
@flexelem
flexelem / CountConnectedComponents.java
Created May 11, 2014
Compute the number of connected components of an undirected graph
View CountConnectedComponents.java
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;
/**
* This class will compute the number of connected components of an un-directed graph. If graph is fully connected than it will return 1.
*
* @author buraktas
*
*/
@flexelem
flexelem / DFSNonRecursiveTest.java
Created May 18, 2014
Non-Recursive DFS implementation by using a Stack
View DFSNonRecursiveTest.java
package graph.search.dfs;
import static org.junit.Assert.assertEquals;
import graph.entity.Vertex;
import java.util.ArrayList;
import java.util.Arrays;
import org.junit.Before;
import org.junit.Test;
@flexelem
flexelem / BinarySearchTree.java
Last active Aug 29, 2015
Binary Search Tree implementation
View BinarySearchTree.java
public class BinarySearchTree {
private Node root;
public BinarySearchTree() {
this.root = null;
}
public BinarySearchTree(Node root) {
@flexelem
flexelem / FindNextGreatestGivenArray.java
Last active Aug 29, 2015
Given an array of number find the next greater no in the right of each element.
View FindNextGreatestGivenArray.java
import java.util.Stack;
public class FindNextGreatestGivenArray {
// works in O(n*n)
public int[] findNextGreatestNumbers(int[] numbers) {
if (numbers == null) {
throw new IllegalArgumentException("Given array is null");
}
@flexelem
flexelem / ReverseLinkedListKSizeSlots.java
Created Jun 13, 2014
Reverse a linked list by given K size slots with recursion
View ReverseLinkedListKSizeSlots.java
public class ReverseLinkedListKSizeSlots {
public Node reverseRecursion(Node root, int k) {
Node current = root;
Node prev = null;
Node next = null;
int count = 0;
while (current != null && count < k) {
@flexelem
flexelem / LinkedList.java
Created Jun 13, 2014
Reverse a LinkedList
View LinkedList.java
public class LinkedList {
public class Node {
int data;
Node next;
public Node(int item) {
this.data = item;
@flexelem
flexelem / LinkedList.java
Last active Aug 29, 2015
reverse a LinkedList by k size slots with using a stack
View LinkedList.java
public class LinkedList {
public class Node {
int data;
Node next;
public Node(int item) {
this.data = item;
@flexelem
flexelem / Quicksort.java
Last active Aug 29, 2015
Quicksort algorithm in java
View Quicksort.java
import java.util.Random;
public class RandomizedQuickSort {
public void quickSort(int[] numbers, int low, int high) {
if (low < high) {
// select pivot randomly
int q = randomizedPartition(numbers, low, high);