Join Us
0 Votes | 1 Reply
9 weeks ago 
admin 1.9k
Oa Interview Questions & Experiences
AlgoPath A focused prep platform from AlgoUniversity for students who want a clearer path to interview readiness. Visit AlgoPath 0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 2 Replies
9 weeks ago admin 1.9k
0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 1 Reply
0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 2 Replies
9 weeks ago admin 1.9k
0 Votes | 1 Reply
9 weeks ago admin 1.9k
0 Votes | 1 Reply
9 weeks ago admin 1.9k
Request Recent Questions Now!
Filter Posts by Company
Amazon 109 Google 53 Oracle 52 Uber 38 Microsoft 31 Flipkart 30 GoldmanSachs 30 Cisco 27 Sprinklr 26 Walmart 24 Atlassian 23 IBM 22 deshaw 21 Infosys 21 Intuit 20 PhonePe 20 Salesforce 20 media.net 18 VISA 18 Cred 17 BNY-Mellon 16 Adobe 15 Airtel 15 CodeNation 15 PayPal 15 Paytm 15 Razorpay 14 ZScaler 14 ByteDance 13 DBOI 13 Zomato 13 Accenture 12 TCS 12 Capgemini 11 Linkedin 11 Nvidia 11 Publicis-Sapient 11 ServiceNow 11 Swiggy 11 Barclays 10 Meesho 10 Sigmoid 10 wipro 10 Amadeus 9 Cognizant 9 Samsung 9 Confluent 8 HCL 8 Hexaware 8 Persistent 8 Rubrik 8 arcesium 7 Increff 7 Juspay 7 saplabs 7 standard-chartered 7 Tredence 7 curefit 6 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 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: PayPal OA Question 2024 April | Matrix | on-campus by Pravardhan Aare • 0
Solution: Rotate Image — Transpose & Flip Approach Rotating an n x n matrix 90 degrees clockwise in-place can be broken dow…
Answer: ServiceNow OA Question 2024 May | Trees | on-campus by Pravardhan Aare • 0
Solution: Lowest Common Ancestor — Recursive Depth First Search Approach We can solve this problem recursively by traversing th…
Answer: Adobe OA Question 2024 March | Dynamic Programming | on-campus by Pravardhan Aare • 0
Solution : Coin Change — Dynamic Programming Approach This is a classic optimization problem that can be solved using **Dynamic…
Answer: Google OA Question 2024 February | Monotonic Stack | on-campus by Pravardhan Aare • 0
Solution : Daily Temperatures — Monotonic Stack Approach A naive approach of checking future days for each index takes O(N2) ti…
Answer: Oracle OA Question 2024 June | Graphs & Topological Sort | on-campus by Pravardhan Aare • 0
Solution : Course Schedule II — Kahn's Algorithm (BFS) Approach This problem can be modeled as finding a topological sort o…
Answer: Amazon OA Question 2024 May | Heap & Quickselect | on-campus by Pravardhan Aare • 0
Solution : Kth Largest Element — Min-Heap Approach While sorting the array takes O(N log N) time, we can optimize this using a …
Answer: Microsoft OA Question 2024 April | Trees & BFS | on-campus by Pravardhan Aare • 0
Solution 1: Binary Tree Level Order Traversal — BFS Traversal Approach We can solve this problem using a Breadth-First Search (…
Answer: BYJU'S TUTOR PLUS Hiring | On-Campus OA (2024) | Count the Digits That Divide a by Padala Indira Bhavani • 0
Approach Store the original number. Extract digits one by one using modulo operation. Ignore digit 0. If num % digit == 0, incr…
Answer: FIBE (EARLY SALARY) Hiring Challenge | Off-Campus | OA (2024) by Padala Indira Bhavani • 0
Approach Use a HashMap to store frequencies of previously seen numbers. For each number: Check how many times (num - k) appeare…
Answer: INSTAMOJO Online Assessment Interview Question | On-Campus(2024) by Padala Indira Bhavani • 0
Approach For every rectangle, reduce its ratio using GCD. Store the reduced ratio in a HashMap. If the same ratio has appeared be…
Answer: AMEYO Hiring Challenge | Online Assessment Question | Off-Campus (2024) by Padala Indira Bhavani • 0
Approach Instead of creating large concatenated strings, compare characters directly using two pointers. Maintain: Current word…
Answer: EASYREWARDZ On-Campus OA (2024) | Minimum Average Difference by Padala Indira Bhavani • 0
Approach Compute: Total sum of array Running prefix sum For every index: leftAvg = prefixSum / (i + 1) rightAvg = (to…
Answer: PROGCAP Hiring | Off-Campus OA (2024) | Count Number of Texts by Padala Indira Bhavani • 0
Approach Use Dynamic Programming. Let: dp[i] represent the number of ways to decode the first i characters. For every posi…
Answer: SQUADSTACK Hiring Challenge | Interview Question | On-Campus OA (2023) by Padala Indira Bhavani • 0
Approach Let: dp[i] = number of ways to reach stair i For stair i, the last jump could be: 1 step from i-1 2 steps from …
Answer: SERVIFY Hiring | Number of Common Factors | Off-Campus OA (2023) by Padala Indira Bhavani • 0
Approach A number that divides both a and b must also divide their Greatest Common Divisor (GCD). Therefore: Find gcd(a, b). …
Land on Leaderboard & Claim your Hamper
Start Solving Problems Now
All Problems
Recent Votes
Recent Locations
Hubballi, just now
Hyderabad, 13 minutes ago
Bengaluru, 1 hour ago
Abu Dhabi, 2 hours ago
Bengaluru, 5 hours ago
Hubballi, just now Hyderabad, 13 minutes ago Bengaluru, 1 hour ago Abu Dhabi, 2 hours ago Bengaluru, 5 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
