Join Us
9 Votes | 6 Replies
4.9 years ago 
mod2 870
0 Votes | 1 Reply
1 Vote | 1 Reply
4.9 years ago 
utopia • 140
3 Votes | 0 Replies
4.9 years ago 
Shubhendu Goel • 450
1 Vote | 2 Replies
1 Vote | 0 Replies
5.1 years ago Shubhendu Goel • 450
1 Vote | 0 Replies
5.1 years ago mod2 870
4 Votes | 1 Reply
5.1 years ago mod2 870
2 Votes | 1 Reply
5.2 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
Comment: Goldman Sachs OA | Bird Singing | Number Factors and Permutations | Summer Analy by Vishal NA • 0
// Solution for first problem #include<bits/stdc++.h> using namespace std; using ll = long long; const int mod = 7 * 24 * 60…
Answer: Goldman Sach Coding Round | SDE, London | 8th August 2020 by Vishal NA • 0
for question 11 correct answer is C option [x+(n-1)y]*(x-y)^n-1
Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Abhishek Tiwari • 0
K Closest: Output the k-closest integers in ascending order. Avoiding Landmines: Return the shortest path (minimum number …
Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Abhishek Tiwari • 0
Write coad K Closest: Output the k-closest integers in ascending order. Avoiding Landmines: Return the shortest path (minim…
Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Abhishek Tiwari • 0
K Closest: Output the k-closest integers in ascending order. Avoiding Landmines: Return the shortest path (minimum number of roads) …
Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Abhishek Tiwari • 0
K Closest: Output the k-closest integers in ascending order. Avoiding Landmines: Return the shortest path (minimum number of roads) …
Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Abhishek Tiwari • 0
K Closest: Output the k-closest integers in ascending order. Avoiding Landmines: Return the shortest path (minimum number of roads) from…
Answer: Microsoft , Recent Online Assessment (18th August 2023) | Car Manufacturer | Li by Nitin Singh • 0
```#include <bits/stdc++.h> using namespace std; #define ll long long vector<int>par(26,-1); int find(int u){ …
Answer: Zscaler, Recent Online Assessment Question (NITRR | 6M + FTE) | Session Based Au by Pritam Kumar Choudhary • 0
#include<bits/stdc++.h> using namespace std; #define ll long long #define fastio ios_base::sync_with_stdio(false), cin.tie(nullp…
Answer: Zscaler, Recent Online Assessment Question (NITRR | 6M + FTE) | Session Based Au by a aryan • 20
unequal elements (tle on larger test cases) 3D dp approach #include <bits/stdc++.h> using namespace std; …
Answer: Zscaler, Recent Online Assessment Question (NITRR | 6M + FTE) | Session Based Au by a aryan • 20
Infection Sequences #include <bits/stdc++.h> using namespace std; const int MOD = 1e9+7; long long factorial(int …
Answer: Uber OA (on campus) | 6 Month Intern by Abhijit Mishra • 20
3. #include <iostream> #include <vector> void solve() { long long n, m, k; long long x1, y…
Answer: Barclays, Recent Online Assesment Questions | String Generation | Insurance (SQ by Alok kumar • 10
#include<bits/stdc++.h> using namespace std; string findNewString(string &s1,string &s2) { …
Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Munnanur • 0
n = 6 arr = 10 2 14 4 7 6 k = 3 x = 5
Answer: Question from my last OA, Infeneon by Vatsal Patel • 20
Solution Okay, the given example seems to be missing value 2. But if we join the pieces, the grid should look something like this/ 3…
Land on Leaderboard & Claim your Hamper
Start Solving Problems Now
All Problems
Recent Votes
Recent Locations
Hyderabad, 17 minutes ago
Varanasi, 32 minutes ago
Kolkata, 48 minutes ago
Bhubaneswar, 55 minutes ago
Roorkee, 56 minutes ago
Hyderabad, 17 minutes ago Varanasi, 32 minutes ago Kolkata, 48 minutes ago Bhubaneswar, 55 minutes ago Roorkee, 56 minutes agoRecent Awards • All
Great Question to John 1.0k
Great Question to Rohit • 660
Great Question to Rohit • 660
Great Question to Rohit • 660
Great Question to Rohit • 660
Great Question to Rohit • 660
Great Question to Rohit • 660
Great Question to Rohit • 660
Great Question to John 1.0k
Popular Question to pillaisamarth • 30
