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

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 ...

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

Community driven content discussing all aspects of software development from DevOps to design patterns. One of the Java platform’s enduring strengths has always been its ecosystem. Since the early ...

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: 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 ...

Abstract: “Flight route planning is a critical aspect of modern aviation, requiring optimization based on time and cost. This paper compares two pathfinding algorithms-Backtracking and Dijkstra's ...

This project solves the problem of transporting heavy loads between cities by finding viable paths through viaducts with height restrictions, using a modified Dijkstra's algorithm for optimal routing.