Join Us
4 Votes | 3 Replies
3.4 years ago 
mod2 870
1 Vote | 2 Replies
3.4 years ago 
admin 1.8k
8 Votes | 0 Replies
14 months ago admin 1.8k
2 Votes | 0 Replies
4.1 years ago 
Viren Khatri • 50
6 Votes | 1 Reply
4.2 years ago 
rahul18bhardwaj.23 • 40
2 Votes | 3 Replies
4.2 years ago 
Raj Makkad • 20
3 Votes | 1 Reply
4.2 years ago mod2 870
0 Votes | 0 Replies
0 Votes | 0 Replies
4.2 years ago 
jain.24 • 0
0 Votes | 0 Replies
4.3 years ago 
saitama_26 • 30
4 Votes | 6 Replies
4.3 years ago saitama_26 • 30
0 Votes | 0 Replies
4.3 years ago 
2019csb1070 • 10
1 Vote | 0 Replies
4.3 years ago admin 1.8k
2 Votes | 0 Replies
4.3 years ago saitama_26 • 30
6 Votes | 2 Replies
4.4 years ago admin 1.8k
4 Votes | 4 Replies
4.4 years ago 
deadpool • 20
0 Votes | 1 Reply
4.4 years ago 
Jack548 • 0
1 Vote | 6 Replies
4.4 years ago 
Anonymous_user • 10
4 Votes | 3 Replies
4.4 years ago 
pathetic_puma • 30
8 Votes | 9 Replies
4.4 years ago pathetic_puma • 30
4 Votes | 5 Replies
4.4 years ago mod2 870
0 Votes | 2 Replies
4.4 years ago mod2 870
0 Votes | 1 Reply
4.4 years ago mod2 870
0 Votes | 1 Reply
4.4 years ago mod2 870
2 Votes | 3 Replies
4.4 years ago mod2 870
1 Vote | 1 Reply
4.5 years ago mod2 870
Request Recent Questions Now!
Filter Posts by Company
Amazon 81 Google 40 Oracle 38 Sprinklr 22 Microsoft 21 GoldmanSachs 20 Uber 20 CodeNation 17 deshaw 17 Cisco 16 BNY-Mellon 16 media.net 15 Walmart 15 Atlassian 15 VISA 14 ZScaler 14 Flipkart 14 Airtel 14 PhonePe 13 DBOI 13 ByteDance 11 Paytm 11 Adobe 10 Intuit 9 TCS 9 PayPal 8 Razorpay 8 Publicis-Sapient 7 Amadeus 7 Tredence 7 Barclays 7 Zomato 7 Cred 7 Increff 7 Morgan-Stanley 6 TVS 6 GEDigital 6 Salesforce 6 Rubrik 6 saplabs 6 Credit-Suisse 6 Juspay 5 thoughtspot 5 Samsung 5 QuantBox 5 Nvidia 5 standard-chartered 5 JP-Morgan 5 Jaguar 5 Apollo 5 curefit 5 graviton 5 Mastercard 5 HCL 5 IBM 5 uipath 5 Sigmoid 5 Hilabs 4 Trilogy-Innovations 4 Directi 4 Confluent 4 Infosys 4 Palo-Alto-Networks 4 Juniper 4 American-Express 4 Alphagrep 4 arcesium 4 Avalara 4 Wells-Fargo 4 Accenture 4 Hugosave 3 Tiktok 3 Linkedin 3 Goldman-Sachs 3 British-Telecom 3 Niro-Money 3 Contlo 3 Qualcomm 3 CapitalOne 3 Jio 3 Meesho 3 OYO 3 Appdynamics 3 Deloitte 3 Swiggy 3 Navi 3 DevRev 3 AQR 3 Citadel 3 Piramal 3 Persistent 2 Air-India 2 Celigo 2 Gameskraft 2 MAQ-Software 2 Nagarro 2 Mathworks 2 Edfora 2 CITI 2 USTD3 2 Schrodinger 2 ringcentral 2 Mercari 2 MotorQ 2 Arzoo 2 ServiceNow 2 Chargebee 2 Dpworld 2 DXC-Technology 2 Tekion 2 shopconnect 2 Hexaware 2 Dassault-Systems 2 HSBC 2 relevel 2 Natwest 1 Audify-Tech 1 Zepto 1 Capgemini 1 Optum 1 Virtusa 1 Cogoport 1 Rippling 1 AMD 1 Slice 1 Pine-Labs 1 Tech-Mahindra 1 Observe.ai 1 Intel 1 Bhanzu 1 Chalo 1 Factset 1 Tibra 1 Edgeverve 1 Toshiba 1 colortokens 1 Mentor-Graphics 1 Irage 1 urbancompany 1 darwinbox 1 Blackrock 1 Morphel 1 Rakuten 1 Winzo 1 wipro 1 Prograd 1 Tiger-Analytics 1 Societe-Generale 1 Notion 1 Trianz-Digital 1 Webstaff 1 Veritas 1 makemytrip 1 Siemens 1 BP 1 Wissen-Technology 1 Kickdrum 1 Truminds 1 Medianet 0 Flexcar 0 Cognizant 0 Steradian-Semiconductors 0 Hudson-River-Trading 0 Qburst 0 Bank-of-America 0 LTI 0 Hitachi 0 Newfold - Digital 0
Recent Replies
Answer: Google | Complex Subsequence | Subtree XOR by Prakhar mishra • 0
Q 4 - Answer #include <bits/stdc++.h> using namespace std; long long cost(vector<long long> &A, long long X) { &nbs…
Answer: Google | Complex Subsequence | Subtree XOR by Prakhar mishra • 0
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int T; cin &…
Answer: GOOGLE OA | SWE Internship 2023 | Cost of Groups | Queries and Arrays | 22nd Ju by Kaushik K S • 0
//COST OF GROUPS import java.util.*; import java.io.*; public class CostOfGroupsNaive { static List<Integer>[] tree; …
Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu by Kaushik K S • 0
//HYBRID MAXIMUM import java.util.Scanner; public class HybridMaximum { // maX VAL of the expression public static int …
Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu by Kaushik K S • 0
// PRIME PATH import java.util.*; import java.io.*; public class Main { static int N; static int[][] G; static int[][…
Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu by Kaushik K S • 0
//MEDIAN PATHS import java.util.*; /* * Approach * Use an adjacency list. * DFS Traversal & track paths(odd-len) * go …
Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu by Kaushik K S • 0
//FINDING ARRAYS import java.util.*; public class FindingArrays { static final int MOD = 1000000007; // digitSumBuc…
Answer: Google , Online Assessment Asked Question (VIT) | More Ones | Minimum Cost Path by annu sevada • 0
def count_substrings_more_ones(s): n = len(s) nums = [1 if c == '1' else -1 for c in s] …
Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu by Reddiwary Dhrutvan Reddy • 0
hybrid maximum #include <bits/stdc++.h> using namespace std; int hybridMaximum(int N, vector<int>& A, int M, vector&…
Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu by Reddiwary Dhrutvan Reddy • 0
Prime path #include <bits/stdc++.h> using namespace std; const int MAX = 1e6 + 10; vector<int> spf(MAX); // Small…
Answer: DE Shaw OA | BITS PILANI | SWE Internship | 30th July 2023 by Reddiwary Dhrutvan Reddy • 0
Q1) #include <bits/stdc++.h> using namespace std; int smallest_subarray_infinite(vector<int>& arr, int k) { …
Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu by Reddiwary Dhrutvan Reddy • 0
finding arrays #include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; // Precompute all numbers 1..1000…
Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu by Reddiwary Dhrutvan Reddy • 0
Median path: #include <bits/stdc++.h> using namespace std; void dfs(int node, int parent, vector<int>& val, vector&l…
Answer: GOOGLE OA | SWE Internship 2023 | Triangles | Maximize Collection | 22nd July (S by Nihal Reddy • 0
def solve_op(): t = int(input()) for _ in range(t): n = int(input()) costs = list(map(int, input().split())) …
Answer: Google , Online Assessment Asked Question (VIT) | More Ones | Minimum Cost Path by Nihal Reddy • 0
def merge_count_inversions(arr, temp, left, mid, right): i = left j = mid + 1 k = left inv_count = 0 while…
Land on Leaderboard & Claim your Hamper
Start Solving Problems Now
All Problems
Recent Votes
Recent Locations
Phnom Penh, 23 minutes ago
Bengaluru, 46 minutes ago
Bhubaneswar, 48 minutes ago
Jaipur, 2 hours ago
Jaipur, 4 hours ago
Phnom Penh, 23 minutes ago Bengaluru, 46 minutes ago Bhubaneswar, 48 minutes ago Jaipur, 2 hours ago Jaipur, 4 hours agoRecent Awards • All
Good Question to Sakshi • 50
Commentator to Shubham Gupta • 30
Scholar to Vatsal Patel • 20
Great Question to mod2 870
Great Question to mod2 870
Great Question to John 1.0k
Great Question to Rohit • 670
Great Question to Rohit • 670
Great Question to Rohit • 670
Great Question to Rohit • 670
