Join Us
8 Votes | 2 Replies
2.8 years ago 
John 950
3 Votes | 5 Replies
2.8 years ago 
prateekin • 40
2 Votes | 1 Reply
2.8 years ago John 950
7 Votes | 6 Replies
2.8 years ago John 950
0 Votes | 5 Replies
2.8 years ago John 950
0 Votes | 2 Replies
2.8 years ago John 950
11 Votes | 5 Replies
2.8 years ago John 950
0 Votes | 4 Replies
2.8 years ago John 950
11 Votes | 10 Replies
2.8 years ago John 950
8 Votes | 7 Replies
2.8 years ago John 950
21 Votes | 7 Replies
2.8 years ago John 950
4 Votes | 3 Replies
2.8 years ago John 950
7 Votes | 4 Replies
2.9 years ago John 950
5 Votes | 3 Replies
2.9 years ago John 950
8 Votes | 2 Replies
2.9 years ago John 950
12 Votes | 3 Replies
2.9 years ago 
admin 1.7k
1 Vote | 0 Replies
2.9 years ago 
namansingh.singh9 • 30
0 Votes | 0 Replies
2.9 years ago 
messiah 150
1 Vote | 0 Replies
2.9 years ago 
Ritik17 • 10
0 Votes | 0 Replies
2.9 years ago messiah 150
4 Votes | 1 Reply
2.9 years ago messiah 150
4 Votes | 5 Replies
2.9 years ago 
agrawaldev1112 • 70
5 Votes | 0 Replies
2.9 years ago messiah 150
2 Votes | 0 Replies
3.0 years ago 
justiceleaguer006 • 20
4 Votes | 5 Replies
3.0 years ago 
papa 410
1 Vote | 1 Reply
3.0 years ago papa 410
10 Votes | 2 Replies
3.0 years ago papa 410
9 Votes | 4 Replies
3.0 years ago papa 410
0 Votes | 0 Replies
3.0 years ago papa 410
1 Vote | 0 Replies
3.0 years ago 
luckyjain1271 • 170
4 Votes | 3 Replies
3.0 years ago 
mod2 870
1 Vote | 2 Replies
3.1 years ago admin 1.7k
8 Votes | 0 Replies
10 months ago admin 1.7k
2 Votes | 0 Replies
3.8 years ago 
Viren Khatri • 50
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: Question from my last OA, Infeneon by Vatsal Patel • 0
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…
Answer: Oracle | 13th October | Online Assessments | Decrypt by .. • 0
#include <bits/stdc++.h> using namespace std; #define int long long void solve(){ int n; cin>>n; …
Answer: Intuit OA | Furious Dhoni | Lost In The Woods | Credential Verification - I | S by ANIRUDH • 0
Problem-2 LOST IN THE WOODS This problem requires generating a navigation signal string to guide a person named Bob from a starting point …
Answer: Intuit OA | Furious Dhoni | Lost In The Woods | Credential Verification - I | S by ANIRUDH • 0
Problem-1 FURIOUS-DHONI In this problem, we are given an NtimesM grid of integer values. The goal is to find the maximum possible score …
Answer: Barclays | 12th October | Online Assessments | The Chemist | Maximum Partition | by HEET KEYUR SHAH • 0
QUESTION 1 #include <bits/stdc++.h> using namespace std; void solve(){ in…
Answer: Amazon | SDE | 25 November by Suryansh Rishit • 0
Approach The task is to replace all spaces in a string with %20 considering only the first trueLength characters. We iterate through th…
Answer: Amazon | OA 2020 | Shortest Distance Between Robots | August 19, 2020 by Suryansh Rishit • 0
Approach We need to find the smallest squared distance between any two robots in a 2D plane. A brute force approach would check all pairs,…
Answer: Uipath, Online Assessment (IIT Roorkee) | Maximum Common Companies | Grouping Ma by Srivarsha • 20
Solution for Common Companies: Approach: Reading Input : Read all edges as (u, v, company) into edges[]. …
Answer: Uber OA | IIT Madras | SWE Internship | 2023 by ANIRUDH • 0
Problem 1: Binary Cafeteria Solution: Mathematical Approach This is a combinatorial counting problem with a unique property that simp…
Comment: BNY Mellon, Recently asked online assessment question (23rd September 2023) | BI by Vaibhav Aryan • 0
n
Answer: AlgoUniversity Technology Fellowship: Stage 2 || Important Questions by Vatsal Patel • 0
Approach: Problem 1: K Closest Approach 1 (Easy) : - Time Complexity: O(N Log N) - Auxiliary Space Complexity: O(N) - Steps: …
Answer: Airtel, Recently Asked Online Assessment Question (28th September 2023) | Specia by Suryansh Rishit • 0
Speacial Array Approach The problem asks us to determine if a sequence is "special" - meaning no two adjacent numbers have …
Answer: Amazon Hackon, Online Assessment Questions (28th September 2023) | Magic Vowels by Suryansh Rishit • 0
Problem-1 : Approach : We need to process the string and identify groups of consecutive vowels. For each such group: If it…
Answer: Uber | 6 Months Internship Dirve | Maximum MEX | Minimum Time to Reach Bottom of by ANIRUDH • 0
Problem-2: Maximizing MEX In this problem, we are given an integer array a of size n and a non-negative integer m, representing the numb…
Comment: Zepto, Recently Asked On-Campus Questions in IITs, October 2022 | A Sum of Coins by Hrishabh Patel • 10
But for this we will be needing 1e8 size vector as i<=1e3 j<=100 and rem<=1e3
Land on Leaderboard & Claim your Hamper
Start Solving Problems Now
All Problems
Recent Votes
Recent Locations
Varanasi, 10 minutes ago
Chennai, 4 hours ago
Guwahati, 4 hours ago
Varanasi, 4 hours ago
Indore, 4 hours ago
Varanasi, 10 minutes ago Chennai, 4 hours ago Guwahati, 4 hours ago Varanasi, 4 hours ago Indore, 4 hours agoRecent Awards • All
Great Question to aditya.aggarwal393 • 20
Teacher to Ashutosh Saini • 30
Great Question to John 950
Great Question to John 950
Appreciated to admin 1.7k
Great Question to John 950
Great Question to John 950
Great Question to admin 1.7k
Great Question to xINFERNOx • 40
Appreciated to PoGo 2.4k
