Latest
Topics
Tags
News
Jobs
Tutorials
Forum
Join Us
Community
Problems
New Post
AlgoPath
Log In
New Post
AlgoPath
Latest
News
Jobs
Tutorials
Forum
Tags
Planet
Users
Log In
Sign Up
REGISTER NOW
Register Now
Request Recent Questions Now!
AlgoPath
A focused prep platform from AlgoUniversity for students who want a clearer path to interview readiness.
Visit AlgoPath
Limit to: all time
all time
today
this week
this month
this year
5 results • Page
1 of 1
Sort by: Default
Default
Post Creation date
Recent Activity
Views
Votes
Replies
Showing :
Oncampus
•
reset
1
Vote
0
Replies
85
Views
Zomato OA 2024
1 Vote | 0 Replies
oncampus
coding-round
2024
22 months ago
hiiiii
• 10
0
Votes
3
Replies
7.2k
Views
Capital One, Interview Experience , oncampus
0 Votes | 3 Replies
capitalone
free-public-post
interview
oncampus
2022
3.5 years ago
Anonymous
• 0
0
Votes
0
Replies
3.3k
Views
Oncampus Publicis Sapient ASDE-1 FTE experience
0 Votes | 0 Replies
free-public-post
Oncampus
publicis-sapient
2022
ASDE
3.5 years ago
Aayush kumar singh
• 20
5
Votes
1
Reply
70
Views
Microsoft Interview Experience & Questions - Oncampus 2022
5 Votes | 1 Reply
microsoft
oncampus
3.9 years ago
papa
430
2
Votes
0
Replies
126
Views
Amazon Coding Round - Oncampus 2022
2 Votes | 0 Replies
oncampus
amazon
2023
3.9 years ago
papa
430
5 results • Page
1 of 1
Request Recent Questions Now!
Filter Posts by Company
Amazon
103
Google
45
Oracle
45
Uber
28
GoldmanSachs
27
Microsoft
27
Flipkart
25
Sprinklr
22
Cisco
21
deshaw
20
Walmart
20
IBM
19
Atlassian
17
Infosys
17
PhonePe
17
VISA
17
BNY-Mellon
16
media.net
16
Airtel
14
CodeNation
14
DBOI
13
Intuit
13
Paytm
13
ZScaler
13
Salesforce
12
ByteDance
11
Cred
11
Zomato
11
Adobe
10
PayPal
10
Publicis-Sapient
10
Razorpay
10
TCS
10
Barclays
9
Accenture
8
Rubrik
8
Amadeus
7
Capgemini
7
HCL
7
Increff
7
Linkedin
7
saplabs
7
Sigmoid
7
Swiggy
7
Tredence
7
Deloitte
6
GEDigital
6
Juspay
6
Nvidia
6
Samsung
6
standard-chartered
6
TVS
6
American-Express
5
Apollo
5
arcesium
5
Cognizant
5
Confluent
5
curefit
5
graviton
5
HSBC
5
Jaguar
5
JP-Morgan
5
Mastercard
5
Meesho
5
Morgan-Stanley
5
ServiceNow
5
thoughtspot
5
uipath
5
Wells-Fargo
5
wipro
5
Alphagrep
4
Avalara
4
CITI
4
Directi
4
Hexaware
4
Hilabs
4
Juniper
4
Navi
4
Qualcomm
4
Tiktok
4
AMD
3
Appdynamics
3
AQR
3
British-Telecom
3
CapitalOne
3
Contlo
3
Hugosave
3
Jio
3
makemytrip
3
Mathworks
3
Mercari
3
Nagarro
3
OYO
3
Piramal
3
ringcentral
3
Rippling
3
Siemens
3
Trilogy-Innovations
3
urbancompany
3
Zepto
3
Air-India
2
Arzoo
2
Blackrock
2
BP
2
Celigo
2
Chalo
2
Citadel
2
Dassault-Systems
2
DevRev
2
DXC-Technology
2
Edfora
2
Edgeverve
2
Gameskraft
2
Goldman-Sachs
2
Irage
2
LTI
2
MAQ-Software
2
MotorQ
2
Optum
2
Palo-Alto-Networks
2
Persistent
2
relevel
2
Schrodinger
2
shopconnect
2
Slice
2
Tekion
2
Tiger-Analytics
2
USTD3
2
Virtusa
2
Wissen-Technology
2
Audify-Tech
1
Bhanzu
1
Chargebee
1
Cogoport
1
colortokens
1
Credit-Suisse
1
darwinbox
1
Dpworld
1
Factset
1
Intel
1
Kickdrum
1
Morphel
1
Natwest
1
Niro-Money
1
Observe.ai
1
Pine-Labs
1
Prograd
1
QuantBox
1
Rakuten
1
Societe-Generale
1
Tech-Mahindra
1
Tibra
1
Trianz-Digital
1
Truminds
1
Veritas
1
Webstaff
1
Winzo
1
Bank-of-America
0
Flexcar
0
Hitachi
0
Hudson-River-Trading
0
Medianet
0
Mentor-Graphics
0
Newfold - Digital
0
Notion
0
Qburst
0
Steradian-Semiconductors
0
Toshiba
0
Recent Replies
Answer: Cracking the SDE Interview | Amazon & Microsoft Favorites
by
Pravardhan Aare
• 0
Solutions for Question 1: Detect and Remove Loop Approach: Floyd's Cycle-Finding Algorithm (Tortoise & Hare) This is one of t…
Answer: Palantir 2026-February| Hard CP | Tries & Manacher's Algorithm | On-campus
by
Pravardhan Aare
• 0
Solution for Question 1: Maximum XOR Subarray Approach: Prefix XOR + Trie (Prefix Tree) A brute force O(N^2) subarray check will TLE.…
Answer: Infosys 2025-December | CP | Strongly Connected Components | On-campus
by
Pravardhan Aare
• 0
Solution for Question 1: Flight Routes Check Approach: Kosaraju's Algorithm (Strongly Connected Components) The problem asks if t…
Answer: Rubrik 2022-August | Tree Flattening & Segment Trees | Hard-CP
by
Pravardhan Aare
• 0
Solution for Question 1: Subtree Sum Queries Approach: Euler Tour (Tree Flattening) + Fenwick Tree A brute-force DFS to calculate the…
Answer: Google 2024-March | Hard CP | KMP Algorithm & LPS Arrays
by
Pravardhan Aare
• 0
Solution for Question 1: The Secret Password Approach: KMP Algorithm (Longest Prefix Suffix Array) Using nested loops and substring()…
Answer: Atlassian 2023-January| Hard CP | Digit DP (Dynamic Programming)
by
Pravardhan Aare
• 0
Solution for Question 1: Prime Sum Numbers Approach: Digit Dynamic Programming A brute-force loop iterating from L to R and checking …
Answer: Amazon 2025-November | CP | Lowest Common Ancestor (Binary Lifting)
by
Pravardhan Aare
• 0
Solution for Question 1: Lowest Common Ancestor Approach: Binary Lifting Table O(log N) A naive approach involves using a DFS to find…
Answer: Uber 2023-March | Fenwick Trees & Coordinate Compression
by
Pravardhan Aare
• 0
Solution for Question 1: Global Inversions Approach: Fenwick Tree (BIT) with Coordinate Compression A brute-force double loop will ta…
Answer: Directi 2025-February | Tries & Maximum Bitwise XOR | On-campus
by
Pravardhan Aare
• 0
Solution for Question 1: Maximum XOR of Two Numbers Approach: Trie (Prefix Tree) + Greedy Bit Matching A brute-force O(N^2) double lo…
Answer: Media.net 2026-January | Segment Trees | On-campus
by
Pravardhan Aare
• 0
Solution for Question 1: Maximum Subarray Sum Queries Approach: Advanced Segment Tree (Merging 4 States) This is a classic Hard level…
Answer: Zepto OA On-Campus 2025 | Dark Store Rider Shift Optimization & Supply Chain Rou
by
Sahil Jain
• 0
Solution 1 - Dark Store Rider Shift Optimization Strategy The minimum number of riders required is exactly the maximum number of orders a…
Answer: Groww SDE-1 Online Assessment 2025 | Target Dividend Compliant Windows & Maximiz
by
Sahil Jain
• 0
Solution 1 - Target Dividend Compliant Windows Strategy Since all returns are strictly positive, the window sum changes monotonically as …
Answer: Park+ SDE-1 Online Assessment 2025 | Peak Parking Lot Occupancy & Smart EV Charg
by
Sahil Jain
• 0
Solution 1 - Peak Parking Lot Occupancy Strategy The parking lot occupancy changes only when a vehicle arrives or departs. Instead of…
Answer: Uber SDE-1 Online Assessment 2025 | Dynamic Dispatch Fare Window & Autonomous Fr
by
Sahil Jain
• 0
Solution 1 - Dynamic Dispatch Fare Window Strategy A valid segment must satisfy two independent constraints: Every consecutive fare di…
Answer: PhonePe SDE-1 Online Assessment 2025 | Continuous Stable Transaction Volume & De
by
Sahil Jain
• 0
Solution 1 - Continuous Stable Transaction Volume Strategy The condition requires that the difference between the maximum and minimum…
Land on Leaderboard & Claim your Hamper
Start Solving Problems Now
All Problems
Top Problem Solvers
Claim your TJO hamper 🎁
Loading...
This Month
Recent Votes
Tensor School of CS and AI - Interview Experience (In-Person, Hyderabad)
AlgoUniversity Technology Fellowship: Stage 2 || Important Questions
Flipkart | October, 2022 | Interview Questions
TCS | Online Assessments | Deleting Channel
MediaNet, Recently Asked Online Assessments in October, 2022 | Omega Primes | Fruits on Tree | Damaged Roads
Tensor School of CS and AI - Interview Experience (In-Person, Hyderabad)
How to get Premium Access?
Amazon, Recently Asked Online Assessments in 27 Aug, 2025 | Single Sign-On Security Code | Lexicographical Binary Strings | HackerRank Coding Assessment |
Comment: Amazon | Recent Online Assessment 2026 | Priority Bug Sorting | Package Prefix D
Comment: Amazon | Recent Online Assessment 2026 | Priority Bug Sorting | Package Prefix D
Recent Locations
Kochi,
just now
Hyderabad,
just now
Santa Cruz,
1 hour ago
Bengaluru,
2 hours ago
Hyderabad,
3 hours ago
Recent Awards
• All
Rising Star
to
Sahil Jain
• 0
Rising Star
to
Padala Indira Bhavani
• 0
Rising Star
to
Pravardhan Aare
• 0
Appreciated
to
Ayush Gangwani
1.3k
Great Question
to
papa
430
Teacher
to
Apna_time _aayega
• 60
Great Question
to
admin
1.9k
Rising Star
to
Rohit
• 40
Scholar
to
Sarthak
• 10
Scholar
to
Rohit
• 40
1