Join Us
Events
0 Votes | 1 Reply
Dijkstra Interview Questions & Experiences
AlgoPath A focused prep platform from AlgoUniversity for students who want a clearer path to interview readiness. Visit AlgoPath 0 Votes | 2 Replies
0 Votes | 1 Reply
0 Votes | 1 Reply
5 weeks ago 
Sahil Jain • 0
0 Votes | 0 Replies
5 weeks ago Sahil Jain • 0
0 Votes | 1 Reply
5 weeks ago Sahil Jain • 0
Groww SDE-1 OA2026 | Mutual Fund SIP Asset Allocation Window & Cross-Broker Order Settlement Routing
0 Votes | 1 Reply
5 weeks ago Sahil Jain • 0
0 Votes | 1 Reply
5 weeks ago Sahil Jain • 0
0 Votes | 1 Reply
6 weeks ago Sahil Jain • 0
0 Votes | 1 Reply
6 weeks ago Sahil Jain • 0
0 Votes | 1 Reply
6 weeks ago Sahil Jain • 0
0 Votes | 1 Reply
0 Votes | 1 Reply
6 weeks ago Sahil Jain • 0
0 Votes | 1 Reply
0 Votes | 1 Reply
6 weeks ago Sahil Jain • 0
Request Recent Questions Now!
Filter Posts by Company
Amazon 109 Oracle 54 Google 53 Uber 39 Flipkart 31 Microsoft 31 GoldmanSachs 30 Cisco 29 Sprinklr 26 Walmart 25 Atlassian 24 IBM 23 Infosys 22 deshaw 21 Intuit 21 PhonePe 20 Salesforce 20 VISA 19 media.net 18 Adobe 17 Cred 17 BNY-Mellon 16 PayPal 16 Paytm 16 Airtel 15 CodeNation 15 Razorpay 15 ByteDance 14 Zomato 14 ZScaler 14 DBOI 13 Linkedin 13 Accenture 12 Nvidia 12 Swiggy 12 TCS 12 Capgemini 11 Publicis-Sapient 11 Samsung 11 ServiceNow 11 wipro 11 Barclays 10 Meesho 10 Sigmoid 10 Amadeus 9 Cognizant 9 HCL 9 Hexaware 9 Confluent 8 Persistent 8 Rubrik 8 arcesium 7 Deloitte 7 Increff 7 Juspay 7 Mastercard 7 Morgan-Stanley 7 Qualcomm 7 saplabs 7 standard-chartered 7 Tredence 7 curefit 6 GEDigital 6 HSBC 6 LTI 6 makemytrip 6 Navi 6 Siemens 6 thoughtspot 6 TVS 6 AMD 5 American-Express 5 Apollo 5 Citadel 5 CITI 5 Directi 5 Goldman-Sachs 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 Hilabs 4 Nagarro 4 Optum 4 Rippling 4 Slice 4 Tekion 4 Zepto 4 Appdynamics 3 British-Telecom 3 CapitalOne 3 Contlo 3 Hugosave 3 Intel 3 Mathworks 3 Mercari 3 OYO 3 Piramal 3 ringcentral 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 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 Hitachi 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 Toshiba 1 Trianz-Digital 1 Truminds 1 Webstaff 1 Winzo 1 Bank-of-America 0 Flexcar 0 Hudson-River-Trading 0 Medianet 0 Mentor-Graphics 0 Newfold - Digital 0 Qburst 0 Steradian-Semiconductors 0
Recent Replies
Answer: Uber, Recently asked On-Campus OAs in IIT-D on 30th October, 2022 by Karthik • 0
Question 1- Solution: we can see the problem as a graph problem. assume initially there are n components (n students) and after ea…
Answer: ROLLS-ROYCE Hiring Challenge | Online Interview Question | Off-Campus OA (2024) by Padala Indira Bhavani • 0
Approach Use a TreeMap to store each employee's total working time. Traverse every event. Compute the duration as: dur…
Answer: PRATT and WHITNEY Hiring Challenge | Online Assessment Question | On-Campus(2023 by Padala Indira Bhavani • 0
Approach Traverse every element in arr1. Compare it with every element in arr2. If any difference is less than or equal to d, mark it …
Answer: GENERAL ELECTRIC AVIATION | Off-Campus | Online Assessment(2023) by Padala Indira Bhavani • 0
Approach Compare the least significant bit of a, b, and c. If the current bit of c is: 1: At least one of a or b must have a …
Answer: LEONARDO DRS Hiring | Online Assessment Interview Question | On-Campus(2023) by Padala Indira Bhavani • 0
Approach If the number of cables is less than n - 1, it is impossible to connect all computers. Initialize each computer as its own…
Answer: L3HARRIS TECHNOLOGIES | Online Interview Question | Off-Campus OA(2023) by Padala Indira Bhavani • 0
Approach Build an adjacency list from the given edges. Store all restricted nodes in a HashSet. Perform DFS (or BFS) starting fro…
Answer: GENERAL DYNAMICS Hiring | Online Interview Question | On-Campus OA (2022) by Padala Indira Bhavani • 0
Approach Count the number of islands in the original grid. If the grid is already disconnected (0 or more than 1 island), return 0.…
Answer: RAYTHEON TECHNOLOGIES | Interview Question | Off-Campus (2022) by Padala Indira Bhavani • 0
Approach Traverse the balloons from left to right. Whenever consecutive balloons have the same color: Keep the balloon with t…
Answer: BAE SYSTEMS Hiring | On-Campus OA (2022) | Path Crossing by Padala Indira Bhavani • 0
Approach Start at coordinate (0,0). Store every visited position in a HashSet. Process each movement: N → y++ S &ra…
Answer: NORTHROP GRUMMAN | Off-Campus OA (2022) | Reduce Array Size to The Half by Padala Indira Bhavani • 0
Approach Count the frequency of every element using a HashMap. Store all frequencies in a list. Sort the frequencies in descendin…
Answer: LOCKHEED MARTIN Hiring Challenge | Interview Online Assessment Question by Padala Indira Bhavani • 0
Approach Sort the pairs based on their ending values. Always choose the pair that ends first. Greedily select the next pair whose…
Answer: BOEING Hiring Question | Number of Provinces | On-Campus OA (2021) Number of Pr by Padala Indira Bhavani • 0
Approach Initially, every city is its own province. Use Disjoint Set Union (Union-Find) to merge connected cities. Whenever two d…
Answer: 4. ABB INDIA Hiring | Off-Campus OA (2025) | Count Symmetric Integers by Padala Indira Bhavani • 0
Approach Traverse every number from low to high. Ignore numbers with an odd number of digits. Split the digits into two halves. …
Answer: LEGRAND Hiring | Campus Interview Question | On-Campus OA (2025) by Padala Indira Bhavani • 0
Approach The string is valid if it never contains the substring "ba". If "ba" exists, then an 'a' appea…
Answer: YOKOGAWA Hiring Challenge | Online Assessment Question | Off-Campus (2025) by Padala Indira Bhavani • 0
Approach Always increment the smallest element to maximize the final product. Store all elements in a Min Heap. Repeat k times: …
Land on Leaderboard & Claim your Hamper
Start Solving Problems Now
All Problems
Recent Votes
Recent Locations
Prayagraj, 4 hours ago
Indore, 4 hours ago
Meerut, 4 hours ago
Pune, 6 hours ago
Hyderabad, 6 hours ago
Prayagraj, 4 hours ago Indore, 4 hours ago Meerut, 4 hours ago Pune, 6 hours ago Hyderabad, 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
