Siddhesh Surve is an accomplished Engineering leader with topics of interest including AI, ML, DS, DE, Cloud compute.

Shortest path algorithms sit at the heart of modern graph theory and many of the systems that move people, data, and goods around the world. After nearly seventy years of relying on the same classic ...

When Edsger W. Dijkstra published his algorithm in 1959, computer networks were barely a thing. The algorithm in question found the shortest path between any two nodes on a graph, with a variant ...

So, you’re looking to get better at coding interviews, huh? A lot of people find LeetCode pretty tough, and that’s totally normal. It’s all about algorithms and data structures, which can be a steep ...

1 Department of Industrial Engineering and Maintenance, Polytechnic University of Mongo, Mongo, Chad. 2 Department of Technical Sciences, University of N’Djamena, N’Djamena, Chad. 3 Department of ...

Daily LeetCode Practice Solutions in Java 🚀 This repository contains my daily submissions for LeetCode problems for 21 days in line. 🧠 Focused on sharpening problem-solving skills and mastering Data ...

So, you want to get good at LeetCode, especially using Java? It’s a common goal for a lot of us trying to land those tech jobs. This guide is all about helping you get there. We’ll go over how to ...

Abstract: Path finding is a technique that is employed extensively for determination of Shortest Path (SP) between source node and destination node. There are various path-finding algorithms like ...

Abstract: Dijkstra’s shortest path algorithm is a fundamental graph search method widely used in domains such as navigation, robotics, gaming, and network routing. However, its performance can degrade ...

This repository contains my implementations of various Data Structures and Algorithms (DSA) using Java. The goal is to enhance my understanding of fundamental algorithms and problem-solving techniques ...