Data Structure Review – K-D Tree
K-D tree is a binary search tree that gives you a way to structure multidimensional data to makes range search efficiently.
Coding
What matters the most in Java 8 – Part 2 – Stream
Stream A java.util.Stream represents a sequence of elements on which one or more operations can be performed. Stream operations are either intermediate or terminal. While...
Python – List comprehension
List [crayon-641a0e1bb5715935188073/] You can use list to implement stack (ie. LIFO). For that, we can use: append to add to the end of the list...
Functional Programming – Currying
What is Currying Currying is the process of taking a function that accepts N arguments and turning it into a chained series of N functions...
What matters the most in Java 8 – Part 1 – Lambda
Lambda Lambda – functional interface and it must contain exactly one abstract method declaration. Since default methods are not abstract you’re free to add default...
Data Structure Review – Heap
What is Heap Heap is a binary balanced tree that you fill the node from top to bottom and from left to right. There are...
REST API Design In Practice
It is important to get your REST design right as it is the API you expose to the public. To get it right, you need...
Design Pattern In Practice – Builder Pattern
Builder is like a factory method that is in class scope and to prepare you the instance of the class. The difference is all about...
Connect with us