Skip to content

Instantly share code, notes, and snippets.

View ferhatelmas's full-sized avatar
🚀

ferhat elmas ferhatelmas

🚀
View GitHub Profile

Business Models

Advertising

Models Examples
Display ads Yahoo!
Search ads Google

Architectural Questions

  • Are responsibilities well defined?
  • Are the collaborations well defined?
  • Is coupling minimized?
  • Can you identify potential duplication?
  • Are interface definitions and constraints acceptable?
  • Can modules access needed data—when needed?
#include <stdlib.h>
#include <stdio.h>
#include <stdbool.h>
#include <string.h>
#include <assert.h>
// no actual pointer should have this value, due to alignment
static void* DELETED = (void*)1;
static int TABLE_SIZE = 701;
@ferhatelmas
ferhatelmas / java.md
Last active August 29, 2015 14:10
Find all pairs sum to target where each element is used once. Asked in Bloomberg Junior Software Developer interview.
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;

public class Pair {

    private int l, r;

    public Pair(int l, int r) {
package main
import (
"database/sql"
"errors"
"fmt"
_ "github.com/bmizerany/pq"
"os"
"regexp"
"strings"
""""Create "The Matrix" of binary numbers scrolling vertically in your terminal.
original code adapted from juancarlospaco:
- http://ubuntuforums.org/showpost.php?p=10306676
Inspired by the movie: The Matrix
- Corey Goldberg (2013)
Requires:
#Newbie programmer
def factorial(x):
if x == 0:
return 1
else:
return x * factorial(x - 1)
print factorial(6)
#First year programmer, studied Pascal

tmux shortcuts & cheatsheet

start new:

tmux

start new with session name:

tmux new -s myname