thiago-vieira

class Class:
    pass

x = Class()
x.something = 42
print(x.something)  # 42

gosuri

# Depth-first search (DFS) is an algorithm for traversing or
# searching a tree, tree structure, or graph. One starts at 
# the root (selecting some node as the root in the graph case)
# and explores as far as possible along each branch before backtracking.
#
# A graph can be represented by its adjacency matrix G,
# where G[i][j] == 1 if there is an edge between 
# vertices i and j and 0 otherwise.
#
# Below Graph in diagram http://i.imgur.com/sV1UzUn.png

ryansobol

Originally published in June 2008

When hiring Ruby on Rails programmers, knowing the right questions to ask during an interview was a real challenge for me at first. In 30 minutes or less, it's difficult to get a solid read on a candidate's skill set without looking at code they've previously written. And in the corporate/enterprise world, I often don't have access to their previous work.

To ensure we hired competent ruby developers at my last job, I created a list of 15 ruby questions -- a ruby measuring stick if you will -- to select the cream of the crop that walked through our doors.

What to expect

Candidates will typically give you a range of responses based on their experience and personality. So it's up to you to decide the correctness of their answer.

hylom

%define name mecab
%define version 0.996
%define release el6.4

Summary: Yet Another Part-of-Speech and Morphological
Name: %{name}
Version: %{version}
Release: %{release}
Source0: https://mecab.googlecode.com/files/mecab-%{version}.tar.gz
License: GPL/LGPL/BSD

n-miyo

#!/bin/sh
# 
# Written by Denis Vazhenin <[email protected]>
#
# This script was ported from Debian/Ubuntu version of start script for Gitlab:
# https://raw.github.com/gitlabhq/gitlabhq/master/lib/support/init.d/gitlab
#
# PROVIDE: gitlab
# REQUIRE: NETWORKING SERVERS DAEMON LOGIN
# KEYWORD: shutdown

konklone

# Basically the nginx configuration I use at konklone.com. 
# I check it using https://www.ssllabs.com/ssltest/analyze.html?d=konklone.com
# 
# To provide feedback, please tweet at @konklone or email [email protected].
# Comments on gists don't notify the author. 
# 
# Thanks to WubTheCaptain (https://wubthecaptain.eu) for his help and ciphersuites.
# Thanks to Ilya Grigorik (https://www.igvita.com) for constant inspiration.

server {

sauloperez

# Signal catching
def shut_down
  puts "\nShutting down gracefully..."
  sleep 1
end

puts "I have PID #{Process.pid}"

# Trap ^C 
Signal.trap("INT") { 

freejoe76

#!/usr/bin/env python
from pymarkov import markov
from random import choice
import doctest
import argparse


class Generate:
    """ A song generator. Generate takes input (musician, album) and returns
        a version of that musician's songs.

kevin-smets

Default

Powerlevel10k

le-doude

import java.util.Arrays;

/**
 * Created by le-doude on 14/06/19.
 * <p/>
 * Did you know it is possible to find the longest palindrom in a char sequence in O(N) time.
 * Here is the solution: Manacher's algorithm.
 * http://en.wikipedia.org/wiki/Longest_palindromic_substring
 */
public class ManacherAlgorithm {