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
Hi, today I have very nice code puzzle for you. Code Puzzle is to implement two blue boxes in following diagram. That can be implemented in Java and/or C# with following requirements. The only system that can receive connections is behind green box that is a open server endpoint. The system behind red box is closed and you cannot connect to it. I have Continue ReadingCode Puzzle – Get Behind Firewall
Hi, as a .NET/C# coder I found the issue that there is not Action<T> and Func<T, TResult> equivalents in Java environment. I am self-study this to prepare myself to the OCA certification and I had idea that I can use lambda expression and implement simple equivalents of C# delegates in the Java 8. Below you can find implementation with test cases. I found that Continue ReadingAction<T> and Func<T, TResult> in Java 8
So, I did it :P. p ;).
Hi, I am happy to announce, that my learn Java journey at the Hacker Rank is going very nice. Today I was very happy to solve the code puzzle named Java 1D Array (Part 2) and this puzzle has already 39.64% success rate. And it category Data Structure Challenges most of the code puzzles has more than 90% of success rate. So far, so Continue ReadingLearn Java so Far so Good Java 1D Array
Hi, some time ago I started learn Java language. I ma trying to self-study learn of the Java. And I have to say that the language is very nice and with deep knowledge of C# my progress is fast. I want to show you today here one of nice code puzzle solution named Tag Content Extractor. It take me some time. I started learn Continue ReadingLearn Java proof at Hacker Rank in Tag Content Extractor
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