As you may already know I really, really like LINQ. One day I'll probably join together all my posts about this incredible featureand release pretty neat compendium/one-oh-one about this great feature. But while I'm not sitting and joining every post from this blog that have word "LINQ" in it into one, big pile, let's talk a bit about joining and grouping collections in LINQ.

In the previous post about Topshelf and Quartz.NET I mentioned that there is a chance to configure the inversion of control container instead of manually pointing which implementation we want to use. In this post, I will explain how to do just that, using a few popular inversion of control containers – Ninject and StructureMap. If you prefer any other container, please let me know. I’ll do my best to include it here. Plain projec...

For the last 2 years Angular Team at Google, with huge support of the community, has been working on a new Angular framework. It has been completely rewritten with better performance and ready to use even outside the browser. In this article I want to introduce you to the basics of Angular 2+; we will build a small web application using angular-cli tool.

Programowanie współbieżne – jeden z najbardziej zaawansowanych tematów programistycznych. Z jednej strony programowanie równoległe jest już standardem, z którym mają styczność (może w pewnym stopniu nieświadomie) nawet początkujący programiści. Z drugiej strony nadal tylko niewielu programistów potrafi pisać poprawny oraz efektywny kod współbieżny.

Aggregate is one of the most fun and powerful methods in LINQ. Sadly it's also of of the most underused and "scary" ones. I hope that after reading this post you will understand Aggregate a bit more, know when to use it and won't be afraid of doing so.

Reading time ~5 minutes In my ongoing series on calculating similarities one angle always seemed worth trying, and was pointed out many times on Reddit - use C++ and matrix manipulations. Similarity calculation fits very nicely into matrix representation, and there are algorithms targeting sparse matrix manipulation. So why did I delay it for so long? Because I had other angles I wanted to try and, from the looks of it required significant changes in the existing code base. But since last op...

Reading time ~4 minutes This post is an analysis of a very interesting optimization proposed by Nicholas Frechette in the comments under the previous post. He proposed to use one of the oldest tricks in performance cookbook - divide and conquer. Well, it did not turn out as I expected.Saga Before I go further here are some link to the previous posts on the problem of calculating similarities and then optimizing. This thread grew to a few post. Here are all of them:How I calculate similariti...

The hardest problem on HackerRank, sorted by Max Score and level "Expert" is Separate The Chocolate. It's worth 250 points and the level "Expert" is the highest one. How to solve it?

Reading time ~2 minutes This post was inspired by a discussion on Reddit that followed my previous post In this post, I will cover a suggestion by BelowAverageITGuy that cut down the total execution time by almost one hour. Saga Before I go further here are some link to the previous posts on the problem of calculating similarities and then optimizing it grew to few post. Here are all of them:How I calculate similarities in cookit?How to calculate 17 billion similaritiesIndependent code in ...

Z nieistniejącego jeszcze cyklu: pytania algorytmiczne oraz struktury danych u gigantów doliny krzemowej: Google, Amazon, Microsoft etc. Pamięć podręczna cache to pamięć o bardzo szybkim dostępie, której jest bardzo mało. Tworząc procesor twórcy implementują jeden z algorytmów do zarządzania pamięcią, który decyduje, który element z pamięci ma wylecieć, aby utworzyć miejsce dla nowego elementu.