isRuslan

--recurse=yes
--exclude=.git
--exclude=vendor/*
--exclude=node_modules/*
--exclude=db/*
--exclude=log/*
--exclude=.hg
--exclude=log
--exclude=tmp

isRuslan

#!/usr/bin/env bash

set -e

# ctags doesn't handle negative look behinds so instead this script
# strips false positives out of a tags file.

ctags "$@"

FILE="tags"

isRuslan

Studying for a Tech Interview Sucks, so Here's a Cheat Sheet to Help

This list is meant to be a both a quick guide and reference for further research into these topics. It's basically a summary of that comp sci course you never took or forgot about, so there's no way it can cover everything in depth. It also will be available as a gist on Github for everyone to edit and add to.

Data Structure Basics

###Array ####Definition:

• Stores data elements based on an sequential, most commonly 0 based, index.
• Based on tuples from set theory.

isRuslan

import sys

class TrieNode:
    def __init__(self, letter=None, count=0):
        self.letter = letter
        self.count = count
        self.children = {}
        self.is_leaf = False

class Trie:

isRuslan

#include <stdio.h>
#include <assert.h>
#include <stdlib.h>
#include <errno.h>
#include <string.h>

#define MAX_DATA 512
#define MAX_ROWS 100

struct Address {

isRuslan

#include <stdio.h>
#include <fcntl.h>
#include <stdarg.h>
#include <sys/syscall.h>

#define PERMS 0666
#define BUFSIZE 10000

void error(char *fmt, ...){
	va_list args;

isRuslan

#include <stdio.h>
#include <stdlib.h>
#include <strings.h>

#define MAXLINE 100

char *fgets(char *line, int maxline, FILE *fp);

void diff_line(char *a, char *b){
	if(strcmp(a, b) < 0 || strcmp(a, b) > 0){

isRuslan

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

#define MAX_SIZE 100000

int check_string(char s1[], char s2[]);

int main() {

isRuslan

bool findPairs(int arr[], int n)
{
    // Create an empty Hash to store mapping from sum to
    // pair indexes
    map<int, pair<int, int> > Hash;
 
    // Traverse through all possible pairs of arr[]
    for (int i = 0; i < n; ++i)
    {
        for (int j = i + 1; j < n; ++j)

isRuslan

/*

Given the array of IDs, which contains many duplicate integers
and one unique integer, find the unique integer.

*/

// O(n^2): loop in loop
function find_unique_brute (array) {
  var result = null, n = array.length;