Join Us
7 Votes | 0 Replies
2.8 years ago 
Raghavendra • 140
5 Votes | 0 Replies
2.9 years ago 
messiah 150
4 Votes | 5 Replies
2.9 years ago 
papa 410
1 Vote | 1 Reply
2.9 years ago papa 410
6 Votes | 2 Replies
3.9 years ago 
admin 1.7k
6 Votes | 1 Reply
4.3 years ago admin 1.7k
0 Votes | 0 Replies
4.3 years ago 
mrinal.shashwat • 30
2 Votes | 0 Replies
4.7 years ago 
Shubhendu Goel • 450
4 Votes | 0 Replies
4.7 years ago Shubhendu Goel • 450
2 Votes | 0 Replies
4.8 years ago Shubhendu Goel • 450
4 Votes | 0 Replies
4.8 years ago Shubhendu Goel • 450
2 Votes | 0 Replies
4.9 years ago papa 410
0 Votes | 1 Reply
5.3 years ago 
manas_kv 80
Request Recent Questions Now!
Filter Posts by Company
Amazon 81 Google 40 Oracle 38 Sprinklr 22 Microsoft 21 Uber 20 GoldmanSachs 20 deshaw 17 CodeNation 17 Cisco 16 BNY-Mellon 16 Walmart 15 Atlassian 15 VISA 14 media.net 14 ZScaler 14 Flipkart 14 Airtel 14 DBOI 13 PhonePe 13 Paytm 11 ByteDance 11 Adobe 10 TCS 9 Intuit 9 Razorpay 8 PayPal 8 Tredence 7 Barclays 7 Publicis-Sapient 7 Amadeus 7 Zomato 7 Increff 7 Cred 7 Salesforce 6 GEDigital 6 TVS 6 Morgan-Stanley 6 saplabs 6 Rubrik 6 Credit-Suisse 6 Mastercard 5 thoughtspot 5 uipath 5 Apollo 5 curefit 5 IBM 5 Juspay 5 HCL 5 QuantBox 5 Sigmoid 5 Samsung 5 Nvidia 5 JP-Morgan 5 Jaguar 5 graviton 5 standard-chartered 5 Directi 4 Trilogy-Innovations 4 Confluent 4 Infosys 4 Hilabs 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: DE Shaw, Online Assessment Test (IIIT Bhopal | SDET | FTE) | Smallest Sorted Arr by a aryan • 0
efficient simple way i store the val of each node in val array that i will get while backtracking and then check for no.of steps requ…
Answer: DE Shaw, Online Assessment Test (IIIT Bhopal | SDET | FTE) | Smallest Sorted Arr by a aryan • 0
#include <bits/stdc++.h> using namespace std; void dfs(int v,int par,vector<int> &val,vector<vector<int>>…
Comment: Google | Complex Subsequence | Subtree XOR by .. • 0
#include <bits/stdc++.h> using namespace std; #define int long long int binexp(int n, int e, int m = 1000000007) { …
Comment: Google Interview Experience | 2023 Graduate Offcampus by Aditya Kumar • 0
void Spidycoder() { string s; cin >> s; int n = s.size(); int q; cin >> q; vector> v; for (int i = 0; i < q; i+…
Answer: Google | OA | 2022 | Balanced brackets | Maximize equal numbers | Diagonal numbe by Sourav Mohapatra • 0
Problem 1: <code> #include <bits/stdc++.h> using namespace std; using ll = long long; void solve() { &n…
Answer: Atlassian , Recent Online Assessment Questions( 21st August 2023) | Ride Hailing by Sourav Mohapatra • 0
This is the solution for question 3 if anyone wants #include <bits/stdc++.h> using namespace std; using ll = long long; int m…
Answer: Irage , Online Assessment (IIT Kanpur) | Look and You shall Find | Logistics Cen by Abhijeet Kumar • 0
Answer: Flipkart | October, 2022 | Interview Questions by Aman Singh Budhala • 0
Easiest solution for question 4=> #include<bits/stdc++.h> using namespace std; int32_t main(){ ios_base::syn…
Answer: Flipkart | October, 2022 | Interview Questions by Aman Singh Budhala • 0
Code for Question 3: It's a standard graph problem #include<bits/stdc++.h> using namespace std; #define mod 1000000007 …
Answer: Chargebee | 29 Sept | Internship | Online Assessments by Aditya Kumar • 0
I am trying to solve it using Brute Force Approach.Any optimised approach is appreciable. void Spidycoder() { int n, m…
Answer: DE Shaw, Online Assesment (DESIS | 17th September 2023) | Range Selection | GetM by Vakkalanka Ram Charan • 0
Q1) void solve() { string s; int k; cin >> s >> k; ve…
Comment: Uber OA | NSUT | 17 July 2023 by Sam • 0
#include<bits/stdc++.h> using namespace std; int findPath(vector<vector<pair<int, int>>> &adj, vector<in…
Answer: Amazon Hackon coding round problem | Character Traversal | Lamp and Houses by priyam169 • 10
Problem 2 : USING BINARY SEARCH INTUITION: Monotonous , Since if with distance k , every house can be lighted then wit…
Answer: Navi OA by Yuvraj singh Kanoujia • 0
I have a doubt in this problem as this same problem is also present in the leetcode Link:-Problem Link But the solution that …
Land on Leaderboard & Claim your Hamper
Start Solving Problems Now
All Problems
Recent Votes
Recent Locations
Ahmedabad, 2 minutes ago
Kolkata, 4 minutes ago
Panipat, 13 minutes ago
Kathmandu, 14 minutes ago
Nagpur, 17 minutes ago
Ahmedabad, 2 minutes ago Kolkata, 4 minutes ago Panipat, 13 minutes ago Kathmandu, 14 minutes ago Nagpur, 17 minutes agoRecent Awards • All
Great Question to John 940
Great Question to John 940
Great Question to admin 1.7k
Great Question to xINFERNOx • 40
Appreciated to PoGo 2.4k
Appreciated to PoGo 2.4k
Great Question to PoGo 2.4k
Great Question to PoGo 2.4k
Great Question to PoGo 2.4k
Great Question to PoGo 2.4k
