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
2 hours ago 
Sahil Jain • 0
0 Votes | 1 Reply
10 Votes | 6 Replies
3.7 years ago John 1.0k
0 Votes | 1 Reply
14 Votes | 10 Replies
3.6 years ago 
automata_1 • 40
0 Votes | 1 Reply
4 hours ago 
Padala Indira Bhavani • 0
4 Votes | 2 Replies
0 Votes | 1 Reply
4 hours ago Padala Indira Bhavani • 0
0 Votes | 1 Reply
0 Votes | 1 Reply
4 hours ago Padala Indira Bhavani • 0
0 Votes | 1 Reply
4 hours ago Padala Indira Bhavani • 0
0 Votes | 1 Reply
0 Votes | 1 Reply
6 hours ago Padala Indira Bhavani • 0
0 Votes | 1 Reply
0 Votes | 1 Reply
6 hours ago Padala Indira Bhavani • 0
0 Votes | 1 Reply
0 Votes | 1 Reply
6 hours ago Padala Indira Bhavani • 0
0 Votes | 1 Reply
7 hours ago Padala Indira Bhavani • 0
0 Votes | 1 Reply
0 Votes | 1 Reply
22 hours ago 
Pravardhan Aare • 0
0 Votes | 1 Reply
22 hours ago Pravardhan Aare • 0
0 Votes | 1 Reply
22 hours ago Pravardhan Aare • 0
0 Votes | 1 Reply
22 hours ago Pravardhan Aare • 0
0 Votes | 1 Reply
22 hours ago Pravardhan Aare • 0
0 Votes | 1 Reply
22 hours ago Pravardhan Aare • 0
0 Votes | 1 Reply
22 hours ago Pravardhan Aare • 0
0 Votes | 1 Reply
22 hours ago Pravardhan Aare • 0
0 Votes | 1 Reply
22 hours ago Pravardhan Aare • 0
0 Votes | 1 Reply
22 hours ago Pravardhan Aare • 0
Request Recent Questions Now!
Filter Posts by Company
Amazon 108 Google 52 Oracle 51 Uber 37 Flipkart 30 GoldmanSachs 30 Microsoft 30 Cisco 27 Sprinklr 26 Walmart 24 Atlassian 23 IBM 22 deshaw 21 Infosys 21 Intuit 20 PhonePe 20 Salesforce 19 media.net 18 VISA 18 BNY-Mellon 16 Airtel 15 CodeNation 15 Cred 15 PayPal 15 Paytm 15 Adobe 14 Razorpay 14 ZScaler 14 ByteDance 13 DBOI 13 Zomato 13 Accenture 12 TCS 12 Capgemini 11 Linkedin 11 Nvidia 11 Publicis-Sapient 11 Barclays 10 ServiceNow 10 Sigmoid 10 Swiggy 10 wipro 10 Amadeus 9 Cognizant 9 Meesho 9 Samsung 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 Morgan-Stanley 6 Navi 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 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 darwinbox 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 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: ByteDance SDE OA 2025 | Viral Trend Analyzer & Optimal Video Encoding Schedule by Sahil Jain • 0
Solution - Viral Trend Analyzer Strategy A brute force approach computes the maximum for every window independently and requires O(N …
Answer: Airtel SDE OA 2025 | 5G Highway Coverage & Fiber Optic Grid Expansion by Sahil Jain • 0
Solution - 5G Highway Coverage Strategy This is a classic Merge Intervals problem. Since coordinates can be as large as 109, const…
Answer: PayPal SDE OA 2025 | Suspicious Account Clusters & Optimal Settlement Batching by Sahil Jain • 0
Solution - Suspicious Account Clusters Strategy This is a connected component problem. Since connections arrive dynamically and N can…
Answer: INNOVITI PAYMENTS Off-Campus OA (2021) | Problem Number of Arithmetic Triplets by Padala Indira Bhavani • 0
Approach Store all numbers in a HashSet. For every number n: Check whether n - diff exists. Check whether n + diff exists. …
Answer: STELLAPPS On-Campus OA (2021) | Problem Check if All A's Appear Before All B's by Padala Indira Bhavani • 0
Approach Once a 'b' is encountered, no 'a' should appear afterwards. Use a boolean flag to track whether a 'b'…
Answer: ACKO INSURANCE Hiring | Maximum Difference Between Increasing Elements | Off-Cam by Padala Indira Bhavani • 0
Approach Maintain the smallest element seen so far while traversing the array. For every element: If it is greater than the min…
Answer: LEARNBAY On-Campus OA (2025) | Problem Merge Strings Alternately by Padala Indira Bhavani • 0
Approach Use two pointers to traverse both strings simultaneously. Initialize pointers i and j at 0. Alternate characters from w…
Answer: ZUDDL Hiring Off-Campus OA (2025) | Problem Find the Difference of Two Arrays ( by Padala Indira Bhavani • 0
Approach Use two HashSets to store distinct elements from both arrays. Insert all elements of nums1 into set1. Insert all elemen…
Answer: PEPPER CONTENT Off-Campus OA (2025) | Problem Reverse Vowels of a String by Padala Indira Bhavani • 0
Approach Use the Two Pointer Technique. One pointer starts from the left. Another pointer starts from the right. Move both poi…
Answer: FACILIO On-Campus OA (2024) | Problem Count Elements With Maximum Frequency by Padala Indira Bhavani • 0
Approach Use a HashMap to count frequencies. Count occurrences of every number. Find the maximum frequency. Sum frequencies of…
Answer: DARWINBOX Off-Campus Hiring | Check Whether Two Strings are Almost Equivalent | by Padala Indira Bhavani • 0
Approach Store frequency differences directly. Increase frequency for characters in word1. Decrease frequency for characters in …
Answer: KISSFLOW Hiring | Minimum Operations to Make the Array Increasing | On-Campus OA by Padala Indira Bhavani • 0
Approach Traverse the array from left to right. For every element: If nums[i] > nums[i-1], no operation is needed. Otherwi…
Answer: EDUREKA Off-Campus Hiring OA (2024) | Problem Sum of Multiples by Padala Indira Bhavani • 0
Approach Traverse all numbers from 1 to n. For every number: If it is divisible by 3, 5, or 7, add it to the answer. Fin…
Answer: APNA OA Hiring | Smallest Even Multiple | On-Campus (2024) by Padala Indira Bhavani • 0
Approach There are only two cases: If n is already even, then n itself is divisible by both 2 and n. If n is odd, multiply it by…
Answer: PROPELLD Off-Campus OA (2024) | Problem Minimum Value to Get Positive Step-by-St by Padala Indira Bhavani • 0
Approach Instead of trying different starting values, observe that: We only need to know the minimum prefix sum encountered while …
Land on Leaderboard & Claim your Hamper
Start Solving Problems Now
All Problems
Recent Votes
Recent Locations
Hubballi, 2 hours ago
Bengaluru, 2 hours ago
Delhi, 3 hours ago
Hyderabad, 3 hours ago
Bengaluru, 4 hours ago
Hubballi, 2 hours ago Bengaluru, 2 hours ago Delhi, 3 hours ago Hyderabad, 3 hours ago Bengaluru, 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
