---
title: "Kedar Dave (@SodaLime69) | Hashnode"
description: "Learning the ways of the Machines. Read the latest articles by Kedar Dave on Hashnode."
url: "https://hashnode.com/@SodaLime69"
---

@SodaLime69

# Kedar Dave

@SodaLime69 · Joined May 2023

Learning the ways of the Machines

### [Count Negative Numbers in a Sorted Matrix: An Efficient Algorithmic Approach](https://kedardave.hashnode.dev/count-negative-numbers-in-a-sorted-matrix-an-efficient-algorithmic-approach?utm_source=hashnode&utm_medium=feed)

Introduction Working with matrices is a common task in computer science and mathematics. In this blog, we will discuss an efficient algorithmic approach to count the negative numbers in a sorted matrix. Problem Statement Given a m x n matrix grid whi...

2 min read · [kedardave.hashnode.dev](https://kedardave.hashnode.dev/count-negative-numbers-in-a-sorted-matrix-an-efficient-algorithmic-approach?utm_source=hashnode&utm_medium=feed)

[Jun 8, 2023](https://hashnode.com/posts/count-negative-numbers-in-a-sorted-matrix-an-efficient-algorithmic-approach/648217c5c0356daf4578b09e)

### [Time Needed to Inform All Employees: A Simple Algorithmic Approach](https://kedardave.hashnode.dev/time-needed-to-inform-all-employees-a-simple-algorithmic-approach?utm_source=hashnode&utm_medium=feed)

Introduction In today's fast-paced world, communication is key to success. In a corporate environment, it is essential to inform all employees about important decisions and updates. In this blog, we will discuss a simple algorithmic approach to calcu...

3 min read · [kedardave.hashnode.dev](https://kedardave.hashnode.dev/time-needed-to-inform-all-employees-a-simple-algorithmic-approach?utm_source=hashnode&utm_medium=feed)

[Jun 7, 2023](https://hashnode.com/posts/time-needed-to-inform-all-employees-a-simple-algorithmic-approach/6480c464d2d254a584819c87)

### [Shortest Path in Binary Matrix: A Simple Algorithmic Approach](https://kedardave.hashnode.dev/shortest-path-in-binary-matrix-a-simple-algorithmic-approach?utm_source=hashnode&utm_medium=feed)

Introduction Graphs are an essential data structure in computer science, and they are used in various applications. One of the common problems that arise when working with graphs is finding the shortest path in a binary matrix. In this blog, we will ...

3 min read · [kedardave.hashnode.dev](https://kedardave.hashnode.dev/shortest-path-in-binary-matrix-a-simple-algorithmic-approach?utm_source=hashnode&utm_medium=feed)

[Jun 7, 2023](https://hashnode.com/posts/shortest-path-in-binary-matrix-a-simple-algorithmic-approach/6480c122d2d254a584819c7d)

### [Number of Provinces: A Simple Algorithmic Approach](https://kedardave.hashnode.dev/number-of-provinces-a-simple-algorithmic-approach?utm_source=hashnode&utm_medium=feed)

Introduction Graphs are an essential data structure in computer science, and they are used in various applications. One of the common problems that arise when working with graphs is finding the number of provinces in a graph. In this blog, we will di...

2 min read · [kedardave.hashnode.dev](https://kedardave.hashnode.dev/number-of-provinces-a-simple-algorithmic-approach?utm_source=hashnode&utm_medium=feed)

[Jun 7, 2023](https://hashnode.com/posts/number-of-provinces-a-simple-algorithmic-approach/6480c021126b44c9c14eee64)

### [Intersection of Two Linked Lists: A Simple Algorithmic Approach](https://kedardave.hashnode.dev/intersection-of-two-linked-lists-a-simple-algorithmic-approach?utm_source=hashnode&utm_medium=feed)

Introduction Problem Statement Given two linked lists, find the node at which the two lists intersect. If the two linked lists do not intersect, return null. Background Theory Before we dive into the algorithmic approach, let's first understand some ...

2 min read · [kedardave.hashnode.dev](https://kedardave.hashnode.dev/intersection-of-two-linked-lists-a-simple-algorithmic-approach?utm_source=hashnode&utm_medium=feed)

[Jun 7, 2023](https://hashnode.com/posts/intersection-of-two-linked-lists-a-simple-algorithmic-approach/6480bf1caba3ab5a0ebc45c3)
