AlgoPath A focused prep platform from AlgoUniversity for students who want a clearer path to interview readiness. Visit AlgoPath
7 results • Page 1 of 1
Showing : saplabsreset
7 results • Page 1 of 1
Request Recent Questions Now!
Filter Posts by Company
Amazon 107 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 CodeNation 15 Cred 15 Paytm 15 Adobe 14 Airtel 14 PayPal 14 Razorpay 14 ZScaler 14 DBOI 13 Zomato 13 Accenture 12 ByteDance 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 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 darwinbox 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: Autodesk SWE Interview Question 2024 September | Linked Lists | on-campus by Pravardhan Aare • 0
Solution 1: Reorder List — Split, Reverse, and Merge Approach To reorder the list in-place using O(1) auxiliary space, we can b…
Answer: Workday SWE Interview Question 2024 March | Backtracking | on-campus by Pravardhan Aare • 0
Solution 1: Subsets — Backtracking (Combinatorial Search) Approach We can generate all subsets recursively using **Backtracking…
Answer: Citrix SWE Interview Question 2023 October | Greedy | on-campus by Pravardhan Aare • 0
Solution 1: Jump Game II — Greedy Range Expansion Approach We can solve this problem in O(N) time using a Greedy approach that …
Answer: Expedia SWE Interview Question 2024 June | Backtracking | on-campus by Pravardhan Aare • 0
Solution 1: Letter Combinations — DFS Backtracking Approach We can solve this recursively using **Backtracking** to construct a…
Answer: Ebay SWE Interview Question 2024 April | Design | on-campus by Pravardhan Aare • 0
Solution 1: Implement Trie — Multi-Way Tree Nodes Approach A Trie is a tree where each node represents a single character prefi…
Answer: Intuit SWE Interview Question 2024 September | Trees | on-campus by Pravardhan Aare • 0
Solution 1: Lowest Common Ancestor — Recursive Depth-First Search Approach We can solve this problem recursively using DFS. The…
Answer: ServiceNow SWE Interview Question 2023 October | HashSets | on-campus by Pravardhan Aare • 0
Solution 1: Longest Consecutive Sequence — HashSet O(N) Lookup Approach A naive approach sorts the array, taking O(N log N) tim…
Answer: Cisco SWE Interview Question 2024 January | Graph DFS | on-campus by Pravardhan Aare • 0
Solution 1: Number of Islands — DFS Flood Fill Approach We can solve this problem by traversing the grid and using Depth-First …
Answer: Morgan Stanley SWE Interview Question 2024 July | Trees | on-campus by Pravardhan Aare • 0
Solution 1: Validate BST — DFS with Range Boundaries Approach A common pitfall is checking only if a node's left child is s…
Answer: Walmart SWE Interview Question 2024 April | Dynamic Programming | on-campus by Pravardhan Aare • 0
Solution 1: Coin Change — Bottom-Up Dynamic Programming Approach This is a classic variation of the Unbounded Knapsack problem.…
Answer: Zoom SWE Interview Question 2023 October | BFS: Rotting Oranges | on-campus by Pravardhan Aare • 0
Solution 1: Rotting Oranges — Multi-Source BFS Approach Since rotting spreads simultaneously from all rotten oranges to their n…
Answer: Spotify SWE Interview Question 2024 May | Dynamic Programming | on-campus by Pravardhan Aare • 0
Solution 1: Edit Distance — 2D Dynamic Programming Approach We can solve this problem using 2D Dynamic Programming. Let dp[i][j…
Answer: Goldman Sachs SWE Interview Question 2024 January | Arrays | on-campus by Pravardhan Aare • 0
Solution 1: Product of Array Except Self — Prefix and Suffix Products in O(1) Space Approach We cannot use division because div…
Answer: PayPal SWE Interview Question 2024 June | Backtracking | on-campus by Pravardhan Aare • 0
Solution 1: Generate Parentheses — Backtracking Approach Instead of generating all 22N combinations of parentheses and filterin…
Answer: Snap SWE Interview Question 2024 April | Trees | on-campus by Pravardhan Aare • 0
Solution 1: Construct Tree from Inorder and Postorder — Recursive DFS Approach We can solve this problem using recursion and a …

Land on Leaderboard & Claim your Hamper

Start Solving Problems Now
Top Problem Solvers
This Month
Meet the Champions