add new question

Author: codewithdhruba01

Interview-Questions/ShortedPath_DijkstraAlgoritgm.py

@@ -0,0 +1,54 @@
+# Shorted Path Dijkstra Algoritgm:
+# Along with the shortest distance, the shortest path also needed to be printed which made the problem quite difficult.
+
+import heapq
+
+def dijkstra_with_path(n, edges, source, destination):
+    graph = [[] for _ in range(n)]
+    for u, v, w in edges:
+        graph[u].append((v, w))
+        graph[v].append((u, w))
+
+    dist = [float('inf')] * n
+    parent = [-1] * n
+    dist[source] = 0
+
+    heap = [(0, source)]
+
+    while heap:
+        d, u = heapq.heappop(heap)
+
+        for v, weight in graph[u]:
+            if dist[u] + weight < dist[v]:
+                dist[v] = dist[u] + weight
+                parent[v] = u
+                heapq.heappush(heap, (dist[v], v))
+
+    # Reconstruct path
+    if dist[destination] == float('inf'):
+        return -1, []
+
+    path = []
+    current = destination
+    while current != -1:
+        path.append(current)
+        current = parent[current]
+    path.reverse()
+
+    return dist[destination], path
+
+# Example
+n = 5
+edges = [
+    (0, 1, 2),
+    (1, 2, 4),
+    (0, 3, 1),
+    (3, 4, 3),
+    (4, 2, 1)
+]
+source = 0
+destination = 2
+
+distance, path = dijkstra_with_path(n, edges, source, destination)
+print("Shortest Distance:", distance)
+print("Shortest Path:", path)

Interview-Questions/Sum_of_prime_numbersN.py

@@ -0,0 +1,17 @@
+#Sum of prime numbers upto N:
+#The optimal approach for this problem is the Sieve of Eratosthenes, but the brute-force approach also got accepted.
+
+def is_prime(n):
+    if n <= 1:
+        return False
+    for i in range(2, int(n**0.5)+1):
+        if n % i == 0:
+            return False
+    return True
+
+def sum_of_primes_brute(N):
+    return sum(i for i in range(2, N+1) if is_prime(i))
+
+# Example usage:
+N = 20
+print(sum_of_primes_brute(N))  # Output: 77

README.md

@@ -2,7 +2,7 @@
 ![GitHub contributors](https://img.shields.io/github/contributors/codewithdhruba01/Learn-python-language)  ![GitHub License](https://img.shields.io/github/license/codewithdhruba01/Learn-python-language)
  ![GitHub issue/pull request detail](https://img.shields.io/github/issues/detail/author/codewithdhruba01/Learn-python-language/1) ![GitHub watchers](https://img.shields.io/github/watchers/codewithdhruba01/Learn-python-language) ![GitHub forks](https://img.shields.io/github/forks/codewithdhruba01/Learn-python-language)
 
-
+ # index
 
 > [!TIP]
 > Welcome to [**Learn Python Language**](https://github.com/codewithdhruba01/Learn-python-language) Read, Practice, Code!
@@ -43,7 +43,6 @@ This repository is part of **My Python learning journey,** created to help begin
 
 ---
 
-[**Back To Top ⬆️**](#index)
 
 # 📘 DSA Practice Sheets in Python
 
@@ -162,8 +161,6 @@ This repository is part of **My Python learning journey,** created to help begin
 
 If you are interested in writing code to fix issues, please see [How to Contribute](https://github.com/codewithdhruba01/Learn-python-language/blob/master/CONTRIBUTING.md) in the doc.
 
-[**Back To Top ⬆️**](#index)
-
 ## Author
 
 [![GitHub](https://img.shields.io/badge/GitHub_DhrubarajPati-%23121011.svg?logo=github&logoColor=white)](https://github.com/codewithdhruba01)