dotnetomaniak.pl

Strona głównaUżytkownik

http://dynamicallyinvokable.blogspot.com/ | użytkownik

http://dynamicallyinvokable.blogspot.com/
http://dynamicallyinvokable.blogspot.com/
575,09
26 dni, 15 godzin, 5 minut temu
18 stycznia, 2016
dotnetomaniak.pl

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?

[EN]: Dynamic Programming and the hardest problem on HackerRank

This time solving a HackerRank problem, rated as a medium in difficulty. As before, in 5 easy steps.

[EN]: Dynamic Programming in 5 easy steps - Examples - Two Robots

Dynamic Programming series continuation. Something harder this time: Given a set of positive integers, divide it into two sets such that the absolute difference between their sums is minimum. Solution in 5 easy steps!

[EN]: Dynamic Programming in 5 easy steps - Examples - Set partitioning

Dynamic Programming is considered as one of the hardest methods to master, with few examples on the internet. Let's contribute a little with this post series. Today I will cover the first problem - text justification. Credits: MIT lectures.

[EN]: Dynamic Programming in 5 easy steps - Examples - Text Justification

The solution to a previous post - a strange problem related to Cassandra Datastax C# Driver which was happening once in the production environment.

Tagi: Cassandra
Dziel się z innymi:
[EN]: Cassandra Datastax C# Driver problems - solution

Sztuka programowania 126 dni, 22 godziny, 31 minut temu http://dynamicallyinvokable... 33 rozwiń

A post about my journey with fixing nasty Cassandra Datastax C# driver problem. Can you guess the problem source?

Dziel się z innymi:
[EN]: Cassandra Datastax C# Driver problems - NoHostAvailableException

Inne 133 dni, 3 godziny, 21 minut temu http://dynamicallyinvokable... 36 rozwiń

Do you know the trees used in Cassandra, Git, Bitcoin or Lucene? Check this post to find interesting trees, usually not covered on Computer Science lectures.

Tagi: algorithms
Dziel się z innymi:
[EN]: Algorithms and data structures - non-academic trees

Sztuka programowania 143 dni, 3 godziny, 4 minuty temu http://dynamicallyinvokable... 116 rozwiń

What's faster in C#: setting an array by index or a generic list by index? Are you sure you know the correct answer?

Tagi: C# .NET
Dziel się z innymi:
[EN]: The performance of setting T[] vs. List by index

Sztuka programowania 169 dni, 1 godzinę, 15 minut temu http://dynamicallyinvokable... 151 rozwiń

Git can be used from VisualStudio, however it's like saying you drive a car, when actually you play Need for Speed. Unleash the full power of Git, learn to use it. Today, you will get a very useful git alias.

Tagi: git
Dziel się z innymi:
[EN]: Git tips - replace all occurrences of a string in files

Inne 198 dni, 3 godziny, 25 minut temu http://dynamicallyinvokable... 74 rozwiń

How to make the same types (by FullName, AssemblyQualifiedName even GUID) but... different by type1==type2?

Dziel się z innymi:
[EN]: Messing with C# types. Making type1.FullName==type2.FullName, but not type1==type2!

The bad things in Cassandra.

Tagi: Cassandra
Dziel się z innymi:
[EN]: The five stages of coming to terms with Cassandra

Architektura 232 dni, 21 godzin, 26 minut temu http://dynamicallyinvokable... 59 rozwiń

Recently I've designed a mechanism to notify external systems (with which we cooperate) about changes in our system. This, obviously, can be done in multiple ways. Let's look at some considerations on a high level, some questions and how that affects our requirements.

Dziel się z innymi:
[EN]: Specifying requirements for live notification mechanism for systems integration purposes

Architektura 254 dni, 20 godzin, 39 minut temu http://dynamicallyinvokable... 23 rozwiń

How many timers are in the .NET Framework? What assumptions do they have? Which timer would you use for implementing Speculative query execution?

[EN]: Little-known, useful, charming and beautiful algorithms - part 2

Warning: this post won't be about "boring" or "typical" algorithms from Computer Science which we all have learned on studies (like quick sort, merge sort, xxx sort, A*, FFT). Instead, this will be about other little-known, especially USEFUL algorithms, which people working as professional developers should know or heard of. Little-known. ID generation problems are usually overlooked. Database ID's I mean. Ask someone to name ID "types". Well, GUID, newsequentialid...

[EN]: Little-known, useful, charming and beautiful algorithms - part 1

Sztuka programowania 331 dni, 22 godziny, 36 minut temu http://dynamicallyinvokable... 115 rozwiń

This user story is quite simple: there is a guy (me) who likes Star Wars. This guy wants to buy the best tickets available in an IMAX Cinema. The premiere was not so long ago, so a day after the showtimes are updated, the best seats are booked. This guy (also me) is quite lazy, so he doesn't like to check the showtimes manually. Hm... let's do it like pro developers using cutting-edge technologies! How the booking system works? There is this whole UI for selecting seats and so on, however there is ...

[EN] Checking "Star Wars - The Force Awakens" tickets availability with Azure WebJobs, scriptcs and SendGrid

Inne 356 dni, 23 godziny, 21 minut temu http://dynamicallyinvokable... 33 rozwiń

Szkolenia SecurITum

luty

25.

marzec

03.
Wroc#
Wrocław

kwiecień

03.
4developers
Warszawa
Zobacz wszystkie

.NET Developer Days 2015

W tym roku ponownie jak w poprzednim jesteśmy jednym z patronów medialnych konferencji .NET Developer Days. W tym roku jednym z prelegentów będzie Scott Hanselman.  czytaj więcej
2015-07-22

Najaktywniejsi

1

macko (32 816,53)

2

http://pawlos.blo... (31 510,42)

3

pzielinski (27 178,29)

4

gordon_shumway (21 178,87)

5

paduda (20 336,33)

6

psz750 (13 018,14)

7

rroszczyk (10 383,84)

8

Damian (9 011,08)

9

danielplawgo (7 235,99)

10

arek (6 642,85)

11

burczu (6 214,22)

12

PaSkol (5 393,84)

13

lukaszgasior (4 097,38)

14

jj09 (3 418,06)

15

jedmac (3 238,38)

16

http://jakub-flor... (3 224,66)

17

CaMeL (2 954,87)

18

mnikolajuk (2 596,93)

19

lkurzyniec (2 466,12)

20

FutureProcessing (2 460,11)