Join Us
0 Votes | 0 Replies
2 hours ago 
Padala Indira Bhavani • 0
AlgoPath A focused prep platform from AlgoUniversity for students who want a clearer path to interview readiness. Visit AlgoPath 0 Votes | 1 Reply
0 Votes | 1 Reply
0 Votes | 1 Reply
1 day ago 
Pravardhan Aare • 0
0 Votes | 1 Reply
0 Votes | 1 Reply
3 days ago Pravardhan Aare • 0
0 Votes | 1 Reply
4 days ago 
Sahil Jain • 0
0 Votes | 1 Reply
4 days ago Sahil Jain • 0
0 Votes | 1 Reply
4 days ago Pravardhan Aare • 0
0 Votes | 1 Reply
4 days ago Pravardhan Aare • 0
0 Votes | 1 Reply
5 days ago Pravardhan Aare • 0
0 Votes | 1 Reply
0 Votes | 1 Reply
5 days ago Pravardhan Aare • 0
0 Votes | 1 Reply
5 days ago Pravardhan Aare • 0
0 Votes | 1 Reply
5 days ago Sahil Jain • 0
0 Votes | 1 Reply
6 days ago Pravardhan Aare • 0
0 Votes | 1 Reply
6 days ago Pravardhan Aare • 0
0 Votes | 1 Reply
6 days ago Pravardhan Aare • 0
0 Votes | 1 Reply
0 Votes | 1 Reply
6 days ago Pravardhan Aare • 0
0 Votes | 1 Reply
6 days ago Sahil Jain • 0
0 Votes | 0 Replies
6 days ago Sahil Jain • 0
0 Votes | 1 Reply
7 days ago Sahil Jain • 0
Request Recent Questions Now!
Filter Posts by Company
Amazon 106 Google 51 Oracle 50 Uber 34 Flipkart 30 Microsoft 29 GoldmanSachs 28 Cisco 25 Sprinklr 25 Walmart 23 Atlassian 21 deshaw 21 IBM 21 Infosys 20 PhonePe 19 Intuit 18 VISA 18 media.net 17 Salesforce 17 BNY-Mellon 16 CodeNation 15 Paytm 15 Adobe 14 Airtel 14 Cred 14 ZScaler 14 DBOI 13 Zomato 13 Accenture 12 ByteDance 12 PayPal 12 Razorpay 12 TCS 12 Capgemini 11 Publicis-Sapient 11 Barclays 10 Linkedin 10 wipro 10 Amadeus 9 Cognizant 9 Nvidia 9 Samsung 9 Swiggy 9 HCL 8 Hexaware 8 Meesho 8 Rubrik 8 Sigmoid 8 Increff 7 saplabs 7 standard-chartered 7 Tredence 7 arcesium 6 Confluent 6 Deloitte 6 GEDigital 6 HSBC 6 Juspay 6 Mastercard 6 Persistent 6 Qualcomm 6 ServiceNow 6 Siemens 6 thoughtspot 6 TVS 6 AMD 5 American-Express 5 Apollo 5 CITI 5 curefit 5 Directi 5 graviton 5 Jaguar 5 JP-Morgan 5 Juniper 5 makemytrip 5 Morgan-Stanley 5 Navi 5 Tiktok 5 uipath 5 Wells-Fargo 5 Alphagrep 4 Avalara 4 Goldman-Sachs 4 Hilabs 4 Jio 4 LTI 4 Nagarro 4 Optum 4 Rippling 4 Zepto 4 Appdynamics 3 AQR 3 Blackrock 3 British-Telecom 3 CapitalOne 3 Citadel 3 Contlo 3 Hugosave 3 Mathworks 3 Mercari 3 OYO 3 Piramal 3 ringcentral 3 Slice 3 Tekion 3 Trilogy-Innovations 3 urbancompany 3 Virtusa 3 Air-India 2 Arzoo 2 BP 2 Celigo 2 Chalo 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 Veritas 2 Wissen-Technology 2 Audify-Tech 1 Bhanzu 1 Chargebee 1 Cogoport 1 colortokens 1 Credit-Suisse 1 darwinbox 1 Dpworld 1 Factset 1 Kickdrum 1 Morphel 1 Natwest 1 Niro-Money 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 Notion 0 Qburst 0 Steradian-Semiconductors 0 Toshiba 0
Recent Replies
Answer: TATA POWER Hiring Challenge | Count Nodes With the Highest Score Problem | On Ca by Padala Indira Bhavani • 0
Approach The score of a node depends on the sizes of the connected components formed after removing it. To calculate component sizes …
Answer: TANLA PLATFORMS Hiring | Count Words Obtained After Adding a Letter | On Campus by Padala Indira Bhavani • 0
Approach Since each word contains only lowercase letters and no duplicates, represent every word as a bitmask. For example: "abc…
Answer: AUTODESK Hiring | Maximum Product Difference Between Two Pairs | Off Campus OA ( by Padala Indira Bhavani • 0
Approach To maximize the product difference: Find the two largest numbers in the array. Find the two smallest numbers in the arr…
Answer: THOUGHTWORKS INDIA | Off Campus Online Assessment Question (2023) | Count of Pai by Padala Indira Bhavani • 0
Approach Use a HashMap to store the frequency of numbers already seen. For every number: Check if num - k has appeared before. …
Answer: ORACLE CERNER Hiring | On-Campus OA (2023) | Minimum Number of Arrows to Burst B by Padala Indira Bhavani • 0
Approach This is a classic Greedy Interval Problem. Key Observation If balloons overlap, a single arrow can burst all of them. …
Answer: PINE LABS Hiring| Off-Campus OA (2023) | Maximum Beauty of an Array After Applyi by Padala Indira Bhavani • 0
Approach Each number can be transformed into a range: [nums[i] - k, nums[i] + k] For multiple numbers to become equal, their tra…
Answer: VERITAS TECHNOLOGIES | Off Campus OA (2023) | Largest Divisible Subset by Padala Indira Bhavani • 0
Approach Key Observation If the array is sorted, then for any valid divisible subset: nums[i] % nums[j] == 0 where: j &l…
Answer: ZEBRA TECHNOLOGIES | Off Campus OA (2023) | Problem Find K Pairs with Smallest S by Padala Indira Bhavani • 0
Approach A brute-force solution would generate all possible pairs and sort them. Total pairs: nums1.length × nums2.length Thi…
Answer: TATA ELXSI Hiring | On Campus OA (2022) | Rotate Image (Matrix Rotation by 90 De by Padala Indira Bhavani • 0
Approach A direct rotation usually requires another matrix, but the problem requires an in-place solution. A clever observation: S…
Answer: PAYPAL INDIA Hiring | Max Consecutive Ones III Problem | On Campus Online Assess by Padala Indira Bhavani • 0
Approach This problem can be efficiently solved using the Sliding Window technique. The idea is to maintain a window that contains at…
Answer: SEAGATE TECHNOLOGY | On Campus OA (2022) | Kth Smallest Element in a Sorted Mat by Padala Indira Bhavani • 0
Approach Since every row is already sorted, the problem becomes similar to merging n sorted arrays. We use a Min Heap (Priority Queue…
Answer: GRAB Hiring Challenge | Off-Campus OA (2022) | Minimum Rounds to Complete All T by Padala Indira Bhavani • 0
Approach Since tasks of different difficulties cannot be mixed in a round, first count the frequency of each difficulty. For each fre…
Answer: CERNER (ORACLE HEALTH) | On Campus OA (2021) Problem Count Largest Group by Padala Indira Bhavani • 0
Approach For every number from 1 to n: Calculate its digit sum. Store the frequency of each digit sum using a HashMap. Track t…
Answer: PALO ALTO NETWORKS Hiring | Off-Campus OA (2024) Problem Minimum Cost to Cut a S by Padala Indira Bhavani • 0
Approach This problem is a classic Interval Dynamic Programming problem. Key Observation If we know: Left boundary = cuts[i]…
Answer: Cred SWE Interview Question 2021 November | Bit Manipulation | on-campus by Pravardhan Aare • 0
Solution 1: Number of 1 Bits — Brian Kernighan's Bit Trick Approach The operation n & (n-1) always clears the lowest se…
Land on Leaderboard & Claim your Hamper
Start Solving Problems Now
All Problems
Recent Votes
Recent Locations
Bengaluru, 32 minutes ago
Gharroli, 39 minutes ago
Hyderabad, 1 hour ago
Siliguri, 3 hours ago
Bengaluru, 6 hours ago
Bengaluru, 32 minutes ago Gharroli, 39 minutes ago Hyderabad, 1 hour ago Siliguri, 3 hours ago Bengaluru, 6 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
