Join Us
0 Votes | 0 Replies
3 hours ago 
Rohit • 0
Request Recent Questions Now!
Filter Posts by Company
Amazon 87 Google 41 Oracle 38 Sprinklr 22 GoldmanSachs 22 Uber 22 Microsoft 21 deshaw 18 CodeNation 17 BNY-Mellon 16 Cisco 16 Walmart 15 media.net 15 Atlassian 15 Airtel 14 VISA 14 ZScaler 14 Flipkart 14 PhonePe 13 DBOI 13 Paytm 11 ByteDance 11 TCS 10 Adobe 10 Intuit 9 IBM 9 Publicis-Sapient 8 PayPal 8 Razorpay 8 Amadeus 7 Zomato 7 Cred 7 Barclays 7 Increff 7 Salesforce 7 Tredence 7 Credit-Suisse 6 GEDigital 6 TVS 6 saplabs 6 Rubrik 6 Morgan-Stanley 6 Infosys 6 thoughtspot 5 JP-Morgan 5 uipath 5 curefit 5 QuantBox 5 graviton 5 Jaguar 5 Apollo 5 Mastercard 5 Juspay 5 standard-chartered 5 Nvidia 5 Samsung 5 Sigmoid 5 HCL 5 Deloitte 4 Juniper 4 Trilogy-Innovations 4 Avalara 4 Directi 4 Palo-Alto-Networks 4 arcesium 4 Accenture 4 Alphagrep 4 Hilabs 4 Confluent 4 Wells-Fargo 4 American-Express 4 AQR 3 Qualcomm 3 DevRev 3 Contlo 3 British-Telecom 3 Navi 3 Linkedin 3 Mathworks 3 Hugosave 3 Tiktok 3 Jio 3 Niro-Money 3 Dpworld 3 Capgemini 3 Nagarro 3 Appdynamics 3 HSBC 3 CapitalOne 3 OYO 3 Swiggy 3 Piramal 3 Citadel 3 Meesho 3 Goldman-Sachs 3 Edfora 2 Celigo 2 Arzoo 2 Dassault-Systems 2 CITI 2 Mercari 2 shopconnect 2 USTD3 2 Gameskraft 2 ServiceNow 2 Schrodinger 2 Chargebee 2 Hexaware 2 MotorQ 2 Tekion 2 Air-India 2 Persistent 2 Edgeverve 2 MAQ-Software 2 DXC-Technology 2 relevel 2 ringcentral 2 wipro 2 darwinbox 1 colortokens 1 Blackrock 1 Morphel 1 Kickdrum 1 Toshiba 1 Rakuten 1 Tibra 1 Truminds 1 Factset 1 Chalo 1 Winzo 1 Bhanzu 1 Natwest 1 Prograd 1 Intel 1 Tiger-Analytics 1 Societe-Generale 1 Notion 1 Zepto 1 Audify-Tech 1 Trianz-Digital 1 Webstaff 1 Veritas 1 Observe.ai 1 makemytrip 1 Siemens 1 Tech-Mahindra 1 Pine-Labs 1 Slice 1 AMD 1 Rippling 1 Cogoport 1 Virtusa 1 Optum 1 Cognizant 1 BP 1 Wissen-Technology 1 Mentor-Graphics 1 Irage 1 urbancompany 1 Hudson-River-Trading 0 Steradian-Semiconductors 0 Bank-of-America 0 Newfold - Digital 0 Hitachi 0 Medianet 0 Flexcar 0 LTI 0 Qburst 0
Recent Replies
Answer: Morgan Stanley | Online Assement by pushy cat • 0
In my opinion this question itself could be a bit wrong.... i mean what if one cycle is inside another..... draw this on paper.... what eve…
Comment: Morgan Stanley | Online Assement by pushy cat • 0
In my opinion this question itself could be a bit wrong.... i mean what if one cycle is inside another..... draw this on paper.... what eve…
Answer: GOOGLE OA | SWE Internship 2023 | Triangles | Maximize Collection | 22nd July (S by Sankalp Anand • 0
#include <bits/stdc++.h> using namespace std; vector<int> solve(int n, const vector<int>& c, int q, c…
Answer: Uber OA | 30th July 2023 by SHASHANK • 0
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int n…
Answer: Google | Complex Subsequence | Subtree XOR by SHASHANK • 0
PROBLEM 4-MIN SQUARE ZEPTO DISTANCE #include <iostream> #include <vector> #include <algor…
Answer: Google | Complex Subsequence | Subtree XOR by SHASHANK • 0
PROBLEM 1-COMPLEX SUBSEQUENCES #include <iostream> #include <vector> #include <map> #…
Answer: GOOGLE OA | SWE Internship 2023 | Triangles | Maximize Collection | 22nd July (S by SHASHANK • 0
#include <iostream> #include <vector> #include <algorithm> #include <set> using namespace std; vector<i…
Answer: DE Shaw (DESIS Ascend | 17th September 2023) | Subarray Sums | Array Generator by Venkatvishaal T S • 0
arr=[1,2,1,-5] n=len(arr) a=-10**18 b=-10**18 c=-10**18 d=-10**18 s=0 for i in range(n): s+=arr[i] …
Answer: DE Shaw (DESIS Ascend) , Online Assessment Question (17th September 2023) | find by Venkatvishaal T S • 0
arr=[93,32,88,9,58,15] m=3 arr.sort() n=len(arr) low=0 high=arr[n-1]-arr[0] answer=high while low<=high: …
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 …
Land on Leaderboard & Claim your Hamper
Start Solving Problems Now
All Problems
Recent Votes
Recent Locations
Hyderabad, 25 minutes ago
Salem, 31 minutes ago
Mumbai, 37 minutes ago
Hyderabad, 2 hours ago
Hyderabad, 2 hours ago
Hyderabad, 25 minutes ago Salem, 31 minutes ago Mumbai, 37 minutes ago Hyderabad, 2 hours ago Hyderabad, 2 hours agoRecent Awards • All
Great Question to admin 1.8k
Appreciated to Akshay Sharma 1.1k
Appreciated to Akshay Sharma 1.1k
Guru to Akshay Sharma 1.1k
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
