itayB

#include <iostream>

#define MAX_SIZE 1000
#define SHIFT MAX_SIZE/2

using namespace std;

bool check(int dx, int dy, int round, bool board[][MAX_SIZE]) {
	cout << "dx="<< dx << ",dy=" << dy << " [" << (dx*round) << "," << (dy*round) << "]" << endl;
	return board[SHIFT + dx*round][SHIFT + dy*round];

itayB

Written by Itay Bittan.

Node.js

Background / Motivation

Our primary product contains Apache web server using c-modules. The reason of choosing Apache initially was due to:

1. License
2. It's popularity - as you can see here.
3. C language support - allow our developers to keep working in their well known environment (the entire system was written in C primarily).

itayB

Written by Itay Bittan.

Interview Questions

Recently I've started to interview - looking for my next work place. I'll share some of the resource I'm using - hopping that could help others in their next challenge as well.

1. The book Cracking The Coding Interview is one of the best resource I've found (search for the PDF version).
2. HIRED IN TECH.
3. Geeks for Geeks - A computer science portal for geeks.

itayB

#include <iostream>
#include <vector>
#include <string>

using namespace std;

void print(vector<int>& v) {
	string s = "[";

	for (int i=0 ; i < v.size() ; i++) {

itayB

#include <iostream>
#include <vector>
#include <string>

using namespace std;

vector<char*>* powerSet(char* src) {
	if (strlen(src) == 0) {
		vector<char*>* ret = new vector<char*>();
		ret->push_back("");

itayB

#include <iostream>
#include <stdexcept>

using namespace std;

template <class T> class CircularArray {
private:
	int size;
	int head;
	T* arr;

itayB

#include <iostream>
#include <limits>

// ref: http://www.geeksforgeeks.org/printing-paths-dijkstras-shortest-path-algorithm/

using namespace std;

#define V 9

/* Recursive print. */

itayB

Latency Comparison Numbers
--------------------------
L1 cache reference                           0.5 ns
Branch mispredict                            5   ns
L2 cache reference                           7   ns                      14x L1 cache
Mutex lock/unlock                           25   ns
Main memory reference                      100   ns                      20x L2 cache, 200x L1 cache
Compress 1K bytes with Zippy             3,000   ns        3 us
Send 1K bytes over 1 Gbps network       10,000   ns       10 us
Read 4K randomly from SSD*             150,000   ns      150 us          ~1GB/sec SSD

itayB

Task: Word Chains

source: International Olympiad in Informatics

A word consists of at least one and at most 75 lowercase letters (from a to z). A list of one or more words is called a chain when each word in that list, except the first, is obtained from the preceding word by appending one or more letters on the right. For instance, the list

i
in
int
integer

itayB

// ref: http://ioinformatics.org/locations/ioi95/contest/tasks/lgame.shtml

// PLEASE NOTICE THAT THIS IS A SOLUTION FOR THE FIRST STEP ONLY !

#include <iostream>
#include <string>
#include <map>
#include <vector>

using namespace std;