Producers live by their meaning, they produce data into the kafka stream. A producer is the one which publishes or writes data to the topics within different partitions.

Its kind of magical that producers automatically knows which broker and partition to write the data ( which we will discuss in…

Last time we have seen about the brokers and clusters. In short Kafka broker is an independent process ( it can be a vm or physical machine) that runs kafka and Kafka cluster is a group of kafka brokers.

We can have any number of brokers in kafka cluster. It…

We are going back to solving a programming question today. As we have seen before Dynamic programming involves splitting a problem into series of sub problems solving them and storing the result to avoid re computations.

Okay let’s jump on to the question,

Given an array of distinct positive integers…

Okay in the last post we have talked about kafka topics. What holds the topics and the partitions.

The answer is a **kafka broker**

Okay, then what is a kafka broker, simply put it is a machine that runs kafka i.e a single kafka server. Now the official definition,

Kafka…

Kafka, have you heard this name somewhere? If so are you familiar with it? If not don’t fret you are in good company. Come, let’s learn Kafka together.

Apache Kafka is a distributed data store optimized for ingesting and processing streaming data in real-time. Streaming data is data that is…

Continuation Blog … Cooking something big .. Will be out on tomorrow’s blog

Hey folks, Today I planned to something I don’t have much expertise in. Dynamic Programming.

Dynamic Programming is a technique for solving complex problems. It begins by splitting the complex problem into collection of similar sub problems. …

For today, I haven’t prepared much in while starting, but an idea came why don’t we analyze the sorting algorithms. So came today’s blog.

Selection sort is an in place comparison sorting algorithm which is not an efficient one. Actually its worst of all sorting algorithms when concerned with time…

Today we are going back to solving a Leet Code Problem. I took on myself to solve today’s Challenge problem

Write a program to find the node at which the intersection of two singly linked lists begins.

For example, the following two linked lists:

begin to intersect at node c1.

**…**

Today we are going back to a classic a leet code problem. For this problem in the first time in ever I came up with four approaches ( yeah four ). I will let on to the problem then.

Question : Given an non-empty integer array nums sorted in non-decreasing…