Logan, Author at Only Code

Master-Slave and Multi-Master Database Replication (Quick Notes)

Database replication is usually done to achieve HA (High Availability) and load-sharing purposes. A single member of group is designated as master for a given piece of data and is the only node allowed to modify data.

Databases, Interview Questions

Floyd-Warshall Algorithm Implementation | All pairs shortest path

Floyd-Warshall algorithm helps in finding the shortest path between all pairs of vertices in a graph.

Algorithms, Dynamic Programming, Graphs

Directed and Undirected Graphs (Implementation)

A graph consists of two sets, namely V (vertices) and E (Edges). V represents a non-empty sets of vertices present in the graph. While E, represents the set of edges (joining two vertices) in the graph.

Graphs

Mixins | Diamond Problem

Mixins help avoid problem caused by multiple inheritance namely, Diamond Problem. Diamond problem is the reason why Java doesn’t support multiple inheritance.

Interview Questions, Java

Java Notes | Singleton vs Static Class

When Java encounters a call to a method that is found within the object it is treated as a call to that object’s method.

Java

Java Notes | Interface vs Abstract class

Methods and members of an abstract class can have any visibility (public, protected or public), while all methods of an interface must be public.

Java

Binary Search Time Complexity Analysis

Since, at each step the size of the (searchable) array is reduced to half (1/2), we could write the following recurrence relation for the Binary Search Algorithm

Algorithms, Divide and Conquer

Binary Search Explained | LeetCode Solution

Binary Search is a divide and conquer algorithm that finds a particular element within a sorted array or a given integer range.

Algorithms, Competitive Programming, Divide and Conquer

C Revision (Quick Notes)

Importance of main: main() function is the first function to be executed in the program. All the remaining functions in the program are called from main().

C/C++

Restaurant Rating Solution (Heap) | CodeChef [Medium]

Chef has opened up a new restaurant. He picks out the positive reviews and posts it on the website of the restaurant. A review is considered to be positive if it is among the top one-third of the total reviews when they are sorted by their rating.

Competitive Programming, Heaps, Interview Questions