Join Us
25 Votes | 14 Replies
20 months ago 
admin 1.9k
AlgoPath A focused prep platform from AlgoUniversity for students who want a clearer path to interview readiness. Visit AlgoPath 26 Votes | 6 Replies
3.6 years ago 
Rohit • 680
50 Votes | 14 Replies
3.7 years ago 
John 1.0k
13 Votes | 4 Replies
3.8 years ago John 1.0k
7 Votes | 2 Replies
3.6 years ago Rohit • 680
0 Votes | 0 Replies
0 Votes | 1 Reply
3 minutes ago 
Padala Indira Bhavani • 0
0 Votes | 1 Reply
10 Votes | 6 Replies
3.7 years ago John 1.0k
0 Votes | 1 Reply
36 minutes ago Padala Indira Bhavani • 0
14 Votes | 10 Replies
3.6 years ago 
automata_1 • 40
0 Votes | 1 Reply
42 minutes ago Padala Indira Bhavani • 0
4 Votes | 2 Replies
0 Votes | 1 Reply
0 Votes | 1 Reply
49 minutes ago Padala Indira Bhavani • 0
0 Votes | 1 Reply
0 Votes | 1 Reply
5 hours ago Padala Indira Bhavani • 0
0 Votes | 1 Reply
6 hours ago Padala Indira Bhavani • 0
0 Votes | 1 Reply
6 hours ago Padala Indira Bhavani • 0
0 Votes | 1 Reply
6 hours ago Padala Indira Bhavani • 0
0 Votes | 1 Reply
8 hours ago 
Sahil Jain • 0
0 Votes | 1 Reply
0 Votes | 1 Reply
0 Votes | 1 Reply
9 hours ago Sahil Jain • 0
0 Votes | 1 Reply
9 hours ago Sahil Jain • 0
0 Votes | 1 Reply
0 Votes | 1 Reply
9 hours ago Sahil Jain • 0
0 Votes | 1 Reply
0 Votes | 1 Reply
0 Votes | 1 Reply
10 hours ago Sahil Jain • 0
0 Votes | 1 Reply
0 Votes | 1 Reply
10 hours ago Sahil Jain • 0
0 Votes | 1 Reply
10 hours ago Sahil Jain • 0
0 Votes | 1 Reply
10 hours ago Sahil Jain • 0
0 Votes | 1 Reply
21 hours ago 
Pravardhan Aare • 0
0 Votes | 1 Reply
Request Recent Questions Now!
Filter Posts by Company
Amazon 107 Google 52 Oracle 51 Uber 37 Flipkart 30 Microsoft 30 GoldmanSachs 29 Cisco 26 Sprinklr 26 Atlassian 23 Walmart 23 IBM 22 deshaw 21 Infosys 21 PhonePe 20 Intuit 19 Salesforce 19 media.net 18 VISA 18 BNY-Mellon 16 CodeNation 15 Cred 15 Paytm 15 Adobe 14 Airtel 14 Razorpay 14 ZScaler 14 DBOI 13 PayPal 13 Zomato 13 Accenture 12 ByteDance 12 TCS 12 Capgemini 11 Linkedin 11 Nvidia 11 Publicis-Sapient 11 Barclays 10 Sigmoid 10 Swiggy 10 wipro 10 Amadeus 9 Cognizant 9 Meesho 9 Samsung 9 ServiceNow 9 HCL 8 Hexaware 8 Persistent 8 Rubrik 8 arcesium 7 Confluent 7 Increff 7 Juspay 7 saplabs 7 standard-chartered 7 Tredence 7 Deloitte 6 GEDigital 6 HSBC 6 makemytrip 6 Mastercard 6 Qualcomm 6 Siemens 6 thoughtspot 6 TVS 6 AMD 5 American-Express 5 Apollo 5 Citadel 5 CITI 5 curefit 5 Directi 5 graviton 5 Jaguar 5 Jio 5 JP-Morgan 5 Juniper 5 Morgan-Stanley 5 Navi 5 Tiktok 5 uipath 5 Wells-Fargo 5 Alphagrep 4 AQR 4 Avalara 4 Blackrock 4 Goldman-Sachs 4 Hilabs 4 LTI 4 Nagarro 4 Optum 4 Rippling 4 Tekion 4 Zepto 4 Appdynamics 3 British-Telecom 3 CapitalOne 3 Contlo 3 Hugosave 3 Mathworks 3 Mercari 3 OYO 3 Piramal 3 ringcentral 3 Slice 3 Trilogy-Innovations 3 urbancompany 3 Veritas 3 Virtusa 3 Air-India 2 Arzoo 2 BP 2 Celigo 2 Chalo 2 Chargebee 2 Dassault-Systems 2 DevRev 2 DXC-Technology 2 Edfora 2 Edgeverve 2 Gameskraft 2 Intel 2 Irage 2 MAQ-Software 2 MotorQ 2 Palo-Alto-Networks 2 Rakuten 2 relevel 2 Schrodinger 2 shopconnect 2 Tiger-Analytics 2 USTD3 2 Wissen-Technology 2 Audify-Tech 1 Bhanzu 1 Cogoport 1 colortokens 1 Credit-Suisse 1 darwinbox 1 Dpworld 1 Factset 1 Kickdrum 1 Morphel 1 Natwest 1 Niro-Money 1 Notion 1 Observe.ai 1 Pine-Labs 1 Prograd 1 QuantBox 1 Societe-Generale 1 Tech-Mahindra 1 Tibra 1 Trianz-Digital 1 Truminds 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 Qburst 0 Steradian-Semiconductors 0 Toshiba 0
Recent Replies
Answer: SIMPL Off-Campus Hiring | Maximum Erasure Value | OA (2023) by Padala Indira Bhavani • 0
Approach Use a Sliding Window + HashMap approach. Maintain a window containing only unique elements. Store the last occurrence i…
Answer: JUSPAY Hiring | Problem Count Ways to Build Good Strings | On-Campus OA (2023) by Padala Indira Bhavani • 0
Approach This problem is a Dynamic Programming (DP) problem. Let: dp[i] represent the number of ways to build a string of len…
Answer: CAPILLARY TECHNOLOGIES | Smallest Value of the Rearranged Number | On-Campus OA by Padala Indira Bhavani • 0
Approach The problem can be divided into two cases. Case 1: Positive Number To obtain the smallest positive number: Extract …
Answer: LIMEROAD Hiring On-Campus OA (2022)| Problem Design HashMap Without Built-in Ha by Padala Indira Bhavani • 0
Approach A HashMap stores key-value pairs using a hashing mechanism. Since built-in HashMap usage is not allowed, we can implement ou…
Answer: CURRENCY CLOUD | Off-Campus OA (2022) | Maximum Difference Between Node and Ance by Padala Indira Bhavani • 0
Approach For every node, we need to know: Minimum value encountered from root to current node. Maximum value encountered from ro…
Answer: INMOBI Hiring Off-Campus OA (2022) | Problem Average Waiting Time by Padala Indira Bhavani • 0
Approach We simulate the chef's work. For each customer: Case 1: Chef is idle If the customer arrives after the chef become…
Answer: ZOHO CORP Hiring On-Campus OA (2022) | Problem Sum of Digits in Base K by Padala Indira Bhavani • 0
Approach To convert a decimal number into another base: Repeatedly divide the number by k. The remainder obtained at each step b…
Answer: CLEVERTAP Hiring | Check if Number Has Equal Digit Count and Digit Value | Off-C by Padala Indira Bhavani • 0
Approach Since the string length is at most 10, we can directly count the frequency of every digit. Steps Create a frequency ar…
Answer: POSTMAN Hiring Off-Campus | Find All Groups of Farmland Question | OA(2022) by Padala Indira Bhavani • 0
Approach Whenever we encounter a farmland cell (1), it represents the top-left corner of a new farmland group. Since every farmland r…
Answer: SHARECHAT Hiring On-Campus OA (2021) | Problem Longest ZigZag Path in a Binary by Padala Indira Bhavani • 0
Approach This problem can be solved efficiently using Depth First Search (DFS). At every node: If the previous move was left, t…
Answer: UNACADEMY Hiring Off-Campus OA (2021) Problem Maximum Number of Vowels in a Sub by Padala Indira Bhavani • 0
Approach A brute-force approach would check every substring of length k and count vowels inside it. This would require: O(n × k)…
Answer: BROWSERSTACK Hiring On-Campus OA (2021) | Problem Bulls and Cows by Padala Indira Bhavani • 0
Approach The problem requires counting: Bulls → matching digit at the same position. Cows → matching digits at differe…
Answer: Databricks SDE OA 2025 | Petabyte Scale Dot Product & Spark Cluster Job Executio by Sahil Jain • 0
Solution - Petabyte Scale Dot Product Strategy Since both sparse vectors are already sorted by index, use the Two Pointer technique t…
Answer: OpenAI MTS OA 2026 | Transactional Key Value Store & Token Context Window Utiliz by Sahil Jain • 0
Solution - Transactional Key Value Store Strategy Maintain a stack of hash maps where each map represents a transaction layer. The…
Answer: CoinDCX SDE OA 2025 | Suspicious Transaction Ring & Smart Contract Ledger by Sahil Jain • 0
Solution - Suspicious Transaction Ring Strategy Model wallet transfers as a directed graph and detect whether any cycle exists. Ap…
Land on Leaderboard & Claim your Hamper
Start Solving Problems Now
All Problems
Recent Votes
Recent Locations
Hyderabad, just now
Patna, 8 minutes ago
Bengaluru, 34 minutes ago
Indore, 1 hour ago
Ghaziabad, 4 hours ago
Hyderabad, just now Patna, 8 minutes ago Bengaluru, 34 minutes ago Indore, 1 hour ago Ghaziabad, 4 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
