Welcome to Rustam's Blog


  • Home

  • Categories

  • About

  • Archives

  • Tags

  • Search

Algorithms, Divide-and-conquer

Posted on 2018-07-29 | In Algorithms |

In a paradigm of divide-and-conquer we solve the problem recursively, applying three basic steps at each level of the recursion:

Read more »

Hackerrank, Swap Nodes[Algo]

Posted on 2018-07-24 | In Competitive Programming |

It has been such a long time since I didn’t work on graphs and trees. Here it is I’m back. This task is quite a simple one even though it is assigned a medium level of difficulty. The original task definition is given hackerrank.

Read more »

Hackerrank, Minimum Loss

Posted on 2018-06-25 | In Competitive Programming |

Here another weird problem given by hackerrank, though It was fun to solve this problem as well. This problem is good example of importance of understanding the given task. Sometimes it may have a straight logic from the definition of the task. Why is the Lauren wants to sell the houses and make a loss, not profit. Isn’t the profit is main purpose of any business, so guys be careful when reading the definition of the task.

Read more »

Hackerrank, Nimble Game

Posted on 2018-05-28 | In Competitive Programming |

Original definition of the problem is given at hackerrank. In order to avoid copyright related issues, I would like to not keep the definition of the problem in here.

Read more »

Hackerrank, 3D Surface Area

Posted on 2018-05-28 | In Competitive Programming |

Original definition of the problem is given at hackerrank. In order to avoid copyright related issues, I would like to not keep the definition of the problem in here.

Read more »

Codility, Stone Wall

Posted on 2018-05-26 | In Competitive Programming |

Task description

You are going to build a stone wall. The wall should be straight and N meters long, and its thickness should be constant; however, it should have different heights in different places. The height of the wall is specified by an array H of N positive integers. H[I] is the height of the wall from I to I+1 meters to the right of its left end. In particular, H[0] is the height of the wall’s left end and H[N−1] is the height of the wall’s right end.

Read more »

DDD Introduction and Main Concepts

Posted on 2018-05-20 | In DDD |

What is Domain Driven Design (DDD) ?

Read more »

IBM Hyperledger Blockchain Event

Posted on 2018-05-14 | In Conference, Blockchain |

As many small and big companies, organizations try to develop their own blockchain technologies IBM has developed its own. It is called Hyperledger, which originally was the closed source code project. But somehow IBM decided to make it open source and share its vision regarding to blockchain technolgies. Hyperledger is the collection of the projects that are devoted for blockchain. Private blockchain comes as a main keyword when we talk about HyperLedger, which is different than Ethereum or Bitcoin networks. It is particularly oriented to be deployed in a single organization, or in a consorcium of organizations. It can be configured in a whatever way they want. The speed can be top high compared to other existing blockchain technologies.

Read more »

Java Memory Related Notes

Posted on 2018-05-12 | In Java |

Some usefull collection of notes regarding to Java memory management has been collected. You can refer to some of them for quick remainder

Read more »

DDD, Repsitory

Posted on 2018-05-10 | In DDD |

We are continuing our Domain-Driven Design related chapters, and here I’ve tried to describe my understadings regarding to Repositories in the DDD. Repositories are easily confused with Factory patterns, while the main difference is that Factory Pattern does not provide persistency. Lets just dive into repository topic which starts with retrieving objects.

Read more »
1 … 9 10 11
Rustam Rakhimov Igorevich

Rustam Rakhimov Igorevich

102 posts
47 categories
86 tags
RSS
© 2025 Rustam Rakhimov Igorevich
Powered by Jekyll
Theme - NexT.Muse