Skip to content

Instantly share code, notes, and snippets.

View ledrui's full-sized avatar
🎯
Focusing

Iliass ledrui

🎯
Focusing
17 followers · 19 following
View GitHub Profile
@ledrui
ledrui / bitmap_pattern_matcher.py
Created May 22, 2018 21:42
def getMatch(bitmapQ, bitmapT):
"""
if bitmapT exist in bitmapQ
Return the coordinates of the match
or therewise return None
"""
n = len(bitmapQ)
m = len(bitmapQ[0])
if len(bitmapT) > n or len(bitmapT[0]) > m:
@ledrui
ledrui / pocker_hand.py
Created February 16, 2018 23:10
# card mapped to digits from 1 to 13
# A,2,3,4,5,6,7,8,9,10,J, Q, K
# [1 2 3 4 5 6 7 8 9 10 11 12 13]
# [1,2,2,4]
# [k, 2, k, 2, 2] # <<<<<<<<<
# [13, 2,13,2, 2]
@ledrui
ledrui / camera-real-time.py
Created February 3, 2018 21:08
import cv2
import sys
import tensorflow as tf
import numpy as np
import time
colors = [tuple(255 * np.random.rand(3)) for _ in range(10)]
capture = cv2.VideoCapture(0)
@ledrui
ledrui / Iliass.md
Created January 26, 2018 00:32

Iliass Tiendrebeogo

contact: tiiliass@gmail.com 425 287 4279 Github

EDUCATION

Central Washington University Master of Science in Computer Science 2015-2017

University of Ouaga Bachelor of Science in Computer Science 2014

@ledrui
ledrui / keybase.md
Created October 28, 2017 20:57

Keybase proof

I hereby claim:

  • I am ledrui on github.
  • I am iliass (https://keybase.io/iliass) on keybase.
  • I have a public key ASDM4u1QcRruae5vzyCqXpxln4zrMQvkpiQZNlQi0V_CCAo

To claim this, I am signing this object:

@ledrui
ledrui / combinations.py
Created November 11, 2015 22:13
Write a method combinations which takes two arrays of strings and returns an array with all of the combinations of the items in them, listing the first items first.
def combinations(arr1, arr2):
finalArray = []
for i in xrange(len(arr1)):
for j in xrange(len(arr2)):
finalArray.append(arr1[i]+arr2[j])
#print arr1[i]+arr2[j]
print finalArray
@ledrui
ledrui / The Technical Interview Cheat Sheet.md
Created November 7, 2015 08:15 — forked from tsiege/The Technical Interview Cheat Sheet.md
This is my technical interview cheat sheet. Feel free to fork it or do whatever you want with it. PLEASE let me know if there are any errors or if anything crucial is missing. I will add more links soon.

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.
@ledrui
ledrui / Reverse.java
Last active October 30, 2015 08:32
This method reverse a given string
public static String reverse(String s)
{
int len = s.length(), last = len -1;
char cArray = s.toCharArray();
for (int i = 0; i< len/2; i++){
// swiping symetrical elements
char c = cArray[i];
cArray[i] = cArray[last - i];
cArray[last - i] = c;
}
@ledrui
ledrui / HasLetter.java
Created October 28, 2015 06:35
The method hasLetter checks if a given letter is in a word. If so it return its index, otherwise it retrun -1
public class HasLetter{
public static int hasLetter(String word, char letter){
for (int i=0; i < word.length(); i++){
// comparison
if(word.charAt(i)==letter){
return i;
}
}
return -1;
}
@ledrui
ledrui / index.js
Created August 26, 2015 18:19
index.js from my address-book project
var Command = require('./command')
var handleResult = function(err){
if (err) { console.log("error") }
else{
console.log("Ok! Command ran successfully!")
}
}
Command.add(handleResult)