beingmartinbmc

def luhn(a):
    def get_odd(a):
        x = 0
        while a > 0:
            s = a % 10
            s = 2*s
            if s > 9:
                s = (s-1) % 9 + 1
            x += s
            a //= 100

beingmartinbmc

import java.util.Stack;

public class BalancedParantheses {
    private boolean isOpeningSymbol(char a){
        return a == '(' || a == '{' || a == '[';
    }
	
    private char getClosingSymbol(char a){
        if(a == '(') return ')';
        if(a == '{') return '}';

beingmartinbmc

import java.util.Stack;

public class SortStack {

    private static Stack<Integer> sortStack(Stack<Integer> stack){
        Stack<Integer> helperStack = new Stack<>();

        while(!stack.isEmpty()){
            int current = stack.pop();
            while(!helperStack.isEmpty() && current < helperStack.peek())

beingmartinbmc

import java.util.Collections;
import java.util.HashSet;
import java.util.Vector;

public class DFS {
    private Vector<Integer> discoveredTime;
    private Vector<Integer> finishedTime;

    private Vector<Integer> parent;
    private Vector<String> colour;

beingmartinbmc

import java.util.*;

public class BFS{
    private Vector<Integer> distance;
    private Vector<Integer> parent;
    private Vector<String> colour;
    private Vector<Integer> g[];
    private int vertexCount;
    private HashSet<Integer> vertices;

beingmartinbmc

import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;

public class Traversals {

    private ArrayList<Integer> G[];
    private boolean visited[];

beingmartinbmc

private static HashMap<Integer, Integer> lookup = new HashMap<>();
private static int fib(int n){
        if(lookup.containsKey(n))
            return lookup.get(n);
        else{
            if(n <= 1)
                lookup.put(n, n);
            else{
                int k = (n & 1) == 1? (n+1)/2 : n/2;
                if((n&1) == 1)

beingmartinbmc

#include "stdio.h"
#include "stdlib.h"
#define pf printf
#define sf scanf
typedef struct tree
{
    int data;
    struct tree *left,*right;
}node,*nodeptr;
nodeptr tree=NULL;

beingmartinbmc

__author__ = 'Ankit Sharma'


class Stack:
    """ This is an easy implementation of a stack """

    def __init__(self):
        self.stack = []

    def push(self, some_value):

beingmartinbmc

n = (int(input('Enter number of queens\n')))
board = [[0] * n for i in range(n)]


def is_safe(row, col):
    for i in range(n):
        if board[row][i] == 1 or board[i][col] == 1:
            return False
    for i in range(n):
        for j in range(n):