vderyagin

# -*- coding: utf-8 -*-

require 'prime'

def Ring(size)
  Ring.new(size)
end

class Ring
  attr_reader :size

vderyagin

package int_palindrome

func isPalindrome(n int) bool {
	reverse := 0

	for t := n; t > 0; t /= 10 {
		reverse *= 10
		reverse += t % 10
	}

vderyagin

def combinations(s)
  return [s] if s.length == 1

  chars = s.chars.to_a

  chars.each_with_object([]) do |ch, cs|
    rest = chars.drop(chars.find_index(ch) + 1).join
    cs << ch
    combinations(rest).each do |comb|
      cs << (ch + comb)

vderyagin

def permutations(s)
  return [s] if s.length == 1

  chars = s.chars.to_a

  chars.each_with_object([]) do |ch, ps|
    rest = chars.reject { |c| c.equal? ch }.join
    permutations(rest).each do |perm|
      ps << (ch + perm)
    end

vderyagin

package atoi_itoa

import (
	"fmt"
	"regexp"
)

func atoi(s string) (int, error) {
	re := regexp.MustCompile(`^-?\d+$`)

vderyagin

package sorted_linked_list

import (
	"bytes"
	"fmt"
)

type list struct {
	head *node
}

vderyagin

package hash_table

import "fmt"

type bucket struct {
	head *entry
}

type entry struct {
	key   string

vderyagin

package stack

import (
	"bytes"
	"errors"
	"fmt"
	"sync"
)

type node struct {

vderyagin

package queue

import (
	"bytes"
	"errors"
	"fmt"
	"sync"
)

type node struct {

vderyagin

package bag

import (
	"bytes"
	"errors"
	"fmt"
)

type bag struct {
	m    map[interface{}]int