Join Us
0 Votes | 1 Reply
5 days ago 
Sahil Jain • 0
Company Interview Questions & Coding Interview Experiences
AlgoPath A focused prep platform from AlgoUniversity for students who want a clearer path to interview readiness. Visit AlgoPath 0 Votes | 1 Reply
5 days ago Sahil Jain • 0
0 Votes | 1 Reply
0 Votes | 1 Reply
5 days ago Sahil Jain • 0
0 Votes | 1 Reply
0 Votes | 2 Replies
0 Votes | 1 Reply
0 Votes | 1 Reply
5 days ago Sahil Jain • 0
0 Votes | 1 Reply
5 days ago Sahil Jain • 0
0 Votes | 1 Reply
5 days ago Sahil Jain • 0
0 Votes | 1 Reply
5 days ago Sahil Jain • 0
0 Votes | 1 Reply
0 Votes | 1 Reply
4 days ago 
Padala Indira Bhavani • 0
0 Votes | 1 Reply
0 Votes | 1 Reply
0 Votes | 1 Reply
0 Votes | 1 Reply
3 days ago Padala Indira Bhavani • 0
0 Votes | 1 Reply
3 days ago Padala Indira Bhavani • 0
0 Votes | 1 Reply
3 days ago Padala Indira Bhavani • 0
0 Votes | 1 Reply
0 Votes | 1 Reply
0 Votes | 1 Reply
4 days ago Padala Indira Bhavani • 0
0 Votes | 1 Reply
6 days ago Padala Indira Bhavani • 0
0 Votes | 1 Reply
3 days ago Padala Indira Bhavani • 0
0 Votes | 1 Reply
6 days ago Padala Indira Bhavani • 0
0 Votes | 1 Reply
6 days ago Padala Indira Bhavani • 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
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
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
Request Recent Questions Now!
Filter Posts by Company
Amazon 108 Google 52 Oracle 51 Uber 38 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 20 media.net 18 VISA 18 Cred 17 BNY-Mellon 16 Airtel 15 CodeNation 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 Swiggy 11 Barclays 10 Meesho 10 ServiceNow 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: 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). …
Answer: TEACHMINT Hiring Challenge | Interview On-Campus OA Question (2023) by Padala Indira Bhavani • 0
Approach Count the frequency of every character across all strings. For all strings to become equal: Every character's total f…
Answer: ENTRI Hiring | Online Assessment Question | On-Campus (2023) by Padala Indira Bhavani • 0
Approach We only need to determine whether an operation increments or decrements the variable. If the operation contains '+…
Answer: FLIXSTOCK Hiring Challenge | Campus Online Assessment Question | On-Campus (2023 by Padala Indira Bhavani • 0
Approach Count the frequency of each character. Store all frequencies in a set. If all frequencies are identical, the set size wi…
Answer: NINJACART Hiring | Off-Campus OA (2023) | Add Two Integers by Padala Indira Bhavani • 0
Approach Addition can be performed using: XOR (^) → Sum without carry. AND (&) → Carry bits. Left Shift (<<…
Answer: MILKBASKET | On-Campus OA (2022) | Find First Palindromic String in the Array by Padala Indira Bhavani • 0
Approach Traverse each string in the array and check whether it is a palindrome using the two-pointer technique. For every word: …
Answer: MFINE Hiring | Interview Question | Off-Campus OA (2022) by Padala Indira Bhavani • 0
Approach First count: Number of ones in each row. Number of ones in each column. Since: zerosRow[i] = n - rowOnes[i] …
Answer: OKCREDIT Hiring | Online Assessment Question | On-Campus (2022) by Padala Indira Bhavani • 0
Approach This is a classic Binary Search on Answer problem. Instead of directly finding the answer, we binary search the possible max…
Answer: Airbnb Associate Developer Interview Question 2024 August | Two Pointers & DP | by Pravardhan Aare • 0
Solution 1: 3Sum — Two Pointers Approach To avoid O(N3) brute force search, we sort the array and iterate through it, using a *…
Answer: Snowflake SWE Interview Question 2024 July | Dynamic Programming | on-campus by Pravardhan Aare • 0
Solution: Longest Palindromic Substring — Expand Around Center Approach A palindrome is symmetric around its center. We can sol…
Answer: Pinterest SWE Interview Question 2024 June | Monotonic Stack | on-campus by Pravardhan Aare • 0
Solution: Next Greater Element II — Monotonic Stack Approach To solve this in O(N) time, we use a **Monotonic Stack**. The stac…
Answer: Salesforce Associate Developer Interview Question 2024 April | Prefix Sum | on-c by Pravardhan Aare • 0
Solution 2: Subarray Sum Equals K — HashMap Prefix Sum Approach Instead of checking every subarray in O(N2) time, we use a Hash…
Answer: Uber, Recently Asked Online Assessments in May, 2024 | Word Search | Backtrackin by Pravardhan Aare • 0
Solution 1: Word Search — Backtracking with DFS Approach We traverse the grid and start a Depth First Search (DFS) from any cel…
Land on Leaderboard & Claim your Hamper
Start Solving Problems Now
All Problems
Recent Votes
Recent Locations
Hyderabad, 8 minutes ago
Bengaluru, 29 minutes ago
Hyderabad, 46 minutes ago
Santa Cruz, 10 hours ago
Lucknow, 10 hours ago
Hyderabad, 8 minutes ago Bengaluru, 29 minutes ago Hyderabad, 46 minutes ago Santa Cruz, 10 hours ago Lucknow, 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
