Join Us
0 Votes | 1 Reply
2.7 years ago 
Delta 3.0k
AlgoPath A focused prep platform from AlgoUniversity for students who want a clearer path to interview readiness. Visit AlgoPath 1 Vote | 1 Reply
2.7 years ago Delta 3.0k
1 Vote | 3 Replies
2.7 years ago Delta 3.0k
1 Vote | 0 Replies
2.8 years ago 
PoGo 2.5k
1 Vote | 1 Reply
2.8 years ago PoGo 2.5k
1 Vote | 1 Reply
2.8 years ago PoGo 2.5k
3 Votes | 2 Replies
2.8 years ago PoGo 2.5k
3 Votes | 4 Replies
2.8 years ago PoGo 2.5k
6 Votes | 2 Replies
2.8 years ago PoGo 2.5k
3 Votes | 2 Replies
2.8 years ago Delta 3.0k
0 Votes | 1 Reply
2.8 years ago Delta 3.0k
8 Votes | 1 Reply
2.9 years ago Delta 3.0k
11 Votes | 7 Replies
3.5 years ago 
Aayush kumar singh • 20
8 Votes | 4 Replies
3.5 years ago 
Prakhar Dubey • 40
5 Votes | 2 Replies
3 Votes | 2 Replies
1 Vote | 4 Replies
3.7 years ago 
John 1.0k
3 Votes | 6 Replies
3.7 years ago John 1.0k
4 Votes | 3 Replies
3.7 years ago John 1.0k
12 Votes | 3 Replies
3.7 years ago 
admin 1.9k
7 Votes | 0 Replies
3.7 years ago 
luckyjain1271 • 170
0 Votes | 0 Replies
3.8 years ago 
messiah 150
7 Votes | 0 Replies
3.8 years ago 
Raghavendra • 140
5 Votes | 0 Replies
4 Votes | 5 Replies
3.8 years ago 
papa 430
1 Vote | 1 Reply
3.8 years ago papa 430
6 Votes | 2 Replies
4.9 years ago admin 1.9k
6 Votes | 1 Reply
5.2 years ago admin 1.9k
0 Votes | 0 Replies
5.3 years ago 
mrinal.shashwat • 30
2 Votes | 0 Replies
5.7 years ago 
Shubhendu Goel • 450
4 Votes | 0 Replies
5.7 years ago Shubhendu Goel • 450
2 Votes | 0 Replies
5.7 years ago Shubhendu Goel • 450
4 Votes | 0 Replies
5.7 years ago Shubhendu Goel • 450
Request Recent Questions Now!
Filter Posts by Company
Amazon 105 Google 49 Oracle 45 Uber 30 Microsoft 29 Flipkart 27 GoldmanSachs 27 Sprinklr 23 Cisco 22 Walmart 21 deshaw 20 IBM 19 PhonePe 19 Atlassian 18 Infosys 18 media.net 17 VISA 17 BNY-Mellon 16 Intuit 15 Airtel 14 CodeNation 14 Salesforce 14 DBOI 13 Paytm 13 ZScaler 13 Cred 12 Adobe 11 ByteDance 11 TCS 11 Zomato 11 PayPal 10 Publicis-Sapient 10 Razorpay 10 Accenture 9 Barclays 9 Linkedin 9 Rubrik 8 Amadeus 7 Capgemini 7 HCL 7 Increff 7 Meesho 7 saplabs 7 Sigmoid 7 Swiggy 7 Tredence 7 arcesium 6 Deloitte 6 GEDigital 6 Juspay 6 Nvidia 6 Samsung 6 standard-chartered 6 TVS 6 American-Express 5 Apollo 5 Cognizant 5 Confluent 5 curefit 5 graviton 5 HSBC 5 Jaguar 5 JP-Morgan 5 Mastercard 5 Morgan-Stanley 5 Navi 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 makemytrip 4 Qualcomm 4 Tiktok 4 AMD 3 Appdynamics 3 AQR 3 British-Telecom 3 CapitalOne 3 Contlo 3 Goldman-Sachs 3 Hugosave 3 Jio 3 Mathworks 3 Mercari 3 Nagarro 3 OYO 3 Piramal 3 ringcentral 3 Rippling 3 Siemens 3 Tekion 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 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 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: GROWW SDE1 OA (2023) | Custom HashMap Design Using Separate Chaining by Padala Indira Bhavani • 0
Strategy A HashMap stores key-value pairs using a hash function. Steps Create a fixed number of buckets. Use modulo operation…
Answer: Dunzo SDE OA (2022) | Job Scheduling, Binary Search on Answer, and Backtracking by Padala Indira Bhavani • 0
Approach This problem is a combination of: Binary Search on Answer Backtracking Pruning Instead of directly finding the o…
Answer: Meesho SDE-1 OA (2023) | Tree Traversal, DFS, and Path Based Node Evaluation Pro by Padala Indira Bhavani • 0
Approach The key observation is that while traversing from the root to any node, we need to know the maximum value seen so far on that p…
Answer: CRED SDE OA (2023) | Interval Dynamic Programming Optimization and Cost Minimiza by Padala Indira Bhavani • 0
Approach This is a classic Interval Dynamic Programming problem. A greedy approach does not work because making a cut changes the siz…
Answer: Nutanix SWE OA (2023) | Binary Search Tree Validation and Tree Recovery Intervie by Padala Indira Bhavani • 0
Approach A Binary Search Tree follows: Left Subtree < Root < Right Subtree When performing an inorder traversal of a BST, …
Answer: JPMorgan Chase SWE OA (2023) | Binary Search Partitioning and Optimized Array Pr by Padala Indira Bhavani • 0
Approach A straightforward solution would be: Merge both arrays. Find the median. However, merging requires: O(m + n) …
Answer: VMWARE MTS OA (2023) | Graph Connectivity Optimization Using Greedy Algorithms a by Padala Indira Bhavani • 0
Approach A Minimum Spanning Tree is a subset of edges that: Connects all vertices. Contains no cycles. Has minimum t…
Answer: RAZORPAY SDE-1 OA (2022) | Prefix Sum Optimization and Computational Geometry Ba by Padala Indira Bhavani • 0
Q1: Approach Using brute force: Generate every subarray Calculate its sum Check if it lies in range Complexity: O(n²) …
Answer: ADOBE MTS | Heap-Based Interval Processing and Offline Query Optimization | On by Padala Indira Bhavani • 0
Approach A brute-force approach would check every interval for every query: O(N × Q) which is too slow. Instead, we use: …
Answer: SALESFORCE | Disjoint Set Union and Graph Connectivity Analysis | SWE OA 2022 by Padala Indira Bhavani • 0
Approach This problem can be solved efficiently using the Disjoint Set Union (DSU) data structure, also known as Union-Find. Key Idea…
Answer: STRIPE SWE OA (2022) | Optimized Array Traversal and Circular Sequence Sum Maxim by Padala Indira Bhavani • 0
Approach There are two possible answers: Case 1: Normal Maximum Subarray The maximum subarray does not wrap around. This can be…
Answer: Google SDE Interview Questions- 2025 January| Monotonic Stacks (2-in-1 Combo) |O by Pravardhan Aare • 0
Solutions for Question 1: Largest Rectangle in Histogram Approach: Monotonic Increasing Stack A bar can expand left and right to form…
Answer: Amazon SDE Interview Question 2024-February | Advanced Backtracking | On-campus by Pravardhan Aare • 0
Solution for Question 1: N-Queens Approach: Backtracking with State Arrays We place exactly one queen per row. The challenge is verif…
Answer: Facebook SDE Interview Question 2023-March | Dynamic Programming & Backtracking by Pravardhan Aare • 0
Solution for Question 1: Word Break II Approach: Memoized Depth First Search (DFS) Because we need to return ALL possible valid sente…
Answer: Apple SDE ll Interview Question 2024-January | Computational Geometry | Off-camp by Pravardhan Aare • 0
Solution for Question 1: Max Points on a Line Approach: Slope Calculation + HashMap String Encoding To determine if points lie on the…
Land on Leaderboard & Claim your Hamper
Start Solving Problems Now
All Problems
Recent Votes
Recent Locations
Islington, 6 hours ago
Bokaro, 7 hours ago
Pune, 7 hours ago
Pune, 9 hours ago
Hyderabad, 10 hours ago
Islington, 6 hours ago Bokaro, 7 hours ago Pune, 7 hours ago Pune, 9 hours ago Hyderabad, 10 hours agoRecent Awards • All
Centurion to Sahil Jain • 0
Centurion to Padala Indira Bhavani • 0
Centurion to Pravardhan Aare • 0
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
