TheJobOverflow

Showing : oyo • reset

1 Vote | 0 Replies

16 months ago

Delta 2.9k

21 Votes | 7 Replies

3 Votes | 0 Replies

3 results • Page 1 of 1

Filter Posts by Company

Recent Replies

The 9th testcase for Problem 1 are probably wrong, seeing that problem author himself has incorrect solution. Here is an alternate solution…

import java.util.Scanner; public class MartinJogging { public static void main(String[] args) { …

int solve(int a,int b,int c){ int ans=0; for(int i=0;i<31;i++){ if((c>&…

Flip Operations Solution-> #include<bits/stdc++.h> using namespace std; class Solution { public: int n; &n…

Code of above ⬆ it will give tle please optimize it. #include<bits/stdc++.h> using namespace std; #define int long long in…

#include <iostream> #include <vector> using namespace std; const int MOD = 1e9 + 7; const int MAX_N = 100…

Please give the complete code

no you can move in any 4 directions it will cover only 2 directions left and down

1. #include<bits/stdc++.h> using namespace std; void __solve() { int n, m; cin >> n >> m; vector&l…

I guess we can also solve using tries. we will count the longest branch with consicutive end points.

The TC of your algorithm is exponential as we end up adding n^(m) elements to the queue

@admin can you tell how can one get premium for TJO?

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…