Skip to content

Instantly share code, notes, and snippets.

View mgechev's full-sized avatar
👷‍♂️
Making web development easier

Minko Gechev mgechev

👷‍♂️
Making web development easier
View GitHub Profile

Black letters on yellow background will be the best combination (most readable) for the children. Age of the child It's important whether it is right or left handed

Games

  • Element from a letter, you should guess, which is the letter
  • Text with marked end and beginning of a line
  • Mark the repetitive words in a sentence
  • Recognize the digits in a text, mark the same letters, mark only the uppercase letters...

OS X Screencast to animated GIF

This gist shows how to create a GIF screencast using only free OS X tools: QuickTime, ffmpeg, and gifsicle.

Screencapture GIF

Instructions

To capture the video (filesize: 19MB), using the free "QuickTime Player" application:

Софтуерен консултант, разработчик и трейнър на свободна практика. В момента, заедно с LearnCapital, се занимава с разработка на Интернет приложения, включващи комуникации в реално време. Лектор в курса "JavaScript за напреднали" във ФМИ на СУ и асистент в няколко курса свързани с методологии в софтуерното инжеренрство. През свободното си време поддържа проектите си с отворен код, интересува се от математика и спортува.

@mgechev
mgechev / dijkstra.js
Created November 3, 2014 09:27
Dijkstra's shortest path algorithm
/*
graph[i][j] indicates the distance between vertex i and vertex j
basically a single entry in this matrix is an edge in the graph.
When graph[i][j] is Infinity, this means that there is no edge between
vertexes i and j.
*/
var graph = [[0, 1, Infinity, 6, Infinity, 7, Infinity],
function getElementsByTagName(root, tagName) {
tagName = tagName.toUpperCase();
var stack = [root],
result = [],
current, node;
while (stack.length) {
current = stack.pop();
for (var i = 0; i < current.children.length; i += 1) {
node = current.children[i];
if (node.tagName.toUpperCase() === tagName) {
@mgechev
mgechev / top-users.markdown
Created January 7, 2015 09:48
Top GitHub Users

Most active GitHub users (git.io/top)

The count of contributions (summary of Pull Requests, opened issues and commits) to public repos at GitHub.com from Tue, 07 Jan 2014 09:44:59 GMT till Wed, 07 Jan 2015 09:44:59 GMT.

Only first 1000 GitHub users according to the count of followers are taken. This is because of limitations of GitHub search. Sorting algo in pseudocode:

githubUsers
 .filter((user) -&gt; user.followers &gt; 350)
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<title>JS Bin</title>
</head>
<body>
<script id="jsbin-javascript">
var arr = [1, 2, 3, 4];

Most active GitHub users (git.io/top)

The count of contributions (summary of Pull Requests, opened issues and commits) to public repos at GitHub.com from Tue, 11 Mar 2014 00:00:46 GMT till Wed, 11 Mar 2015 00:00:46 GMT.

Only first 1000 GitHub users according to the count of followers are taken. This is because of limitations of GitHub search. Sorting algo in pseudocode:

githubUsers
 .filter((user) -&gt; user.followers &gt; 373)
@mgechev
mgechev / 02.03.2011-Exercise2-Unit2.sql
Created March 2, 2011 11:02
02.03.2011 - Exercise2 - Unit 2
SET SCHEMA PC;
--Напишете заявка, която извежда производителя и честотата на тези лаптопи с размер на диска поне 9 GB
SELECT SPEED, PRODUCT.MAKER
FROM LAPTOP, PRODUCT
WHERE HD <= 9 AND PRODUCT.MODEL = LAPTOP.MODEL;
--Напишете заявка, която извежда номер на модел и цена на всички продукти, произведени от производител с име ‘B’
SELECT P.PRICE, P.MODEL
FROM PRODUCT, PRINTER AS P