Join Us
36 Votes | 11 Replies
16 months ago 
admin 1.4k
17 Votes | 11 Replies
21 months ago 
John 840
17 Votes | 4 Replies
21 months ago 
Rohit • 530
29 Votes | 11 Replies
21 months ago John 840
12 Votes | 4 Replies
22 months ago John 840
7 Votes | 2 Replies
21 months ago Rohit • 530
0 Votes | 0 Replies
18 hours ago 
slime • 330
10 Votes | 5 Replies
7 Votes | 4 Replies
21 months ago John 840
11 Votes | 10 Replies
21 months ago 
automata_1 • 40
3 Votes | 2 Replies
8 Votes | 2 Replies
11 days ago admin 1.4k
0 Votes | 0 Replies
21 days ago 
Aadarsh Kumar Jha • 10
1 Vote | 0 Replies
21 days ago Aadarsh Kumar Jha • 10
5 Votes | 3 Replies
7 weeks ago 
Akshat Chaudhary • 30
4 Votes | 1 Reply
9 weeks ago 
luckyjain1271 • 170
0 Votes | 0 Replies
5 months ago 
RAGHAV BHATIA • 0
0 Votes | 0 Replies
6 months ago 
papa 410
0 Votes | 0 Replies
6 months ago papa 410
0 Votes | 0 Replies
6 months ago papa 410
1 Vote | 0 Replies
6 months ago papa 410
0 Votes | 0 Replies
6 months ago papa 410
5 Votes | 0 Replies
7 months ago 
Delta • 50
0 Votes | 0 Replies
8 months ago 
Dev Agarwal • 0
2 Votes | 0 Replies
Request Recent Questions Now!
Filter Posts by Company
Amazon 59 Google 39 Oracle 25 Microsoft 21 Sprinklr 21 GoldmanSachs 20 Uber 20 deshaw 17 CodeNation 17 BNY-Mellon 16 Atlassian 15 media.net 14 Airtel 14 ZScaler 14 DBOI 13 Cisco 13 PhonePe 11 Flipkart 11 Walmart 10 ByteDance 10 Adobe 10 TCS 9 Intuit 9 Razorpay 8 VISA 8 PayPal 8 Zomato 7 Tredence 7 Publicis-Sapient 7 Barclays 7 Salesforce 6 GEDigital 6 TVS 6 saplabs 6 Paytm 6 Rubrik 6 standard-chartered 5 Apollo 5 curefit 5 uipath 5 Jaguar 5 Sigmoid 5 IBM 5 Samsung 5 Nvidia 5 JP-Morgan 5 Mastercard 5 Directi 4 Wells-Fargo 4 Cred 4 Juspay 4 Trilogy-Innovations 4 arcesium 4 thoughtspot 4 Infosys 4 Accenture 4 Alphagrep 4 Morgan-Stanley 4 Amadeus 4 Juniper 4 Avalara 4 American-Express 4 Citadel 3 OYO 3 Contlo 3 British-Telecom 3 Appdynamics 3 Palo-Alto-Networks 3 Credit-Suisse 3 Linkedin 3 Hilabs 3 Piramal 3 AQR 3 Swiggy 3 Tiktok 3 CapitalOne 3 graviton 3 Navi 3 Goldman-Sachs 3 Jio 3 Arzoo 2 Nagarro 2 Chargebee 2 Hexaware 2 Gameskraft 2 relevel 2 Dassault-Systems 2 HSBC 2 Qualcomm 2 Confluent 2 MotorQ 2 ringcentral 2 Schrodinger 2 Edfora 2 Persistent 2 Meesho 2 Celigo 2 Mathworks 2 CITI 2 Tekion 2 shopconnect 2 USTD3 2 ServiceNow 2 Mercari 2 MAQ-Software 2 Hugosave 2 DXC-Technology 2 Dpworld 2 Air-India 2 DevRev 2 Deloitte 2 Winzo 1 Natwest 1 wipro 1 colortokens 1 Prograd 1 Toshiba 1 HCL 1 Tiger-Analytics 1 Kickdrum 1 Societe-Generale 1 Notion 1 Rakuten 1 QuantBox 1 Wissen-Technology 1 Capgemini 1 Morphel 1 Blackrock 1 darwinbox 1 urbancompany 1 Irage 1 Mentor-Graphics 1 Edgeverve 1 Trianz-Digital 1 Tibra 1 Truminds 1 Webstaff 1 Veritas 1 Factset 1 Niro-Money 1 Chalo 1 Increff 1 Bhanzu 1 Intel 1 makemytrip 1 Observe.ai 1 Tech-Mahindra 1 Siemens 1 Pine-Labs 1 Slice 1 AMD 1 Zepto 1 Rippling 1 Cogoport 1 Virtusa 1 Optum 1 Audify-Tech 1 BP 1 Medianet 0 Cognizant 0 Hudson-River-Trading 0 Steradian-Semiconductors 0 Newfold - Digital 0 Flexcar 0 Bank-of-America 0 LTI 0 Hitachi 0 Qburst 0
Recent Replies
Answer: Goldman Sachs , Recent Online Assessment Questions (3rd August 2023) | Autocorre by Vijay Kuswah • 0
hello
Answer: Goldman Sachs , Recent Online Assessment Questions (3rd August 2023) | Autocorre by Vijay Kuswah • 0
hello
Answer: DE shaw latest questions by Yash Vij • 0
#include <bits/stdc++.h> using namespace std; #define ll long long #define mod 1000000007 int f(int ind,int prev,vector&l…
Answer: Google | Complex Subsequence | Subtree XOR by Abhinav Ratna • 20
Approach for Problem 2: Root the tree at node 1, then find sum[v] and sumWithXorApplied[v] for every node v then subtree of…
Answer: Google | Complex Subsequence | Subtree XOR by Keshav Jindal • 40
Approach for complex subsequences: Part 1: Efficient Range Updates To handle the range updates efficiently, we use a difference array. Th…
Answer: PhonePe , Recent online Assessment (11th August 2023 SET- 2) | PhonePe Team Form by Vaibhav Aggarwal • 0
TC O(10 *n*n) #include<bits/stdc++.h> #define null NULL using namespace std; string s; string fun(string str) { …
Answer: PhonePe , Recent online Assessment (11th August 2023 SET- 2) | PhonePe Team Form by Vaibhav Aggarwal • 0
TC O(n2) DP solution: #include<bits/stdc++.h> #define null NULL using namespace std; int n,k,x; map<int,int>mp; vecto…
Comment: PhonePe, Recent Online Assesment (19th August 2023) | Arjun's Birthday by Vaibhav Aggarwal • 0
TC (4*n) #include<bits/stdc++.h> #define null NULL using namespace std; int t,n,m,curr=0,mx1=0,mx2=0,mx3=0,x; vector<int>a1,a…
Comment: Goldman Sachs, Summer Internship 2023 and Previosuly Asked Intern Questions, 202 by chiranjivi keshav • 0
time complexity for first question is nLog(n) Explaination: we can find min-max array using sliding window wit…
Answer: Flipkart , Online Assessment Questions (17th August 2023 | SDE Intern) | Items S by aryan jangra • 0
In which college were these questions asked? Does the difficulty level of quesstions changes depending upon what college they're asked …
Answer: PhonePe , Recent Online Assessment Questions | PhonePe Fun Day | Shortest God St by siister • 0
Question 1 Fun Day from collections import deque n=int(input()) x,y=list(map(int,input().split())) k=int(input()) n-=1 q=de…
Comment: Amazon | 10th October | Online Assessments | Good String by SAI UDAY KIRAN • 0
Can't we solve it using Segment Trees ?
Answer: Morgan Stanley | Online Assement by Odin • 0
I think question is wrong as in the accepted codes 5 7 1 0 -1 0 1 -1 0 2 -1 2 1 -1 1 3 -1 3 4 -1 4 0 -1 this test case gives -3 b…
Answer: Morgan Stanley | September, 2022 | Online Assessments by Deepa Pandey • 0
#include <bits/stdc++.h> using namespace std; int dp[1001][1001][2]; long long solve(vector<long long> &arr, long lo…
Answer: Morgan Stanley | Online Assement by Lokesh Wagh • 0
what about the cases where the cycles are merged?? i that case the answer regarding a single cycle will not work
Land on Leaderboard & Claim your Hamper
Start Solving Problems Now
All Problems
Contest Registration Successful!
You have successfully registered to our first ever Exclusive Contest!
We will reach out to you on your registered Email ID regarding the contest details.
Meet the Champions
Recent Votes
Recent Locations
Udupi, just now
Bengaluru, 1 minute ago
Kharagpur, 2 minutes ago
Kharagpur, 2 minutes ago
Prayagraj, 9 minutes ago
Udupi, just now Bengaluru, 1 minute ago Kharagpur, 2 minutes ago Kharagpur, 2 minutes ago Prayagraj, 9 minutes agoRecent Awards • All
Appreciated to Jeevan Ankadala • 70
Good Answer to Jeevan Ankadala • 70
Teacher to Jeevan Ankadala • 70
Appreciated to Delta 2.7k
Great Question to Delta 2.7k
Student to Akshat Chaudhary • 30
Appreciated to Delta 2.7k
Popular Question to shahinmansoori28 • 60
Commentator to Aayush Agrawal • 180
