PhD OpenCL Challenges

Hi, today I want to show you code samples for OpenCL that may be important when you start with these amazing graphics cards computing (GPU-computing) library. The goal is to make code as good as possible on any platform that supports OpenCL and on GPUs from AMD, Intel, NVidia, Mali on CPUs from AMD, Intel, ARM. All examples are from the Darknet on OpenCL Continue ReadingPhD OpenCL Challenges

Tic Tac Toe

Hello, today I would like to share with yor work done in 2011, the tic tac toe game. It is based on the jQuery and pure JavaScript, so you can see the source code of it. And that is why I will not share separately whole HTML5 JS CSS code here, so let’s play! Enjoy! p ;).

HackerRank Customer Service Capacity

Hi, today I would like to show you how to solve the code puzzle with the time line. Where you have to in O(n) determine how many maximal events happen the same time… I hope you like it ;-). I looked on the Internet and there is no correct solution for this problem in my opinion, so far. So I decided to write on Continue ReadingHackerRank Customer Service Capacity

Binary Tree Visible Nodes Counting

Hi, today I would like to share with you solution of the code puzzle with binary tree. There are 2 trees examples t1 and t2 and your job is to find visible nodes and visible nodes are that are not smaller then all parents. When you go down for t1 tree you can find 4 such visible nodes. And for the second tree there Continue ReadingBinary Tree Visible Nodes Counting