2 results • Page 1 of 1
Showing : `graviton`reset
Graviton OA | Beauty of an Array | 2023
1 Vote | 2 Replies
10 months ago
PoGo
2.2k
Graviton Research Capital LLP coding round
2.7 years ago
jain.24
• 0
2 results • Page 1 of 1

Recent Replies

Comment: Trilogy Innovations(CodeNation) Coding Round, 5th March | Find the Evil Monsters by slime • 280
How would you handle cases where kadane choose subarray that leaves no suffix? You will have to give extra O(N) time to ensure 2nd and 3rd …
Answer: Google | 22 May, 2024 | Interview Question by slime • 280
Problem Summary Using first K digits, print all permutations of length N. That's literally the interview problem without story! &…
Comment: Sprinklr, Online Assessment | Splitting edges | Kevin's small talk | Profits | by Sumit Das • 30
Profits:   #include <bits/stdc++.h> using namespace std; #define int long long signed main(){     int n,k;   &…
Comment: Sprinklr, Online Assessment | Splitting edges | Kevin's small talk | Profits | by Sumit Das • 30
Splitting Edges:   #include <bits/stdc++.h> using namespace std; #define int long long vector<vector<int>> adj; v…
Answer: Amazon | 10th October | Online Assessments | Good String by AYUSH KUMAR • 0
Q1, Solution:  Intuition and Explanation Problem Understanding The task involves handling two types of queries on a string of lower…
Answer: ZScaler, Online Assessments Questions | Maximum Distinct | Perfect Pairs | Shopp by Abhishek Gupta • 30
Maxium Distinct #include <bits/stdc++.h> using namespace std; using ll = long long; #define pb push_back using pi = pair<in…
Answer: ZSCALER, Online Assessment Questions | BITS Archive | 2023 by Abhishek Gupta • 30
Solution- analysis- The question asks to find number of pairs for which [a|b] + [a&b]…
Answer: Microsoft OA Nov 2022 IITB by Adarsh Sen Singh • 0
Sir can u provide me test case 8 , i am getting failed over there.
Answer: Oracle, Recent Online Assessment Questions (30th August 2023) | Optimal Points S by Prasad Vavdane • 0
Can anyone provide apporch or code for Subsequences Sort which was able to clear all the test cases
Answer: TCS NQT | 9th October | Online Assessment by Banavathu. Lakshmi • 10
n=int(input()) arr=list(map(int,input().split())) arr.sort() for i in range(1,n):     if arr[i]<=arr[i-1]:     …
Answer: Google | OA | 2022 | Balanced brackets | Maximize equal numbers | Diagonal numbe by Mayank Jain • 10
Problem 2 Used a Sliding window kind of approach import java.util.*; public class Main { public static void main(String[] arg…
Answer: Amazon | 10th October | Online Assessments | Good String by compiler • 0
Question 4: i may be wrong for input s = ba output should be = ba not ab   #include<bits/stdc++.h> using names…
Answer: Amazon | 10th October | Online Assessments | Good String by compiler • 0
Question 3: sample Input: 3 0 1 1 2 3 0 0 sample output: 3 code: #include<bits/stdc++.h> using namespace std;…
Answer: Tibra Australia | Quant Trader Developer | Online Assessment | Maximum Path | by Viraj Dhirajbhai Pansuriya • 10
Question 2: Maximum Path.. Intuition:  you hvae to keep track of 2 variables : depth and side where from depth you can find starting…