TheJobOverflow

No posts found.

0 results • Page 1 of 1

Filter Posts by Company

Recent Replies

code you provide a code for this :)

from collections import deque dx = [1, 1, -1, -1] dy = [-1, 1, 1, -1] def read_input(): n = int(input()) vec …

Bro, I found it. the test case's expected output is wrong try changing the condition of when 2 heros occur at same coordinate (p1 occur…

Bro, same issueee here did you find why were you getting WA on 17?

did u check for the and ?? , as I think question is stating about a marathon meaning each node is visited only once during a path from star…

can anyone share testcase 2 as the code for same is working on leetcode for same problem but failing here so I wanna know what is the testc…

I hope I will select for the second stage. i am thrilled to be part of the AlgouniversityTechnologyFellowshipOver the past few months, I ha…

Good evening sir, I hope I will select second stage using this questions, thanks for sharing this questions sir this may very useful for me…

I hope I will select second stage using this questions, thanks for sharing this questions sir this may very useful for me thanking yo…

I hope I will select second stage using this questions, thank you sir for sharing questions.

I hope I will select second stage using this questions, thanks for sharing this questions sir this may very useful for me thanking you sir

StraightForward question on Disjoint Set. Do union of all edges and print the no of connected components.

mcm dp for 1 que??

def find_pair(n, k, arr): arr.sort() left, right = 0, n - 1 &n…