7 359
Suscriptores
-324 horas
-237 días
-11330 días
Archivo de publicaciones
def ArrayChallenge(strArr):
s1, s2 = strArr[0], strArr[1]
n, m = len(s1), len(s2)
dp = [[0] * (m + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
for j in range(1, m + 1):
if s1[i - 1] == s2[j - 1]:
dp[i][j] = dp[i - 1][j - 1] + 1
else:
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1])
return dp[n][m]
AssestSense ✅
//q1
def MathChallenge(num):
coins = [1, 5, 7, 9, 11]
dp = [float('inf')] * (num + 1)
dp[0] = 0
for i in range(1, num + 1):
for coin in coins:
if i >= coin:
dp[i] = min(dp[i], dp[i - coin] + 1)
return dp[num]
AssestSense✅
//q2
EPAM ✅
Magic spell ✔️
sum-Two pairs ✔️
Contact: @MLCODER2
import java.util.*;
public class TestClass {
static class Edge {
int to, cost;
Edge(int to, int cost) {
this.to = to;
this.cost = cost;
}
}
static List<List<Edge>> graph;
static List<Integer> bestPath = new ArrayList<>();
static int maxVisitLength = 0;
public static void optimalPath(int N, int M, int price, int[] source, int[] dest, int[] weight) {
graph = new ArrayList<>();
for (int i = 0; i <= N; i++) graph.add(new ArrayList<>());
for (int i = 0; i < M; i++) {
int u = source[i];
int v = dest[i];
int w = weight[i];
graph.get(u).add(new Edge(v, w));
graph.get(v).add(new Edge(u, w));
}
boolean[] visited = new boolean[N + 1];
List<Integer> path = new ArrayList<>();
path.add(1);
visited[1] = true;
dfs(1, price, 0, visited, path);
for (int val : bestPath) {
System.out.print(val + " ");
}
}
static void dfs(int node, int budget, int costSoFar, boolean[] visited, List<Integer> path) {
int returnCost = costSoFar;
if (2 * returnCost <= budget) {
if (path.size() > maxVisitLength) {
maxVisitLength = path.size();
bestPath = new ArrayList<>(path);
for (int i = path.size() - 2; i >= 0; i--) {
bestPath.add(path.get(i));
}
}
} else {
return;
}
for (Edge edge : graph.get(node)) {
if (!visited[edge.to]) {
int newCost = costSoFar + edge.cost;
if (2 * newCost <= budget) {
visited[edge.to] = true;
path.add(edge.to);
dfs(edge.to, budget, newCost, visited, path);
path.remove(path.size() - 1);
visited[edge.to] = false;
}
}
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int M = sc.nextInt();
int price = sc.nextInt();
int[] source = new int[M];
int[] dest = new int[M];
int[] weight = new int[M];
for (int i = 0; i < M; i++) {
source[i] = sc.nextInt();
dest[i] = sc.nextInt();
weight[i] = sc.nextInt();
}
optimalPath(N, M, price, source, dest, weight);
}
}
//FLIPKART GRID
+4
VIRTUSA EXAM ON-CAMPUS DONE & DUSTED✅✅
Contact : @MLCODER2
VISTUSA ALL SLOTS DONE & DUSTED✅✅
100% CLEARNCE FOR YOUR EXAM✅
Contact : @MLCODER2
VISRTUS OATTERN FOR 2026 BATCH✅✅
FOR exam clearance
Contact : @MLCODER2
+6AlphaGrep exam done & dusted✅✅✅
100% clearance for any exam✅
Contact : @MLCODER2
