<?xml version="1.0" encoding="UTF-8"?><urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9"><url><loc>https://nextraise.ai/interview-questions</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/topic/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/industry/banking-finance</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/topic/product-sense</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/low-level-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/topic/low-level-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/industry/software</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/topic/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/industry/consumer-internet</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/industry/it-services</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/topic/system-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/industry/fintech</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/industry/semiconductors</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/industry/consulting</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/industry/engineering-manufacturing</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/industry/telecom-networking</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/system-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/low-level-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/low-level-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/system-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/industry/healthcare</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/uber</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/uber/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/system-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/low-level-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/system-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/system-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/product-sense</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/system-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/system-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/system-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/system-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/low-level-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/low-level-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/low-level-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/low-level-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/low-level-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/low-level-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/low-level-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/system-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/stripe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/stripe/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/system-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/low-level-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/low-level-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/system-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/behavioral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/low-level-design</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/coding</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/basic-calculator-ii-restricted-to-and-8bf26d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/maximum-depth-of-a-binary-tree-2ccfpo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/complex-project-and-how-you-managed-it-74xken</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/handling-stress-under-tight-deadlines-227c28</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/dijkstra-based-grid-problem-plus-a-modified-variant-qhdz8a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-all-possible-recipes-with-extra-constraints-12vr63</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/all-unique-pairs-in-a-sorted-array-summing-to-a-target-f7u23q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/handling-disagreements-9e28wd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/making-decisions-with-incomplete-information-bayfk2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/mentoring-junior-engineers-75v7my</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-in-a-rotated-sorted-array-dy651a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lowest-common-ancestor-in-a-binary-tree-with-a-modification-htq7p6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-gap-in-o-n-time-yfx2br</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/circular-tour-gas-station-problem-qpz0qh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-a-cache-with-get-and-set-h5jxj0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/most-technically-challenging-issue-you-have-faced-xce7pt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/why-are-you-looking-for-a-change-7th45v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/influencing-someone-without-formal-authority-y6yn1i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/open-the-lock-minimum-turns-with-deadends-yc90uj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-subarrays-whose-sum-equals-k-r6dkp3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/design-a-system-that-handles-audio-buffers-across-stages-at-q3dwqo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/design-a-file-system-storage-cache-with-an-eviction-policy-f1piyg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/time-you-failed-or-made-a-poor-decision-with-negative-c1rnz2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/hard-deadline-with-changing-requirements-k9csl8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/deep-dive-into-an-end-to-end-owned-project-wx7owk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/buy-and-sell-stock-with-at-most-two-transactions-29znrv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/defend-design-decisions-in-your-previous-work-r3xm6r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/print-each-number-with-its-index-hg7e8s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/print-whether-numbers-are-even-or-odd-with-a-lambda-u2neao</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/count-occurrences-of-a-digit-in-a-range-zkd0k2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/find-a-duplicate-element-in-an-array-205nqf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/check-whether-two-strings-are-anagrams-9s35l1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/stock-buy-and-sell-for-maximum-profit-ik482u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/innovative-ideas-to-use-technology-in-the-health-industry-1xxogn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/javascript-threading-model-and-the-event-loop-70dceb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/package-of-things-with-weight-limit-and-maximum-cost-af6qsv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/singleton-write-it-break-it-prevent-breaking-zq0dso</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/internal-working-of-hashmap-and-java-8-changes-sq7xf6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/how-spring-works-internally-uvniq3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/can-the-array-become-strictly-increasing-by-reducing-s7fif1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/the-chemist-closest-pair-difference-with-maximum-sum-2k8crc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/maximum-height-of-a-divisor-tree-t5jfmw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/public-fields-versus-private-fields-with-getters-and-setters-w55lob</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/partial-commit-across-three-tables-then-a-crash-z3xz2p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-duplicate-or-matching-lines-in-a-log-file-using-script-ac2xz4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/scripting-problem-with-dictionary-and-module-restrictions-71bmlw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/calculator-implementation-mqgm4g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/task-scheduling-overlap-5k4w36</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/how-does-hashmap-work-internally-zr3dga</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/how-do-you-detect-a-cycle-in-a-linked-list-0fq0xf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/sql-coding-tasks-ebzmc3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/technical-fundamentals-33lrfu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sort-array-by-parity-conditions-2ruwvc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/stack-vs-queue-and-dynamic-memory-allocation-lq5603</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/topological-sort-problem-t4pjkn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/dfs-problem-with-priorityqueue-nompx9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/sliding-window-problem-5isaqv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/count-occurrences-of-the-digit-3-from-1-to-n-8ovtt6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/compute-the-slope-of-a-number-from-its-maxima-and-minima-n0xcgk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/reverse-a-string-without-library-functions-au3leg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/give-an-example-of-how-you-exhibit-excellence-clxhq5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/training-juniors-who-might-make-you-obsolete-p3q6sc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/boss-favors-a-related-trainee-s-solutions-over-yours-424k40</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/sharing-credentials-with-a-colleague-while-on-paid-vacation-60192e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/why-barclays-given-a-web-development-background-nmie5d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/deep-dive-on-your-recent-project-e8niub</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/write-a-program-to-find-the-greater-of-two-dates-o21v8b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/data-structure-for-fast-search-over-millions-of-records-tn8oq7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/inheritance-interfaces-overloading-and-overriding-o2qsd6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/what-is-third-normal-form-l1mynn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/background-communication-improvement-hobbies-and-passion-d3l26k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/how-would-you-contribute-to-integrity-leadership-roles-1yhq4y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/add-two-numbers-represented-by-linked-lists-hjncb7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/introduce-yourself-and-current-project-challenges-l5mr35</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/median-of-a-running-stream-of-integers-6gdea0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/trapping-rain-water-1cel4h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/most-challenging-project-of-your-career-xt60hv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-replaced-element-in-an-array-of-0-to-999-u39ro8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/evaluate-an-infix-expression-via-postfix-conversion-e8z935</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/serialize-and-deserialize-a-binary-tree-8s5ic6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/data-structures-for-a-product-recommendation-engine-04rtjb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-number-of-points-on-a-single-line-ri56vi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lru-cache-implementation-etwev5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/product-of-array-except-self-without-division-px2jcx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/construct-a-bst-from-its-postorder-traversal-btqt33</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/detect-a-duplicate-in-a-stream-of-lowercase-letters-deemk2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/why-did-you-leave-your-previous-company-and-why-leave-6vvhit</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/most-challenging-thing-you-have-done-in-your-career-o7g5w8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/suggesting-a-better-idea-to-your-manager-manager-disagreeing-q0154d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-complete-subarrays-in-an-array-kid8qg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/learn-and-be-curious-dive-deep-leadership-principles-evlz9f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimize-sum-after-repeatedly-merging-two-elements-43qnbw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rotten-oranges-k4lc6j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/current-role-deep-dive-on-a-bug-conflict-feedback-and-self-2cns21</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-numbers-that-rotate-180-degrees-into-a-different-valid-pfc2ka</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/why-google-favorite-google-product-and-its-competitors-iky8na</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/negative-feedback-your-organization-would-give-one-technical-k7gbmf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/leadership-work-credit-going-to-someone-else-manager-2fg9xa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/leaving-before-one-year-two-year-plan-z3179r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-values-that-a-randomized-pivot-binary-search-always-n8sj58</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/split-chocolate-bar-into-k-pieces-maximizing-the-minimum-y294th</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/split-people-by-weight-into-k-contiguous-groups-minimizing-mby3nl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/smallest-manhattan-distance-between-x-and-y-cells-in-a-grid-8xvk15</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-all-matches-of-a-small-string-in-a-big-string-7c1l2e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/implement-a-rope-cord-data-structure-with-length-and-k3dnn3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/compare-cords-and-check-whether-one-contains-another-3p6a36</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/max-min-and-current-value-over-a-stream-of-share-market-data-jg1a97</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/accomplishments-challenges-leadership-courage-and-inclusion-qqc5er</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/number-of-rotations-required-to-form-a-specific-array-j9gpi3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/spiderman-s-webs-minimum-count-to-reach-last-building-p55yr0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/program-to-print-palindrome-numbers-in-python-7em96l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/count-of-every-character-in-a-string-1ikcs4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/climbing-stairs-dynamic-programming-2r56ki</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/graph-algorithms-topological-sort-dfs-bfs-w5afpe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/game-theory-array-difference-o1x8ad</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/string-conversion-to-vowels-xv0tal</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/max-value-in-2d-matrix-93toxw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/max-frequency-character-in-string-yj2q0s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/detect-a-loop-in-a-linked-list-then-discuss-sorting-lb2mda</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/reverse-the-letters-of-each-word-while-keeping-word-580nrd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/rotate-a-square-matrix-90-degrees-clockwise-f7et2j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/build-a-calendar-app-with-meeting-scheduling-and-accept-u5auwn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/travelling-salesman-using-a-greedy-approach-2qxbxb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/print-the-top-view-of-a-binary-tree-w8fz44</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/explain-polymorphism-with-an-example-lt0br1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/explain-acid-properties-inqtx6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/design-how-a-lift-works-y7n53s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/two-switches-two-bulbs-puzzle-and-variations-1cjbpv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/why-a-finance-firm-and-why-mastercard-8nujab</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/check-if-b-is-an-anagram-of-a-in-java-4ju7pt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/implement-a-stack-using-queues-j6j18f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/python-language-fundamentals-g152yq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-character-frequencies-in-a-word-without-collection-sfq1a4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/sort-a-large-set-of-floats-in-the-range-0-0-to-1-0-g42725</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/explain-paging-and-raid-h35lhb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/reduce-response-time-of-a-frequently-hit-get-request-and-pkui0g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/design-an-airbnb-clone-recommendation-system-considerations-2iqqjd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/design-a-goods-delivery-app-scheduling-delivery-valets-o17n1d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/overcoming-challenges-managing-a-team-and-company-core-me2d3p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/kth-largest-element-after-closing-array-under-absolute-l6f94i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/count-binary-strings-with-no-d-consecutive-0s-or-t-mc55ge</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/remove-the-nth-node-from-the-end-of-a-linked-list-uykb9z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/immutable-classes-comparators-and-multithreading-basics-s13rrf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/implement-an-lfu-cache-ctu3jr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/put-versus-post-async-programming-spring-versus-spring-boot-3vlnwm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/design-the-bookmyshow-website-j855ew</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/sort-a-hashmap-by-values-r9uo8l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/print-an-array-in-wave-form-ygh5av</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/spring-scope-beanfactory-and-applicationcontext-312g24</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/design-a-url-shortening-system-g39lge</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/daily-temperatures-7u2dxe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/1-d-array-dynamic-programming-with-space-optimization-1ubbd4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/tree-dynamic-programming-with-constraints-j4onxq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/backtracking-algorithm-coding-and-dry-run-m5m7m6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-two-numbers-in-an-array-that-sum-to-a-target-qzhmr1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/check-power-of-2-and-odd-number-gfk2a6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/reverse-words-in-a-given-string-0ese10</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/sort-a-linked-list-of-integers-novv14</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/find-a-triplet-with-a-given-product-9hwz6d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/longest-natural-sorted-subsequence-nnjq5m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/0-1-knapsack-variation-qr5a8o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/database-to-ui-table-display-ljle7p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/frontend-mock-implementation-e3z2h1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/first-non-repeating-character-in-o-n-time-006qc6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/find-coordinates-of-intersecting-rectangle-h8ycrj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-the-next-permutation-of-an-array-jgyn05</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/low-level-design-of-snake-and-ladder-1evoij</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/high-level-design-discussion-of-a-past-project-81aq2t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/distance-to-the-next-taller-height-for-each-element-608gmz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/real-world-usage-of-java-17-features-tjb6pr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/migrate-a-java-version-without-gradle-challenges-yxgw43</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/kafka-usage-partitioning-and-differences-from-a-traditional-fvk5x3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/diagnose-a-deadlock-in-a-multithreaded-batch-process-fex3qt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/batch-job-slowed-from-15-to-45-minutes-find-and-fix-zd8hsv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/detect-and-resolve-a-database-deadlock-kszb47</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/singleton-versus-decorator-pattern-tc8d1z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/checks-before-taking-software-to-production-8azvwd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/caching-and-its-real-life-implementation-a086bo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/parenthesize-an-expression-to-maximize-its-value-5b05og</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-the-middle-node-of-a-linked-list-t0ei2e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-two-missing-numbers-in-an-array-of-1-to-1000-df7yws</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/optimal-strategy-for-a-game-then-optimize-mm8fr2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/aggressive-cows-style-placement-problem-dzir1o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/draw-the-er-diagram-for-one-of-your-projects-0px2gw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/check-whether-a-binary-tree-is-symmetric-trzy9p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/store-a-family-matrix-as-a-generic-tree-9b654m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/advanced-dbms-cap-theorem-scaling-partitioning-and-sharding-vtzz8h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/describe-a-challenging-or-setback-moment-in-your-life-8qdzwh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/views-on-ai-and-its-implications-for-the-job-sector-e3sgrp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/c-and-cpp-fundamentals-struct-vs-union-pointer-types-rac359</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/linear-vs-binary-search-and-implement-quick-sort-j8olr6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/microcontroller-versus-microprocessor-wl4kv1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/print-a-star-pattern-and-find-a-substring-with-and-without-xfw5io</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/puzzles-three-rooms-with-three-switches-measure-4-litres-pgx3b9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/which-project-is-closest-to-you-and-how-do-you-treat-ylp3da</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/swap-the-kth-node-from-the-start-with-the-kth-from-the-end-6hf6jm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/next-greater-number-with-the-same-digits-y0f1co</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/level-order-traversal-printing-each-level-on-a-new-line-8wn3go</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/reverse-a-sentence-word-by-word-0bqpnz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/oop-concepts-virtual-functions-overloading-overriding-vjc2il</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/build-a-business-ethics-story-from-picture-prompts-as-a-c9ddek</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/sort-value-color-pairs-by-color-then-by-value-a6q1ws</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-the-median-of-an-unsorted-set-of-values-w5noq6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/fit-the-most-processes-into-fixed-memory-p6awwz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/manage-printing-of-large-files-on-a-low-memory-printer-w9cdwy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/get-the-middle-element-of-a-linked-list-rm5srg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/monolithic-versus-microservices-when-to-use-each-36fgd2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/sharding-and-consistent-hashing-le6uuw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/convert-a-number-to-words-using-the-indian-grouping-e5wthm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/interface-segregation-example-and-the-template-pattern-hm4p8h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/how-do-you-do-code-reviews-79bsmc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/count-paths-from-top-left-to-bottom-right-of-an-nxm-matrix-46j1h6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/detect-a-cycle-in-a-directed-graph-l86n65</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/who-is-your-hod-mu0zfx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/difference-between-a-number-and-its-reverse-j08967</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/count-and-sum-the-powers-of-two-in-an-array-738mf0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/sort-an-alphanumeric-string-in-descending-ascii-order-6dgv4z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/read-a-string-with-spaces-and-print-each-character-on-its-6gjxph</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/why-computer-science-why-this-college-why-bosch-mbdu30</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/search-and-sort-complexities-and-quicksort-versus-merge-sort-hz18hc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/acid-properties-database-design-situations-and-cardinality-49xvtw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/past-experience-role-in-acm-chapter-and-projects-e4nngl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-the-element-with-maximum-frequency-in-an-array-hg1fp4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/print-numbers-1-to-n-without-using-any-loop-osz51p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/sort-an-array-of-strings-0c9op7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/pillars-of-oop-and-polymorphism-types-with-examples-nq6gox</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/what-are-lan-and-wan-and-their-applications-0kqls8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/sql-versus-nosql-and-why-nosql-in-your-project-8bz2re</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/angle-between-the-clock-arms-at-10-15-i2vl83</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/house-robber-maximize-loot-without-hitting-adjacent-houses-kxr367</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/if-you-integrated-ai-in-your-project-why-and-how-n2k7qz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/team-project-difficulties-and-a-teammate-falling-ill-before-z5ssg6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/team-conflicts-disagreements-and-a-teammate-lagging-before-a-d7x234</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/taking-the-blame-for-someone-else-s-mistake-t0mtvt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/something-you-started-that-juniors-continued-qny62t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/why-deutsche-bank-and-why-a-finance-company-xld24z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/track-a-request-across-microservices-pjur4w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/build-tools-and-ci-cd-pipeline-flow-o6bxwq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/responsibilities-of-an-api-gateway-8fkfzp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/explain-solid-principles-with-real-world-mapping-rqui63</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/monolith-versus-microservices-pros-cons-and-use-cases-u8stja</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/print-a-matrix-in-spiral-order-r0bae8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/kubernetes-deployment-steps-scaling-and-instances-u009wf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/write-a-complete-service-on-paper-controller-service-dao-9q8yug</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-the-highest-number-in-a-random-matrix-using-threads-suw6a2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/compare-and-swap-and-transaction-management-in-java-x12gbr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/output-of-a-cross-join-of-tables-with-10-and-20-rows-erdnx7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/reporting-to-a-junior-missing-a-promotion-and-your-problem-d82ygb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/what-do-you-know-about-morgan-stanley-and-why-join-4ub7nd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/explain-oop-to-a-5-year-old-then-the-four-pillars-with-hrq003</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/design-a-car-system-using-design-principles-and-patterns-ta1dpt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/print-prime-numbers-in-a-range-7qejwx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/valid-parentheses-with-all-edge-cases-ajx7dw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/implement-a-basic-linked-list-qrs2x2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/which-design-patterns-do-you-know-and-explain-builder-rspnx8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/maximum-transactions-before-balance-zero-8vfdt1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/queue-door-implementation-7f3jv2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/pathfinding-with-cat-avoidance-prvj76</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/stepping-numbers-and-house-robber-iii-5egjbd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-strings-that-differ-by-exactly-one-character-zbkzh4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/merge-two-sorted-strings-in-place-75bqsi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/design-a-special-stack-xzjmz7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/search-in-a-row-and-column-sorted-matrix-o1x4b1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/subset-sum-representation-6l5l4d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/complex-function-pointers-iqxe5v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/swap-procedure-for-pointers-5jfb9c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/count-distinct-pairs-with-given-sum-78yu1b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/correct-the-code-snippet-h6ty3q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/count-substrings-with-character-frequency-k-8wl2sf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/determine-if-a-boolean-expression-in-one-variable-can-be-fvn86v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/mex-like-problem-with-sequence-numbers-and-queries-d2rv73</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/divide-a-garland-of-diamonds-and-rubies-using-up-to-2-cuts-qvfuc4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/sum-of-digits-m-to-n-6xi7b5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/special-string-conversion-lx5cvm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/stack-operations-nwrv2j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-the-number-closest-to-the-average-of-an-array-c7u0ua</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/best-buy-and-sell-day-to-maximize-stock-profit-nxo2xl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/implement-a-stack-cipu2v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/mongodb-versus-sql-and-acid-properties-w3z4ol</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/remove-vowels-from-a-string-ws5rs2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/count-erroneous-characters-in-a-string-1i5mgu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/theory-grab-bag-sql-injection-oop-threads-http-methods-rtos-t33pyw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/handle-growing-website-traffic-on-mysql-without-moving-to-28pfug</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/dijkstra-and-bfs-applications-and-implementation-4fhl3a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/improve-the-candidate-s-metro-project-and-cross-questions-on-zw7aoz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/why-wells-fargo-and-how-do-you-research-stocks-before-81v7r7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/hr-round-strengths-achievements-and-soft-skills-2ge3ji</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/make-an-application-distributed-and-scalable-2rfbjd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/difference-between-runnable-and-callable-368hkt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/design-a-rest-api-for-crud-on-an-employee-xovr86</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/reverse-a-stack-min-stack-9xztx9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/how-does-spring-auto-configuration-work-mj6h84</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/streams-numbers-starting-with-1-and-array-maximum-tbf2ru</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/static-method-on-a-null-object-and-creating-an-object-of-a-l1k3kk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/improvements-made-at-the-org-technology-choices-and-a-big-4tr0ng</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/why-mastercard-and-why-are-you-looking-out-wm135c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/count-binary-trees-formable-from-numbers-1-to-n-jslbd1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/jdk-jre-jvm-garbage-collection-enableautoconfiguration-5c4ehb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/design-a-shopping-cart-with-payments-and-flexible-discounts-ic3js4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/deep-dive-on-current-project-and-a-production-issue-gdnxs0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/minimum-candles-to-buy-from-a-stack-to-cover-1-k-u4sjl4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/coins-collected-by-each-hero-from-defeatable-monsters-dj4b5t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/abstract-classes-virtual-functions-constructors-and-3swvbz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/reverse-a-string-with-the-least-complexity-93gc08</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/python-data-types-map-syntax-exception-handling-api-latency-an19kv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/what-happens-when-you-enter-www-google-com-in-a-browser-3dkvdu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/pointers-constructor-vs-destructor-and-the-need-for-delete-vt9frh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/koko-eating-bananas-binary-search-on-answer-g0gb4k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/arrange-array-with-odds-and-evens-separated-with-and-without-f3jsrg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/detect-a-loop-in-a-linked-list-and-find-where-it-starts-qai7sq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/dijkstra-algorithm-code-and-where-it-fails-c5aj2f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/round-robin-vs-other-scheduling-algorithms-and-preemptive-p75jyt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/25-horses-find-the-fastest-3-in-minimum-races-5dtfa6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/friend-class-encapsulation-polymorphism-acid-and-mlbtw4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/merge-sort-backtracking-and-graph-implementations-x3bl4j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/osi-vs-tcp-ip-models-arp-and-mac-l2-vs-l3-switches-router-vs-xoj1mo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/mongodb-choice-sql-vs-nosql-and-horizontal-scaling-i9cqjk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/harsh-decision-as-a-leader-and-handling-a-blocked-dependency-94bofh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/why-db-most-stressful-situation-and-team-leadership-example-u7tg39</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/count-distinct-substrings-of-a-string-using-a-suffix-array-xtlr2d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/code-a-fully-functional-oop-example-explaining-every-pillar-mc92uj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/computer-networks-dbms-joins-sharding-normalization-and-8llh3i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/minimum-fountains-to-activate-to-cover-a-garden-edt3mz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/minimum-operations-to-turn-a-weighted-tree-into-a-special-jt8caq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/department-wise-employee-counts-including-empty-departments-5k0fa7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/expand-an-array-so-each-element-is-followed-by-its-duplicate-n99fre</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/next-greater-element-in-o-n-m052rc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/construct-a-binary-tree-from-preorder-and-inorder-traversals-0a5nsl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/first-non-repeating-character-with-a-single-26-size-array-p56gtf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/intern-recommender-system-project-cross-questions-gp1ubg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/polymorphism-with-an-example-and-acid-properties-8jf5ea</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/difference-between-merge-sort-and-quick-sort-4lsjqn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/detect-and-remove-a-cycle-in-a-linked-list-fxq78d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/check-if-sum-of-node-values-across-paths-equals-x-225mk4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/reverse-bits-of-a-number-without-modulo-operator-wncru1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/swap-two-numbers-palindrome-reverse-a-string-solmk3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/binary-search-and-sorting-algorithms-mmmab4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/check-if-any-anagram-of-a-string-is-a-palindrome-sin95w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/correct-position-to-insert-an-element-in-an-array-589jnr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-loop-and-start-of-loop-in-a-linked-list-al9so1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/two-sum-and-three-sum-problems-ov2kqh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-the-top-k-most-talkative-users-from-chat-logs-0q4hha</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/shortest-path-in-teleporter-network-with-broken-nodes-9eqf9f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/longest-contiguous-footpath-segment-of-favorite-color-hn3wvt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/game-theory-number-difference-and-string-vowel-conversion-a2sa0m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/binary-tree-views-ancestors-and-linked-list-loops-01ffuz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/explosive-chemical-identification-and-minimum-platforms-6vasom</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/output-of-increment-operator-expression-440hlk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/find-next-closer-number-using-same-digits-k0cw86</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/bst-node-print-based-on-child-sum-difference-lj7dxd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/connect-points-with-minimum-wire-mytw2u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/output-of-c-functions-with-pointer-arguments-jyubw6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/design-api-to-move-buffer-contents-si5lqj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/print-all-balanced-parentheses-combinations-0jirj3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/convert-number-up-to-9-billion-to-string-literal-8zg5r3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/merge-array-lists-and-remove-duplicates-without-inbuilt-jvh2hq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/sql-queries-with-joins-and-aggregate-operators-gt7epb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-middle-and-nth-last-element-of-linked-list-0plbu3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/program-for-tribonacci-series-mi55cw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-queue-using-at-most-two-stacks-5ugu2s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-equals-method-comparing-object-contents-and-km10kx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/return-random-element-from-list-with-equal-probability-3eyd4u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/teammate-on-unplanned-leave-with-a-close-deadline-ck4wc7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/explain-and-code-merge-sort-0tpm68</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/explain-a-process-scheduling-algorithm-w4xh71</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/ddl-vs-dml-commands-and-when-to-use-each-704ffj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/why-would-anyone-use-your-app-when-google-maps-exists-qjl4ux</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/what-if-you-are-assigned-a-technology-you-are-not-interested-hp9lx8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/job-sequencing-problem-wb83ay</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/count-scatter-palindrome-substrings-q139qk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/avl-tree-balancing-and-the-four-rotations-zd633s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/write-and-optimise-bubble-sort-in-java-3edi4u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/build-a-bridge-from-lego-as-a-group-un3ih6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/draw-mongodb-architecture-and-write-a-basic-query-lag7ax</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/node-js-api-calls-promises-and-microservices-7u3s25</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/paging-and-address-translation-round-robin-5i5yfm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/why-should-we-hire-you-and-why-are-you-interested-in-5cfy75</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/count-broken-glasses-from-the-servant-s-wages-0nw3jl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/why-use-react-and-node-js-together-fzl6zt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/state-vs-props-in-react-p428eu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/count-employees-earning-above-their-department-average-kkfl43</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/swap-two-numbers-without-a-temp-variable-zuds4f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/sql-vs-nosql-u1p3hq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/why-join-wells-fargo-personality-traits-future-goals-jtinp6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/explain-normalization-its-types-and-normalize-an-example-aij9ux</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/fibonacci-using-goroutines-and-channels-s0f4pc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/rotting-oranges-style-problem-x830ca</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/surrounded-regions-arn6c3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/maximum-length-of-pair-chain-n1l1qe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/all-greater-numbers-formed-from-the-digits-of-a-number-pgbw7k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/replace-substrings-using-source-target-and-index-arrays-d8megy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/maximum-gain-in-a-two-player-circular-array-game-qka06g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/palindrome-pairs-qh7f8o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/pangram-check-on-input-sentences-4ogz4e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/sum-of-even-numbers-between-x-and-y-4d3lzu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/four-pillars-of-oop-with-examples-acid-properties-4w8gz7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/partition-tolerance-in-the-cap-theorem-epxh5q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/pseudocode-to-find-min-and-max-in-an-array-90vop6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/what-is-a-rest-api-qhod80</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/a-team-member-is-not-working-and-performs-poorly-zdv2ok</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/when-to-use-sql-vs-nosql-and-why-firebase-nf95hs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/tell-me-about-yourself-and-why-mastercard-phw1lq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/speak-on-any-topic-for-three-minutes-ohw6ze</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/priority-queue-how-many-queues-and-how-implemented-smuz0d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/tree-traversals-with-algorithms-why-bst-over-binary-tree-v1qx11</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/prefix-and-postfix-notation-of-a-given-equation-xt43gm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/first-missing-positive-between-1-and-50-le2uzy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/osi-layers-in-detail-and-modes-in-computer-networks-yjcr2g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/relational-databases-and-speeding-up-a-query-by-changing-the-xnnlj7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/multithreading-vs-multitasking-vs-multiprocessing-vs-31188a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/sql-vs-nosql-and-types-of-databases-yl96oq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/jvm-jre-and-jdk-compiler-vs-interpreter-exception-handling-5dngco</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/why-a-software-role-with-an-e-and-tc-background-6sy274</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/quick-sort-and-its-complexity-with-pivot-at-the-first-index-0t0d6i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/bst-time-complexity-and-height-from-number-of-nodes-6xf94n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/hashmap-hashing-and-hash-sum-zfr1g7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/why-deutsche-bank-why-the-financial-sector-bqc3uq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/palindrome-check-optimised-6ju219</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/rest-api-calls-and-the-different-rest-methods-7elq56</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/what-to-keep-in-mind-before-developing-a-website-s-frontend-6qncqf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/three-mislabelled-boxes-which-one-has-mangoes-hj0cnc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/why-did-you-not-receive-a-ppo-from-your-internship-z2abm1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/who-is-mastercard-s-biggest-competitor-qilb3t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/second-highest-salaried-employee-query-a6115l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/why-not-pursue-an-ms-given-your-strong-profile-grbwm1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/max-absolute-difference-of-smaller-left-vs-greater-right-nkru6s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/lexicographically-smallest-string-of-length-n-with-sum-k-8g6zks</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/write-code-that-deadlocks-then-prevent-it-x4uhj3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/interface-vs-abstract-class-and-hashmap-internals-8b16lh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/10-balls-one-defective-minimum-weighings-utq0sm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/normal-forms-up-to-bcnf-with-examples-zapi2s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/second-max-salary-in-two-different-queries-group-by-and-dw5bwd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/explain-merge-sort-with-an-example-and-its-time-complexity-3azzr7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/corporate-vs-startup-and-why-no-further-studies-gd47sk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/how-did-you-overcome-rejections-from-other-companies-3m69nv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/use-of-volatile-keyword-in-c-gi1pa8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/identify-integer-overflow-in-multiplication-z20d8u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/identify-big-endian-vs-little-endian-kjc4bu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/concatenate-n-strings-matching-last-and-first-characters-gnaqs2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/print-covered-and-uncovered-nodes-of-a-bst-3kxry7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-the-next-smallest-palindrome-number-wfvl65</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/search-element-in-row-wise-and-column-wise-sorted-matrix-7ib8uj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/first-non-repeating-element-in-a-file-under-space-y9s1ek</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/print-elements-from-stream-in-sorted-form-using-minimal-zs5zsv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-two-or-four-elements-in-array-with-sum-equal-to-k-0cvdwm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/text-justification-algorithm-xq1494</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/max-sum-of-non-adjacent-elements-xv88qj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/find-overlapping-intervals-tppkt0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/merge-n-sorted-arrays-9g7gf7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/implement-heap-operations-9vu0oi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/minimum-squared-terms-gzro5j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/shortest-path-graph-problem-bc6u0q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/interval-overlap-and-maximum-overlaps-oca24i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/best-sum-dp-problem-ml8dfd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-largest-building-height-in-a-rectangle-2dzxvg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-inverse-pairs-in-an-array-x4h6cj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/star-pattern-printing-ls15pf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/fibonacci-bst-and-linked-list-algorithms-63c8me</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/array-and-adhoc-grid-question-gjie69</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/text-editor-design-9emibt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/bfs-dfs-grid-problem-y7fv35</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/count-rotations-in-sorted-and-rotated-linked-list-wrq3a9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/delete-node-given-only-its-address-4frtwl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/clone-a-linked-list-with-a-random-pointer-x19po9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/print-left-view-of-binary-tree-hrizj3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-all-subsets-of-an-array-78q34g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/inorder-successor-in-a-binary-tree-c7er8a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/types-of-inheritance-and-why-inheritance-is-useful-v4gr0b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/why-kotlin-over-java-for-android-development-ivw9ck</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/protect-company-security-or-save-someone-s-life-bktj5z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/working-with-people-from-different-cultures-5hxohr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/majority-element-ii-0qykqm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/insert-delete-getrandom-o-1-with-an-extra-getvalue-sixj7f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/number-of-islands-with-8-direction-connectivity-using-bfs-2y7xu1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/coding-round-lexicographically-smallest-string-after-rbyrf1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/basic-array-problems-and-sorting-gvy44j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/nth-highest-salary-and-max-salary-per-day-3hxtgr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/python-concepts-map-filter-iterators-decorators-generators-rhm15n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/class-diagram-for-an-order-with-items-and-payment-method-h81zg6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/employees-earning-more-than-their-manager-swap-gender-values-txx3hx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/unix-commands-for-files-and-pipes-4uo3l6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/pascal-s-triangle-value-at-a-given-row-and-column-iy99tm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/extensible-import-export-class-diagram-6suynn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/strengths-and-weaknesses-company-values-and-culture-tt4dkq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/unit-vs-system-testing-and-building-an-automation-framework-896ueg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/ordering-a-huge-employee-dataset-7oe2bi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/design-a-database-holding-data-about-all-indians-6gcii8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/favourite-data-structure-with-graph-scenarios-0rjcvq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/career-goals-team-conflict-and-task-assignment-sm9z8u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/online-coding-round-a-n-b-n-pattern-largest-even-odd-in-a-z32a1j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/python-sql-and-task-queue-questions-9r5ijv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/joins-clauses-and-odd-numbered-records-rjffz2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/why-leave-toughest-challenge-monday-motivation-autonomous-ief25y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/recommender-system-and-selenium-scraping-project-cross-oced0e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-the-middle-of-a-linked-list-k7cgxq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/left-vs-outer-join-acid-and-nosql-vs-rdbms-2ybq70</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/overloading-vs-overriding-and-oop-pillars-wjtpc2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/crud-in-dbms-and-http-verbs-sdlc-steps-jhhy7d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/shift-work-competing-offers-and-what-to-change-fq078s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/hibernate-spring-boot-sql-procedures-vs-java-triggers-buv8yn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/fibonacci-recursive-and-iterative-nth-node-from-the-end-cbelt3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/architecture-of-a-crm-full-stack-project-pizx3r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/interfaces-vs-abstract-classes-polymorphism-and-jvm-role-why-3q0044</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/how-would-you-build-a-coding-platform-like-leetcode-fki57q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/third-largest-mountain-in-an-array-3b305e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/ssl-http-rest-vs-soap-logging-deploying-a-jar-on-ec2-e4qmrq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/two-admins-editing-the-same-employee-record-0x5pfh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/hashtable-vs-hashmap-storage-thread-pool-sql-vs-nosql-4qmyi2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/idea-opposed-by-team-and-management-explain-microservices-to-c1rbkp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/search-a-2d-matrix-ep7fxc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/print-odd-even-with-two-threads-l9jrcg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/zigzag-level-order-traversal-with-a-direction-flag-c8bl1q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/project-data-structures-dbms-tables-and-scenarios-2i0ri8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/count-characters-in-a-string-and-applications-of-hashmap-zpywf3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/concurrency-vs-parallelism-and-multithreading-4xc8ax</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/customer-wants-a-faster-app-at-the-cost-of-security-dnv5uw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/state-vs-props-lifecycle-methods-hooks-6j29c3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/normalization-indexing-top-five-customers-by-sales-llu82d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/measure-4-litres-with-3-and-5-litre-containers-three-bulbs-ulx8m0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/epochs-training-validation-sets-and-learning-rate-fzcg9y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/state-and-props-virtual-dom-hooks-router-class-vs-function-jwcs3h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/rest-api-integration-oop-with-examples-normalization-rhu6wm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/why-mastercard-why-hire-you-project-challenges-iy4oqu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/music-site-with-crud-apis-and-top-10-trending-tracks-mop9dg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/search-in-an-infinite-sorted-integer-stream-vs577l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/expand-a-string-with-repeat-counts-in-braces-c78mlh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/register-users-authenticate-per-user-permissions-and-file-ywuq7k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/concurrent-vs-parallel-two-phase-commit-kill-9-async-vs-sync-i0xre4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-meeting-city-for-minimum-cost-in-an-undirected-o7xj2x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/convert-numeric-numbers-to-roman-numerals-using-a-lookup-7oz0nb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/best-time-to-buy-and-sell-stock-with-checkout-system-6ackyl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/coding-problems-j947zs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/dynamically-generate-a-table-with-numbers-qmh4cs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/binary-search-trees-lca-and-gas-station-qwogo1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/message-storage-with-phase-expiration-6qc0r5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/largest-area-from-points-on-a-graph-p15e4w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/vertical-max-sum-in-a-matrix-gdx4ro</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-all-factors-of-a-number-elkw7e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/bug-tracker-implementation-x3rlhw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/area-under-a-skyline-pl252o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/reconstruct-array-from-subsequences-xnxl20</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/minimum-sum-3x3-sub-matrix-znjse6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/odd-one-out-21ccwu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-elements-less-than-k-iqm0vq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-max-per-row-in-2d-array-hgd2jj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/classify-month-by-season-k4kay7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/burst-balloons-equivalent-qprqj1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/substring-with-concatenation-of-all-words-equivalent-t5c2hy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/moving-average-from-data-stream-equivalent-yc7pqv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/search-in-an-array-that-first-decreases-then-increases-s8mwtz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/keep-the-largest-n-scores-from-a-stream-of-cricket-scores-ksr2o4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/word-ladder-rjd2f8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/cheapest-flights-within-k-stops-2o972i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/lowest-common-ancestor-and-k-distance-nodes-variation-5b1qze</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/caching-with-concurrent-hashmaps-lru-and-lfu-93vgqr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/kafka-usage-and-problems-faced-mk1q9d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/serve-a-german-user-from-a-us-data-source-with-low-latency-iqtbt7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/optimise-a-flawed-table-for-redundancy-and-lookup-speed-dp5nu5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/design-a-ride-booking-system-like-uber-8w80me</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/hiring-manager-discussion-challenges-why-gs-finance-interest-8zihb1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/battleship-style-two-player-game-with-extensible-design-4snil2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/clone-a-linked-list-with-arbitrary-pointer-p5pl1m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/why-flipkart-why-change-cpp-only-background-for-a-java-role-u0fap5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/java-and-oop-fundamentals-screening-59s8n7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/design-a-bookmyshow-style-service-with-focus-on-apis-hbrd6v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/convert-number-to-roman-numeral-in-an-extensible-way-nm5heg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/current-project-a-feature-implemented-and-disagreement-with-ix27zw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/producer-consumer-odd-even-threads-singleton-and-immutable-b02nmo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/detect-a-cycle-in-a-linked-list-banm1e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sum-of-values-at-the-deepest-level-of-a-binary-tree-y81p0t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/alphabetically-first-and-last-substrings-starting-with-a-pg4vun</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/candidate-with-the-most-votes-yjqjm7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/generate-a-random-string-g0tvyp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/page-tables-and-virtual-memory-1utkjf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/detect-a-duplicate-word-in-a-stream-of-words-745d64</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/difference-between-process-and-thread-zm92j1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/compute-x-n-with-least-complexity-tqt7d4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/k-most-frequent-words-in-a-stream-yi2g81</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/build-a-chained-string-from-pairs-aml1ga</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/angularjs-architecture-pcjwf1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/fix-swapped-m-and-f-values-in-a-gender-column-me5wld</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-a-queue-using-two-stacks-x3u2lt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-steps-to-reach-the-end-of-an-array-5jf79n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/min-cost-path-in-a-weighted-directed-graph-allowing-k-skips-m68zpj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/binary-tree-views-left-right-bottom-top-and-level-order-g78ssu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/min-stack-with-o-1-time-and-space-m4ruyi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/rotate-a-matrix-by-90-degrees-in-place-psgfw9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/count-and-print-paths-from-1-to-2-covering-all-zeros-hweqf3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/encode-and-decode-an-n-ary-tree-into-a-binary-tree-0le8w1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/projects-team-conflict-strengths-and-weaknesses-278sgo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/call-a-rest-endpoint-from-java-and-process-the-json-8wkvhz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-all-subsets-with-a-given-sum-koa498</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/exception-hierarchy-final-finally-finalize-string-intern-b66hke</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/add-two-numbers-represented-as-linked-lists-0mctr6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/nth-highest-employee-salary-and-its-employee-name-6pble3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-all-leaders-in-an-array-blrs56</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/what-is-ajax-xq9mi5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/oop-and-solid-with-project-examples-exception-hierarchy-yrw1kq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-names-and-cities-arrays-by-name-then-city-zb3fq1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-array-as-highest-lowest-second-highest-second-lowest-iyuz01</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/request-to-response-steps-and-database-performance-c41ezb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/deep-java-questions-strings-serialization-interfaces-memory-8lkt4y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/digit-combinations-of-a-3-digit-integer-summing-to-a-value-wv0q6h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/longest-string-that-is-a-subsequence-of-s1-and-a-substring-64oxe8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/hops-between-nodes-for-queries-on-a-directed-graph-ai9azi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/compare-strings-with-sharp-as-backspace-zg6qfb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/amazon-vs-microsoft-differences-and-trade-offs-on-the-muk5cs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/broken-component-owned-by-another-team-before-a-launch-zv5t2c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-difference-distribution-of-chocolate-packets-7ui801</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-two-numbers-summing-to-k-g4qidz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/zigzag-level-order-traversal-of-an-n-ary-tree-0bsuit</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/average-stock-price-over-a-day-range-npd8ul</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/code-a-library-management-system-with-fines-zuk0h1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/design-multiplayer-snakes-and-ladders-extended-to-be-server-ka82g0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/online-coding-test-questions-v2faqu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/power-of-two-search-in-a-row-column-sorted-matrix-set-bits-54lrri</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/distance-doubling-each-step-86ugbs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/tree-traversals-and-building-a-tree-from-two-traversals-8oqpl8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/compilation-pipeline-makefile-linker-memory-and-paging-alt0ju</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/rectangle-and-circle-intersection-hwz8f0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/two-processes-sharing-jpg-files-by-address-vv1ts1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/measure-the-volume-of-an-irregular-lake-cheaply-gv5gga</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/median-of-a-data-stream-ezt9e0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/scaling-concurrency-cap-locking-and-sql-vs-nosql-wr7vpc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/leetcode-825-4g83yw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/jenkins-ci-cd-aws-kubernetes-docker-kafka-u67jnj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/project-grilling-on-ownership-challenges-and-leadership-d87aci</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-time-to-finish-jobs-on-two-schedulers-xlf7w2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/job-scheduling-with-dependencies-vb23tw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/even-numbers-at-even-indices-odd-at-odd-indices-622gbg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-duplicate-parentheses-from-an-expression-1i0xhe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/zigzag-tree-traversal-djji2l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/behavioral-questions-on-change-pride-mistakes-and-goals-7zg9h8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/search-in-a-sorted-array-with-some-adjacent-elements-swapped-mu8pox</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/longest-run-of-ones-with-at-most-one-swap-extended-to-k-6d78ur</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/split-array-into-k-subarrays-minimising-the-maximum-sum-49ddos</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/calendar-system-finding-the-earliest-common-hour-for-k-fvba19</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/josephus-problem-88v8qr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/3-litre-and-5-litre-water-jug-puzzle-69zgmi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/bill-of-materials-count-a-spare-part-inside-a-product-goc5ff</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/substring-extraction-from-string-with-brackets-713h6d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/generate-power-set-recursion-tree-mp5rdj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/sum-of-dependencies-for-every-node-in-a-directed-graph-xet2gs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/large-number-arithmetic-operations-1ugvmw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/mobile-numeric-keypad-path-counts-mon7au</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/employee-salary-calculation-based-on-boss-employee-has1gn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/url-range-matching-n03278</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/day-of-any-date-lhg8id</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/middle-of-a-linked-list-4kko2w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/delete-alternate-elements-in-linked-list-6us1py</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/diameter-of-a-binary-tree-1gdm0f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/heap-and-binary-search-with-sliding-window-2quq22</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/row-with-maximum-number-of-1s-cyrxn9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/minimize-calculated-sum-using-array-elements-9odozf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/find-all-unique-triplets-with-zero-sum-ahtt9w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/reachability-in-2d-boolean-matrix-with-diagonal-moves-cr7jfv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/minimum-time-to-execute-tasks-with-cooling-period-jqpr58</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-the-most-frequently-occurring-letter-in-a-sorted-string-t0uj41</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-the-sum-of-all-nodes-in-a-binary-tree-rvlna5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-perimeter-of-a-screen-given-coordinates-fmco0f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/determine-line-count-for-a-string-given-a-page-width-3k1vb8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/add-two-large-integers-represented-as-strings-8xg17n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/character-occurrence-and-duplicate-elements-e4iu07</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/design-a-logger-class-0hl2u6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/explain-virtual-functions-vptr-and-vtable-b6hrbm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/what-is-unique-ptr-and-how-do-you-delete-a-copy-constructor-22i1nd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/function-and-operator-overloading-with-code-examples-vwjb9f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/create-static-and-dynamic-objects-in-cpp-70k7ir</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/diamond-problem-and-virtual-functions-dfy76l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/paging-mutex-and-semaphore-lz6zvj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/mirror-a-binary-tree-k3mfe8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-kmp-string-matching-d3s9oh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/rate-yourself-in-cpp-and-justify-with-a-problem-you-solved-kqhm7i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/walk-through-an-ml-project-end-to-end-b0oskb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/approach-building-a-spam-classifier-elkb1w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/why-does-java-have-wrapper-classes-for-primitives-zv7xvh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/output-of-comparing-a-string-literal-with-new-string-using-m2o2xw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/inheritance-types-multiple-inheritance-and-abstract-classes-gd436y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maximum-sum-subarray-vnyrg9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/median-of-integers-arriving-as-a-stream-2laevq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-the-user-whose-video-has-the-most-comments-fwt6ms</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/classic-logic-puzzles-three-bulbs-and-switches-eight-balls-rusk2g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/catch-a-thief-who-moves-between-adjacent-houses-daily-v9ydq9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/design-an-elevator-system-for-a-10-floor-building-with-four-xv64gh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/storage-classes-global-and-static-variables-scope-and-7p654r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/static-versus-dynamic-binding-82c0vh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/explain-oop-principles-with-real-life-examples-hyq8dz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-even-or-odd-using-bitwise-operations-5wp2xc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/iterative-tree-traversal-f2d1qx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/intersection-of-two-linked-lists-4r8lil</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/how-a-set-orders-numbers-and-removes-duplicates-wok1y8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/how-two-computers-communicate-osi-layers-and-network-devices-b1lyph</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/total-cost-of-writing-a-100-page-manuscript-with-rewrites-ul4u3q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/several-same-deadline-projects-cannot-lose-any-client-2upw2m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/how-a-chat-app-sender-reaches-the-right-receiver-and-where-mfsw5z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/authentication-versus-authorization-81rfdn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/what-is-a-websocket-k5c2gp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/how-to-tell-a-site-is-secure-and-how-an-attacker-could-5oghf1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sell-a-water-bottle-pen-or-stapler-ihp5zt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/leaders-in-an-array-3hnj68</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/spiral-traversal-of-a-matrix-lo3lul</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/cut-a-cake-into-8-equal-pieces-with-3-cuts-mpe78x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/two-guardians-one-liar-one-question-to-find-the-path-to-uyv43f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/stacks-queues-arrays-and-linked-list-advantages-m7cvn7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/kernels-types-of-kernel-memory-allocation-vzao75</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/test-cases-for-a-login-page-4w218y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/second-largest-element-iz169e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/remove-loop-in-a-linked-list-ryyf68</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/deep-discussion-on-projects-and-technology-choices-fnhg0r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-queue-using-stacks-and-stack-using-queues-5gcxz1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/first-repeated-character-in-a-string-vicq6g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/os-and-oop-concepts-fragmentation-kernel-paging-virtual-and-vg2h3j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/mislabeled-jars-white-ball-probability-100-prisoners-with-d5s9eo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/test-cases-for-a-glass-frame-with-five-inventions-and-for-a-8ylvym</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/count-set-bits-in-an-integer-92vrni</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/dry-run-bubble-sort-and-insertion-sort-45sib1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/torch-and-bridge-puzzle-9sd79t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/test-cases-for-the-ola-app-and-the-gmail-app-3vc4zr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/semaphore-operations-and-context-switching-1inzwk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/logistic-regression-theory-and-clip-blip-models-9mpotd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/credit-risk-model-for-a-new-emi-feature-with-cold-start-9ixjsz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/end-to-end-fraud-detection-code-0f0shj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/fine-tuning-llms-and-vlms-dpo-and-ppo-reward-policies-f51vpt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/set-discounts-across-shoe-brands-to-maximize-revenue-aotwd9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/pair-in-array-with-given-sum-9fmaaa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/virtual-functions-and-how-the-compiler-works-0c406a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/types-of-schedules-in-dbms-8866x8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/indexing-in-dbms-uyz51m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/runtime-versus-compile-time-polymorphism-with-example-ws2zgi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/count-triplets-whose-sum-is-a-perfect-cube-hc8wwj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/union-and-intersection-of-two-unsorted-arrays-rtni3t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/frequency-of-ages-among-a-million-records-m1wxgh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/distance-between-two-nodes-of-a-binary-tree-xcd45m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/implement-ms-excel-with-a-data-structure-t9owgh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/tcp-versus-udp-7ag44g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/how-the-cpp-compiler-works-and-compiler-design-basics-89yih2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/can-an-abstract-class-contain-a-non-abstract-method-041au6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/build-a-rotating-file-handler-and-expose-it-as-a-rest-api-dr1j6x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/comment-sentiment-analysis-with-deep-neural-nets-v2cqtg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/process-vs-thread-multithreading-stacks-and-queues-with-lru-6e36uz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/explain-resnet-and-lstm-architecture-gru-vs-lstm-markov-t010ti</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/resolve-a-technical-disagreement-with-a-co-worker-e492xs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-domain-names-in-log-files-across-nodes-with-map-reduce-z6wt11</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/stream-of-add-add-to-all-and-print-min-queries-c6h9ea</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/count-subsequences-of-a-large-digit-string-divisible-by-4-2a3djj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/handle-the-celebrity-problem-on-twitter-like-feeds-nh098w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/incremental-and-blue-green-rollout-of-mobile-app-features-n7zqop</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/implement-a-max-stack-6i6coe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/when-to-choose-sharding-and-partitioning-31k3qv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/implement-a-connection-pool-rq6lcg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/design-a-marketing-campaign-system-y2yzxo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/deep-dive-into-the-most-technical-project-including-event-gr21cb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/print-root-and-leaves-from-start-and-end-edge-arrays-nx8pc3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/why-oop-and-its-features-n8g1gl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/what-is-inheritance-7i55x7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/show-polymorphism-in-java-code-7y3d6l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/array-vs-linked-list-and-insertion-deletion-complexity-xm7syd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/decimal-equivalent-of-a-binary-linked-list-pdgs5w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/reduce-string-by-removing-k-consecutive-identical-characters-4kjh7z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-two-elements-in-a-bst-that-sum-to-k-co3mpz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/design-a-read-write-lock-0bx630</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/what-would-you-do-if-team-culture-is-not-up-to-the-mark-hw4sz1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/high-level-design-of-a-netflix-like-system-3qt56u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/balanced-parentheses-9ijzj1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/department-top-three-salaries-and-rank-vs-dense-rank-ycl834</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/oltp-vs-olap-and-snowflake-vs-star-schema-5ep9s0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/mapreduce-discussion-k0o0nx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/analytics-for-an-online-delivery-system-g4jbxu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/how-is-java-platform-independent-os5155</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/reasons-an-emailed-excel-file-will-not-open-eyji8q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/what-would-you-test-in-a-new-web-browser-n8eoa4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/convert-binary-number-to-decimal-v85ndy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-the-longest-line-in-a-file-hpzqn3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-element-with-all-smaller-before-and-all-greater-after-buu5on</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/what-is-virtual-memory-and-what-is-a-memory-leak-q3qo8r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/what-is-saas-and-what-is-cloud-306nbc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/nested-list-weight-sum-wzrb3h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/valid-palindrome-ii-wtmc10</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/low-level-design-of-chess-9h1sbl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/cpp-pointers-memory-management-smart-pointers-output-and-7lgrx9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/compare-version-numbers-with-exactly-two-dots-iwph87</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-an-lru-cache-from-a-real-world-scenario-oyv8gz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/design-a-wallet-system-7sacl9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximize-product-of-sum-of-speeds-of-k-workers-and-minimum-s4sxcp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/design-a-jukebox-spotify-8topjo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/live-coding-median-and-linkedlist-ijo8h9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/check-palindrome-in-linked-list-jvz7z6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/mirror-tree-z7d9lu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/two-sum-2nlu5i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/search-for-an-element-in-an-unsorted-and-sorted-matrix-yeg207</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/sort-an-n-x-n-matrix-5za1ro</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/palindrome-check-9mthhn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/print-numbers-from-1-to-n-without-loops-c03tkg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/convert-numeric-number-to-word-form-k77j6d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/max-in-stack-in-o-1-n3d327</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/xor-queries-on-array-enb7r4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/what-are-tcp-and-udp-and-when-do-you-use-each-5n31gb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/explain-http-status-codes-23u64d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/pay-an-employee-daily-using-a-7-unit-gold-rod-with-two-cuts-sduud8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/types-of-constructors-me52xn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/what-is-a-virtual-function-5etrgh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/which-data-structure-do-you-like-most-and-why-1jp33e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/explain-the-different-types-of-sql-joins-70fqpz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/write-code-for-bfs-z5121v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-each-word-in-a-sentence-individually-ryl5ft</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/design-a-tic-tac-toe-game-ark0tr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/write-a-query-for-the-kth-minimum-salary-sm3wr6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/how-would-you-scale-your-project-further-c5278v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/what-happens-with-same-named-classes-in-a-jar-b6iyav</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/share-the-remaining-cake-equally-cjuin6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/tell-me-something-not-on-your-resume-that-defines-you-c9wvfc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/client-issue-after-delivery-while-the-team-is-on-leave-k3o408</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/explain-how-a-hashmap-works-v7n5sj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/real-life-uses-of-stack-queue-heap-graph-array-and-tree-34uc7k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/difference-between-rest-and-soap-apis-01nayb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-the-largest-element-in-an-array-wz244l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-numbers-up-to-100-without-loops-edbo71</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-whether-two-rectangles-overlap-c4hque</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/difference-between-drop-and-truncate-14o7mn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/difference-between-commit-and-rollback-hbpq87</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/build-a-web-page-from-a-layout-spec-using-html-css-60wig9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-pairs-in-an-array-with-sum-equal-to-k-s9aavh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-the-length-of-a-linked-list-in-fewer-than-n-iterations-4k6pgr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-a-matrix-in-z-pattern-b1ats8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/write-a-query-with-a-natural-join-then-without-one-abxyf9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/demonstrate-oop-principles-in-java-code-8p34tg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/which-sdlc-did-you-use-and-what-are-design-patterns-and-1tsi6i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-whether-a-linked-list-is-circular-1w5xph</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/explain-bfs-and-dfs-sujv9l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/classify-texts-as-spam-using-a-spam-word-list-riye1m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/count-profiles-visible-to-a-user-in-a-connection-graph-ewr0m2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/vertical-order-traversal-of-a-binary-tree-ekx55k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/design-a-cloud-based-property-listing-website-j5l4lg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/deep-dive-on-a-project-you-owned-xh1hzs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/draw-the-architecture-diagram-of-your-project-b4rpj9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/conflicts-with-team-members-during-the-project-pi4kwa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/handle-a-deadline-with-insufficient-people-or-resources-gole8x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/search-an-element-in-a-rotated-sorted-array-076h0s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/build-an-in-memory-buy-now-pay-later-system-ucde77</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-a-string-while-keeping-special-characters-in-place-320vt9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/write-and-explain-method-overloading-and-overriding-knw75i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/two-table-join-scenario-and-views-a93j1n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sql-vs-pl-sql-keys-aggregates-triggers-and-cursors-8c39qw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/java-platform-independence-exceptions-and-related-basics-xdyku1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/ports-tcp-vs-udp-digital-certificates-cryptography-and-0vh1pj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/connect-java-to-a-database-with-jdbc-jksy7g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-the-missing-number-in-1-n-3z9ut1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/sort-a-k-distance-nearly-sorted-array-l55ku7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/circular-tour-gas-station-h93ds1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/sum-of-minimums-of-all-subarrays-22557t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/cut-off-trees-for-golf-event-ha84ba</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/lru-cache-with-several-underlying-structures-njo9am</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/five-year-plan-strengths-and-weaknesses-growth-e8hxzy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/count-valid-words-formable-from-a-character-array-bzyvi6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/minimum-dice-throws-in-snakes-and-ladders-f3et67</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/sum-of-nodes-with-even-valued-grandparent-dp0prt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/introduce-yourself-without-repeating-your-resume-phh52b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/simulate-a-dice-using-getcoin-9i5fp4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/word-search-in-a-grid-j7q7bb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/design-a-chess-game-cv3shh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/send-a-treasure-box-across-a-river-via-a-corrupt-messenger-glvy73</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-all-pairs-with-a-given-sum-with-duplicates-buy2qw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/design-an-object-store-like-s3-h0ng9g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/grasshopper-probability-on-a-binary-tree-j87p2l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/first-unique-character-in-a-string-38y987</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/shortest-path-in-a-weighted-graph-83yu4i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/design-a-parking-garage-application-d2z552</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/insert-delete-getrandom-in-o-1-w0mtho</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/design-patterns-singleton-factory-observer-strategy-5o0oew</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/design-a-medicine-recommendation-system-culf65</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/integer-to-roman-without-hardcoded-mappings-yqwe3b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/self-balancing-bst-with-rebalance-on-insert-and-delete-gj6xqm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/scalability-kafka-circuit-breaker-and-saga-patterns-k3n5j0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/number-of-matching-subsequences-ff1w0l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reorganize-string-5k3uqi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/most-complex-task-you-have-handled-x9kfxe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/caching-hashing-custom-exceptions-rest-best-practices-x3igom</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/biggest-technical-highlight-and-skills-learned-outside-work-6jqibw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/count-case-insensitive-occurrences-of-a-name-in-a-text-p8e2v6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-merges-to-make-an-array-a-palindrome-mkr8yy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/subarray-sums-via-prefix-sums-6w0jq1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/rearrange-letters-in-place-by-an-index-array-j1qvcl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximise-sum-of-k-picks-from-either-end-6sdw0v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/palindrome-pairs-in-an-array-of-words-c1jtbk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/acid-properties-and-how-they-are-maintained-6d3fmc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-loot-from-non-adjacent-houses-h0f5h7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/search-a-key-in-an-enumerated-complete-binary-tree-bmar3u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-flips-to-make-a-binary-string-monotonically-3g7wvn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/in-place-run-length-encoding-fe0gmt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/integer-to-string-conversion-zv19ux</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-wine-glasses-for-party-guests-f88k6q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/tree-traversal-without-stack-q491y4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-and-fix-loop-in-linked-list-kwxk8p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/clone-linked-list-with-random-pointers-mfihw5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-anagrams-with-sorting-qwt6kk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-celebrity-in-a-party-6h0z88</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/lowest-common-ancestor-in-a-binary-tree-9kg1aq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/articulation-point-in-graph-cmwg5t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/count-occurrence-of-given-character-in-string-k5edaa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/equalize-array-elements-with-increment-moves-xm7og7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-precedence-of-characters-from-sorted-dictionary-zyk4va</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-time-required-for-rotten-oranges-fgs8el</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/valid-word-check-with-sticky-keys-v797k0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-equilibrium-index-rigyi7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/replace-sub-list-in-linked-list-7g7ma3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/minimum-divisor-2aut27</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/reductor-array-1qvkrh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/parse-words-and-count-duplicates-ph79t7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/subtract-two-matrices-u1s61h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/linked-list-sum-combinations-duj8hh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/equilibrium-point-b2iyri</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/compare-without-comparison-operators-mm3itq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/count-numbers-with-specific-unit-digit-in-a-range-xff9tg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/array-product-except-self-pfe2j6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/python-data-structures-comparison-and-usage-7aqo64</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/diagonal-matrix-traversal-as-an-iterator-class-7ellag</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/variant-of-merge-intervals-with-unit-tests-z23zkh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/word-search-in-a-character-grid-jbnu1f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/design-an-ordering-service-for-companies-to-buy-microsoft-vp98jk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/design-a-pastebin-like-service-276on4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/deep-dive-on-past-projects-m18y3r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/most-challenging-project-and-team-customer-questions-9uo36r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/design-a-product-for-elderly-users-g6fsqk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/improve-google-maps-for-commuters-vhbdj3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/design-backend-for-a-real-time-collaborative-document-editor-my4es2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/tell-me-about-a-time-you-influenced-without-authority-k65ojw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/decision-with-incomplete-information-9kxv7a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/conflict-with-an-engineer-and-how-it-was-resolved-q2ns4a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/mouse-and-cheese-with-a-move-validity-api-k0zyxr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/maximum-water-level-that-still-allows-a-start-to-end-path-yvof7q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/design-a-video-recommendation-system-like-instagram-reels-kicb7e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/pushed-back-without-authority-difficult-coworker-failed-lhr5mf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/team-match-walk-through-a-past-project-end-to-end-8w2wqc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/list-all-c-files-in-a-folder-and-its-subfolders-lra2js</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-palindromic-substring-hrm3oq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-characters-occurring-more-than-once-in-a-string-bsu7ps</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/number-of-bits-to-flip-to-convert-a-to-b-xz6jjx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-queue-using-stacks-54r0kh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reverse-a-linked-list-e9sssk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-the-numbers-embedded-in-a-string-rum8nf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pair-with-sum-k-in-a-sorted-array-using-binary-search-mx5irt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/project-experience-and-why-join-amazon-87vy34</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/convert-a-number-to-words-up-to-999-crores-qh10na</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-an-lru-cache-anzmg7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/min-stack-style-problem-with-clean-api-design-4cefrb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-duplicates-from-sorted-array-extended-to-keep-1fibdn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/validate-parentheses-and-generate-all-valid-parentheses-ttm3ii</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/design-a-distributed-lru-cache-with-constant-time-operations-dq62zd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/deep-dive-on-current-organization-s-use-cases-and-a-feature-07p688</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-duplicate-number-in-o-n-time-and-o-1-space-2s9fdc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-consecutive-ones-iii-apxg8s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-profit-in-job-scheduling-wxkr0l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/design-a-url-shortener-3naq4f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/course-schedule-ii-p3p0dv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/domino-and-tromino-tiling-v93fpt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/genai-usage-llm-limitations-hallucinations-and-validating-lppn88</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-permutation-5zibgm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/variant-of-the-celebrity-problem-5xfxx2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/order-of-characters-in-an-alien-language-from-a-sorted-2vrdpx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-width-of-a-binary-tree-qdck6i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-greater-element-v7tpcr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/describe-a-career-highlight-8puhd0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/walk-through-the-design-of-a-past-project-and-the-features-4kr30w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/explain-the-ci-cd-setup-of-your-current-project-6fg7ye</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/nth-highest-salary-plus-a-scenario-query-using-joins-and-3j3be0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/difference-between-in-exists-and-any-8tk5ab</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/what-are-indexes-and-why-are-they-needed-de8o48</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/height-of-a-binary-tree-q72i1e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/java-and-rest-api-questions-including-handling-concurrency-s75y98</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/load-and-performance-testing-of-your-feature-hllf78</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/recursive-function-printing-1-5-and-then-back-down-rf62df</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/operations-that-could-lead-to-a-deadlock-in-a-given-scenario-w5xop2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/find-the-diameter-of-a-binary-tree-x9s5qp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/rotate-a-square-matrix-by-90-degrees-brc9va</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/find-all-subarrays-with-zero-sum-hbc1ka</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/angle-between-hour-and-minute-hands-of-a-clock-x4hvre</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/minimum-platforms-for-arriving-and-departing-trains-5qly62</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/write-code-that-produces-a-deadlock-o99d1a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/model-a-product-page-with-related-products-from-url-utility-irx1px</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/present-a-technical-topic-apache-flink-after-one-hour-of-w39x6w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/explain-hashmap-internals-and-implement-it-fb2nid</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/level-order-traversal-of-a-tree-using-recursion-84whh1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/java-output-questions-on-exception-handling-and-0fmjw6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/internal-hashmap-implementation-and-concurrenthashmap-59xd3q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/solve-the-producer-consumer-problem-with-threads-80w0a9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/draw-the-high-level-architecture-of-your-current-project-hsjr2w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/strategy-and-builder-design-patterns-a7nzj2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/api-gateways-inter-service-communication-and-service-w9zgkb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/spring-cloud-usage-https-request-flow-in-spring-boot-bounded-ul4w45</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/conflict-resolution-team-leadership-strengths-and-weaknesses-7l1lv7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/pointer-vs-reference-stack-overflow-without-recursion-and-459oc8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/string-to-integer-conversion-with-strict-validity-rules-5d67qb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/count-of-smaller-numbers-after-self-12nmsp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/container-with-most-water-sz9cqv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/end-to-end-pipeline-to-predict-aspect-ratio-from-image-and-4dr3sf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/deep-dive-on-llms-transformers-and-attention-w7zqgb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/design-a-color-suggestion-system-rlu1ou</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-all-full-binary-trees-with-a-given-number-of-nodes-lndkl1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/check-whether-a-binary-string-is-divisible-by-3-s1iv6j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/hr-round-teamwork-stressful-situation-why-adobe-location-iq4wio</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/hardest-project-you-have-worked-on-lck2c0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/extract-date-from-a-datetime-field-group-by-then-join-a1iaev</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/tell-me-about-yourself-and-why-you-moved-into-data-science-zskli0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/explain-in-layman-terms-bias-variance-tradeoff-overfitting-kkzo07</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-fold-cross-validation-and-why-multiple-train-and-xh3auq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/what-is-hypothesis-testing-and-why-is-it-used-3craqd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/what-is-gradient-descent-and-where-is-it-used-pgif1e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-repeating-characters-in-a-string-qh8yaf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/design-a-vehicle-rental-service-like-zoomcar-mm7d4a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/construct-a-binary-tree-from-inorder-and-preorder-and-print-1z1ka2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/string-compression-35j9js</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/count-good-nodes-in-binary-tree-8rmz9w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/how-to-fetch-a-1gb-dataset-through-rest-apis-ld8wuw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/design-a-payment-gateway-service-lld-naudl5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/convert-a-number-such-as-1234-into-words-9wx49e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/string-vs-equals-string-immutability-and-making-a-class-dsbwm9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/design-the-backend-of-an-employee-details-form-512hb3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/why-leave-after-1-5-years-and-why-goldman-sachs-2v2kfm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/explain-quick-sort-and-compare-bottom-up-and-top-down-dp-6d8rop</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/implement-a-sudoku-solver-gg99m4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/high-level-design-of-your-current-project-on-a-whiteboard-nc1hbu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/stack-envelopes-inside-bigger-envelopes-p23roq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/number-of-subsequences-in-a-string-divisible-by-n-v6wh9w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/discuss-projects-sql-vs-nosql-and-rest-api-hjx5fd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/check-whether-a-string-is-a-valid-ip-address-we0aju</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/bfs-vs-dfs-and-which-traversal-fits-various-scenarios-czh6hc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/egg-dropping-puzzle-with-2-eggs-and-100-floors-rdw09l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/lps-array-and-counting-occurrences-of-s-in-t-in-o-s-t-s7tbym</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/count-palindromic-subsequences-in-a-string-p9zl8z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/sql-triggers-and-indexing-in-dbms-r6aqtp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/predict-the-total-number-of-buses-in-your-city-chqav2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/minimize-the-cost-of-organizing-a-birthday-party-wpc5ji</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/shortest-distance-between-two-nodes-in-a-bst-16b3ys</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/next-greater-number-with-the-same-set-of-digits-oqps5x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/two-sum-with-optimal-time-and-space-bq1esb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/check-valid-parentheses-using-a-stack-0a4dnq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/sort-an-array-of-0s-1s-and-2s-in-one-loop-without-extra-sia66i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-all-permutations-of-a-string-using-recursion-x5wpuz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/the-25-horses-puzzle-1nhnm8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/remove-duplicate-letters-to-get-the-lexicographically-jwy9ex</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/out-of-bounds-error-segmentation-fault-recursion-and-base-ubes0m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/unordered-map-access-complexity-and-storing-arrays-in-a-map-mhn4sq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/what-is-tensorflow-and-why-is-it-used-tebs73</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-each-word-of-a-string-in-python-b1ztmq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/why-pass-vectors-by-reference-fywh5p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-all-pairs-of-numbers-whose-sum-is-present-in-a-set-5a2mnf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/memory-swapping-in-unix-c-memory-layout-and-how-a-program-u4px46</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/compiler-phases-program-counter-and-microinstructions-mhfms6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/single-vs-double-linked-list-for-reversing-a-string-n7zzkw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/write-ml-code-to-predict-the-square-of-a-number-p6v3yn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/describe-a-project-from-your-resume-91jl6l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/pointer-referencing-and-dereferencing-with-double-pointers-8apw9n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/architecture-and-hld-of-your-current-project-yrkr0c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/tallest-stack-of-envelopes-with-strictly-larger-dimensions-3forir</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-number-of-platforms-required-at-a-station-f632mx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/valid-permutation-with-no-character-repeating-more-than-4mzlae</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/design-a-system-that-returns-metadata-for-a-given-url-d0w68i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/reverse-words-in-a-sentence-without-loops-or-length-function-fkd9qb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/sum-of-numbers-from-1-to-n-excluding-multiples-of-k-j4it7s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/minimum-time-to-rot-all-oranges-in-a-grid-ht7ecr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/minimize-maximum-distance-in-joined-trees-f7eubn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/aggressive-cows-5goi00</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/max-consecutive-ones-beach-seating-9304wx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/file-folder-structure-traversal-55fx6t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/maximum-frequency-stack-tqt91k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/reach-coordinate-x-y-from-1-1-using-specific-moves-f4h92x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/minimize-subtree-sum-difference-by-dividing-tree-along-an-7zwhzj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/path-finding-in-binary-matrix-with-hurdles-e499e5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/print-all-pairs-with-a-given-sum-from-two-arrays-inhf3z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/longest-repeating-non-overlapping-substring-25ce9k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/count-of-contiguous-increasing-days-for-each-stock-price-t09eo2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/sum-of-all-sub-number-combinations-of-a-given-number-ro10ni</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/maximum-j-i-such-that-arr-i-arr-j-2w9sb6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/sql-query-for-the-5th-largest-element-of-a-table-c811z3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/inheritance-with-examples-of-generalization-and-association-zr9jp6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/add-a-missing-feature-to-an-amazon-like-e-commerce-site-d8wabv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/how-product-information-is-stored-and-what-to-do-when-1cdprq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/write-the-full-code-for-a-java-swing-stopwatch-using-threads-f04oa1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/count-occurrences-of-digits-0-9-in-a-given-array-mv5svs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/fundamentals-questions-drawn-from-technologies-listed-on-the-5rzuym</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-simultaneous-run-time-for-m-applications-using-n-42jb6q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/return-all-sentences-formed-by-inserting-spaces-into-a-dzvet7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/diamond-problem-and-base-class-access-modes-why-java-lacks-ql60bv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/what-to-do-if-a-webpage-does-not-load-properly-ahdgj4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/rest-apis-ip-protocols-osi-model-and-role-of-the-transport-r2hng7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/need-for-normalization-denormalization-and-types-of-joins-8dim4z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/virtual-memory-and-sdlc-g1lonq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/monty-hall-problem-plf4fx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-a-loop-in-a-tree-and-write-dfs-and-bfs-pseudo-code-k2hy1t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/convert-a-fraction-string-to-its-decimal-form-with-repeating-rflr57</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/build-a-calculator-that-evaluates-an-expression-with-x6umu1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/max-value-path-in-a-2d-grid-moving-diagonally-up-diagonally-35gvja</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/data-structure-to-query-if-two-or-more-customers-visited-a-hp61u6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/design-twitter-low-level-models-then-scalable-high-level-seryo4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/project-architecture-deep-dive-and-agile-methodology-7oash2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/handling-team-conflict-and-prioritizing-features-versus-5eja0h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-whether-a-number-is-prime-83zl3k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-balanced-parentheses-and-redundant-brackets-in-an-qyfz0x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-the-words-of-a-given-string-z2h2dv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-duplicates-in-an-array-in-o-n-time-with-a-read-only-mphh49</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/swap-two-numbers-without-a-temporary-variable-arithmetic-or-m19nlf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/compiler-versus-interpreter-o3q6i6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/why-oracle-coming-from-an-eee-background-764g57</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/tell-us-something-that-is-not-on-your-resume-and-preferred-tet091</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/design-a-restaurant-management-system-7dogma</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/design-a-hashset-oscg1u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/lowest-common-ancestor-of-a-binary-tree-0myv6t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/design-bookmyshow-following-a-fixed-step-sequence-vfqgo6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/questions-on-current-work-and-db-design-of-features-built-kt4rm0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/strengths-weaknesses-why-switching-staying-updated-and-a-h3r39n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-the-nth-highest-element-of-an-array-zwgz43</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/next-greater-element-in-a-linked-list-abw3d0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/design-a-financial-database-system-pjkv8s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/reasons-for-job-change-and-leadership-principle-questions-peixn4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/output-when-a-class-holds-a-member-object-with-a-constructor-f5yvgm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/constructor-and-destructor-output-with-stack-object-and-new-oo8e19</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/function-hiding-show-int-in-base-versus-show-float-in-9u8jqf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/complete-a-class-with-a-reference-member-so-it-can-be-0is0oo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/write-your-own-string-class-klq6so</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/empty-class-instantiation-and-new-delete-kwwv14</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-number-of-corner-elements-to-reach-sum-k-5387ez</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/course-schedule-ii-and-bfs-versus-dfs-3es58c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/sort-an-array-after-squaring-its-elements-5qiff0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/check-if-a-word-exists-in-a-grid-without-a-visited-matrix-5swxbj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-a-signal-dispatcher-with-registered-callbacks-x6rzfq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-a-generic-vector-class-pii58h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/macro-for-max-of-three-numbers-and-macro-trade-offs-uib0xj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/output-of-array-indexing-and-pointer-arithmetic-expressions-yos2l0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/little-versus-big-endian-and-checking-machine-endianness-yte84n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/design-patterns-used-and-the-observer-pattern-f0dd3l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/design-the-class-structure-of-snake-and-ladder-83tjhv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/reverse-words-in-a-string-first-with-stack-then-o-1-space-m5h345</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/top-view-of-a-binary-tree-and-internal-workings-of-a-map-057cfg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/design-a-system-for-sharing-pdfs-with-simultaneous-multi-hos1uz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/find-and-print-the-transpose-of-a-matrix-okat62</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/find-the-kth-largest-element-in-an-array-nuaez8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/overloading-versus-overriding-6by5s3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/measure-exactly-4-litres-using-3-5-and-7-litre-jugs-1p6e5r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/oop-in-cpp-versus-java-and-why-java-has-no-pointers-t4n4lg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/garbage-collection-stack-versus-heap-final-finally-finalize-k9hde9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/explain-threads-in-java-54s66q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/linear-versus-non-linear-data-structures-jev6p1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/sql-query-for-the-second-largest-marks-in-a-table-difvn6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/total-value-of-a-string-given-a-value-per-character-o0cv4x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/write-a-program-to-check-a-palindrome-9zxde3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/team-member-not-working-difficulty-on-a-project-and-five-y8stcv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-an-index-where-arr-i-equals-i-in-an-unsorted-and-then-rcp06w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maintain-the-median-of-a-long-stream-of-numbers-847mfe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/implement-an-lru-cache-and-explain-its-data-structures-ip5ok2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maintain-an-employee-hierarchy-with-top-10-salary-and-crud-jy2jr3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/top-view-and-right-view-of-a-tree-in-place-mirror-tree-he1wli</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/ways-to-fill-a-4-n-wall-with-4-1-sheets-i6k2p3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/draw-and-explain-the-architecture-of-your-latest-project-u125m3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/columnar-database-and-why-redshift-over-mysql-for-a-4xszix</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/why-flipkart-aspirations-and-the-toughest-project-q4cakf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/palindrome-check-ignoring-non-alphabet-characters-rmol83</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/word-count-in-a-string-zyn9ws</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/swap-two-numbers-without-a-temporary-variable-g2853h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/design-a-data-model-for-an-e-commerce-company-and-answer-sql-itnrf7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/explain-an-etl-scenario-end-to-end-from-ingestion-to-data-zp5s3f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-all-palindromic-substrings-of-a-string-l1afo5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/explain-deadlock-and-virtual-memory-and-implement-virtual-04abm7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/browser-cache-database-model-slowed-from-1-ms-to-25-ms-after-ae6dfj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/convert-binary-to-hexadecimal-directly-5tvrws</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-a-concentric-number-square-pattern-for-a-given-n-8l6yai</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/1000-coins-and-10-bags-puzzle-qry1s9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/zig-zag-level-order-traversal-of-a-binary-tree-ugvym3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/host-file-loopback-address-registry-and-32-bit-versus-64-bit-z03976</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/possible-reasons-a-wireless-keyboard-is-not-working-8i0fec</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/what-image-to-use-to-verify-photoshop-blur-effect-xwwuz5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/improve-uber-ola-and-whatsapp-by-adding-a-missing-feature-05fxq2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/why-leave-your-current-organization-and-future-plans-8ri4ex</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/project-tech-stack-choices-challenges-team-conflicts-and-v3jv0g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/dbms-software-used-joins-types-of-keys-and-sql-objects-mq1xgq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/split-a-string-into-alphabets-numbers-and-special-characters-fva9q8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/stock-buy-and-sell-including-at-most-k-transactions-7a4uu8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/dependency-resolution-order-and-handling-cyclic-dependencies-zvv1xk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/regular-expression-matching-with-and-plus-test-cases-qx7v6k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/abstraction-encapsulation-polymorphism-and-their-support-in-809ws0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/situational-questions-and-justifying-the-team-tech-stack-e6h3uw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/where-do-you-see-yourself-in-3-5-years-and-the-key-skills-to-vatl2q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/technical-round-1-oops-sql-and-linked-list-to-integer-t5djsc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/technical-round-2-os-concepts-and-vector-rearrangement-ml4xfz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/choose-top-k-elements-and-create-class-0t1blq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/calculate-cost-of-path-in-a-graph-r7el3w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/start-and-end-index-of-first-repeating-element-9d8m8h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/print-numbers-alternately-using-two-threads-p0vgjg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/special-binary-tree-traversal-1602rt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/implement-and-and-or-gates-with-single-boolean-parameter-7ebkcj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-pivot-index-with-equal-left-and-right-sums-9fwu3l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/attendance-string-detention-rules-and-permutation-count-ah39c4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/maximum-area-of-the-largest-rectangle-owned-by-a-player-in-a-idi024</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-target-indices-in-an-unsorted-array-as-if-sorted-gjmu16</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/stl-usage-275crj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/implement-priority-queue-or-hash-table-ebo3mq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/storage-classes-in-c-with-examples-l6bgrc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/local-variable-versus-static-variable-8m7pzm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/inline-functions-4orvvq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/structure-versus-union-and-structure-padding-wlla0i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/difference-between-sharpinclude-with-angle-brackets-and-with-w8yjq6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/what-is-fseek-and-what-is-a-null-pointer-ggcy3x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/step-by-step-execution-of-a-c-program-657yun</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/how-memory-is-used-in-python-1lawte</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/what-is-an-embedded-system-and-iot-in-real-life-a76ynn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/difference-between-python-and-cpp-and-c-and-cpp-h7b1ne</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/what-is-an-operating-system-and-windows-versus-linux-q473d6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/what-is-a-database-and-sql-joins-i5lp9g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/steps-for-a-database-connection-in-java-t4k3aq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/compare-two-custom-objects-in-java-20el7m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/singleton-class-in-java-1j5x4n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/arraylist-versus-linkedlist-5mp6xa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/favourite-java-exception-and-why-it-happens-class-and-object-jo5dad</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/write-a-c-program-to-read-a-string-and-sort-it-3ta2mm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/project-and-internship-walkthrough-with-implementation-9m133c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/what-would-you-do-if-given-a-mechanical-or-circuit-engineer-s7xhui</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/which-team-role-do-you-prefer-and-what-if-a-teammate-does-nw6r4m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/why-bosch-and-what-do-you-think-about-the-company-r3982t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/rate-your-strength-in-c-and-python-and-your-microprocessor-sl4m0o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/why-bosch-and-why-is-this-job-important-to-you-au1tq9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/number-of-companies-attended-before-and-why-you-were-not-6bgs6o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/tell-me-a-secret-you-have-never-told-anyone-ft1rfj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/first-two-things-you-do-after-getting-a-job-yij88p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/why-did-you-choose-engineering-fp8jsw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/walk-through-your-resume-certificates-hobbies-and-events-o6t09l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/iis-reset-command-2bg64p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/migrating-a-java-application-from-on-premises-to-the-cloud-79omb8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/searching-and-sorting-algorithms-with-time-complexity-l7jgln</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kubernetes-architecture-eks-and-docker-commands-k4chb0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/why-should-we-hire-you-f0ti5v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/implement-polymorphism-and-encapsulation-functions-and-48ao20</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/write-programs-for-palindrome-and-factorial-c6q1ag</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/sql-joins-and-basic-to-advanced-sql-queries-8niptj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/classification-versus-regression-and-why-cnns-are-used-for-126c8k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/is-java-a-pure-object-oriented-language-kpng66</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/hypervisor-versus-virtual-machine-and-aws-versus-azure-nfq0lq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/challenges-with-a-team-and-how-you-overcame-them-resolving-x2rs2o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/describe-a-situation-where-your-weakness-overtook-you-your-ts5bhe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/why-do-you-want-this-role-and-why-should-we-hire-you-rg9lei</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/why-a-non-it-company-schneider-electric-and-what-motivates-8s30rx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/bracket-substrings-power-set-and-python-oops-4ps9ge</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/swap-two-values-in-place-using-pointers-without-third-e7rlgu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/explain-circular-linked-list-and-how-to-achieve-it-kj50d6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/sort-6-integer-values-with-data-ranging-within-30-djmfm6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/print-boundary-of-a-binary-tree-7tqs74</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/copy-doubly-linked-list-with-random-pointer-u9byp2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/insert-element-in-sorted-linked-list-7b082a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-employees-with-null-salary-and-nth-highest-salary-u9rxzo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/dijkstra-s-algorithm-graph-problem-ar58nr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/square-root-of-a-number-5yb9uu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/anti-clockwise-spiral-traversal-s3rxnw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-sequence-in-binary-tree-z0bb7m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/connect-n-ropes-ot83q7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/integers-without-consecutive-1s-in-binary-representation-4uan0t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/maximum-number-of-meetings-v8os3y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/maximum-sum-contiguous-increasing-subarray-ry0bbb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/search-node-in-n-ary-tree-and-return-level-3djs6b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/detect-and-remove-loop-in-singly-linked-list-5uk8sy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/print-elements-at-k-distance-from-a-given-node-mxvoj1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/vertical-line-crossing-the-most-segments-w53ref</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/when-does-shuffling-happen-in-spark-53ygzj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/diagnose-high-memory-use-with-constant-cpu-ne6tbg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/coalesce-versus-repartition-in-spark-e2704r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/parallelism-in-python-fo3h1n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/implement-a-linked-list-from-scratch-rdqgj4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/replace-atc-with-an-automated-system-via-apis-5fiw0d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/design-a-low-level-atc-system-for-a-50-km-radius-g7gh3r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/sql-joins-and-normal-forms-oral-78u7ii</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/have-you-worked-with-ml-on-the-cloud-818gnj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/what-is-rises-t0i824</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/cut-quality-tests-to-meet-a-client-deadline-x116jy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/convince-a-senior-using-an-outdated-approach-geghp5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/head-of-the-team-with-an-app-that-will-not-finish-on-time-f4epww</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/smallest-positive-integer-not-representable-as-subset-sum-9j4rjw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/generate-two-bsts-with-minimum-maximum-height-x98qpc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/cutting-a-rod-for-maximum-value-m4id7i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/stacking-cups-by-diameter-6iihaj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/find-next-greater-number-3ekbsb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/second-largest-element-in-an-array-k58ygr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/time-conversion-9hdqtd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/factorials-of-large-numbers-48vyem</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/detect-loop-and-find-middle-node-in-linked-list-gx68py</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/find-median-in-a-stream-rgh1em</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/common-elements-in-three-sorted-arrays-4eg8lq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/find-nth-element-from-the-last-node-ev4a9r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/find-nth-term-of-geometric-series-mnj2ny</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/remove-duplicate-elements-in-an-array-1fduz6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/write-sql-query-for-third-highest-salary-gf6v4z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/materialization-triggers-and-exception-handling-in-db-9apuly</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/explain-recursion-and-tail-recursion-with-fibonacci-th3uhe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/pointer-operations-and-merge-sort-implementation-tz4ru4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/oop-concepts-cpp-vs-java-and-machine-independence-cg9cpi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/linked-list-stack-and-queue-implementation-mkmx1y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-missing-elements-from-sorted-consecutive-numbers-vmajx6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/minimum-number-of-platforms-and-binary-tree-height-5w0ajx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/non-intersecting-connections-top-k-elements-and-splitwise-709hkc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/form-groups-from-string-with-distinct-subjects-90znqs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/print-new-list-with-count-of-string-occurrences-pxr6lv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/count-number-of-distinct-sum-subsets-within-range-2cn7ou</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-a-peak-element-in-an-array-quum5f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-row-with-maximum-sum-in-a-matrix-1cla7j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/build-lowest-number-by-removing-n-digits-wc2nr0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/buy-and-sell-stock-with-transaction-fee-kb1h0o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/design-a-hashmap-5z2fud</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/retrieve-all-records-from-a-table-ck51fs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-contiguous-subarray-sum-ex11qb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/determine-if-a-string-is-a-palindrome-2g21bg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/check-if-binary-tree-is-a-binary-search-tree-tjsbw7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/implement-a-min-stack-9ad3k9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/largest-square-submatrix-with-ones-grzpq4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/multi-threaded-factorial-calculation-65uooi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/write-a-simple-for-loop-in-java-e8rlg3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/what-are-the-four-pillars-of-oop-d3hsl2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/can-multiple-inheritance-be-achieved-in-java-43opno</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/describe-your-major-and-minor-projects-and-your-contribution-z3riyr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/give-a-real-world-example-of-recursion-ryskc1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/time-complexity-of-bubble-sort-and-insertion-sort-p7b3zx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/merge-two-arrays-and-sort-the-result-iq774r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/python-classes-objects-yield-generators-and-iterators-hx8lp0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/supervised-vs-unsupervised-learning-overfitting-kid33m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/most-used-phone-app-and-any-ai-apps-installed-u7nmj2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/describe-your-summer-and-other-internships-8ofkxx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/three-points-remembered-from-the-pre-placement-talk-5x07qy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/why-are-you-interested-in-this-job-ec1myj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/preferred-work-location-ukzw9g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/rate-your-technical-proficiency-out-of-10-ee7kip</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/write-a-code-snippet-for-an-operation-on-a-bst-suwk10</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/permutations-and-combinations-on-paper-mrpns8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/why-you-did-not-get-a-ppo-and-what-you-learned-from-the-25dc3n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/hobbies-and-follow-up-on-a-book-s-author-m7atae</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/comfortable-relocating-and-family-background-az6j97</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/normalization-vs-standardization-equal-weights-in-a-neural-myjun3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/cnn-terminology-layers-and-cnn-vs-rnn-8oito2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/print-primes-from-2-to-n-593bx9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/reverse-word-order-in-a-sentence-4n4koe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/explain-a-kaggle-notebook-and-project-work-3ukanv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/multiple-inheritance-interface-vs-abstract-class-static-cko14w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/gradient-descent-vanishing-gradient-feature-selection-vs-v1m45g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/explain-the-system-design-of-one-of-your-projects-1b0u3b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/delete-the-nth-node-from-the-end-of-a-linked-list-on5wd5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/why-do-you-want-to-join-nvidia-ol2gy9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/calculate-total-runtime-of-parent-job-rlgy6j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/knight-s-tour-problem-pvr9e2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/data-analysis-and-statistical-problem-solving-13qcqy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/palindrome-checker-dmq8a6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/prime-number-check-y1z5x4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/design-a-client-and-employee-database-schema-ph1mib</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/minimum-dice-rolls-for-snake-and-ladder-game-k3xws2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/implement-a-stack-and-explain-its-operations-2mbrq9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/check-if-a-number-is-a-power-of-2-using-bitwise-operators-khwb2v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/n-meetings-in-a-room-svfba3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/detect-and-remove-loop-from-linked-list-r2esa8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/match-a-string-in-an-array-nx3ps8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/go-game-problem-y15y45</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/minimum-wait-for-the-next-shuttle-bus-94dsls</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/word-ladder-reachability-a0mj1e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/count-ordered-pairs-a-b-with-a-b-n-2hcson</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/winner-of-an-elimination-game-between-two-sorted-teams-o6inia</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/what-is-a-dbms-and-why-is-it-preferred-over-file-systems-nl6fbw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/pillars-of-oop-polymorphism-and-its-types-ph3hml</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/function-overloading-versus-overriding-djpt44</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/explain-threading-in-an-operating-system-mcmdg1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/maximize-the-sum-of-k-elements-taken-from-the-array-ends-k53fu0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/rapid-fire-data-structure-questions-list-vs-vector-tree-s38evg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/row-counts-for-each-join-type-with-nulls-in-the-join-columns-usx4gb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-anagrams-in-a-list-of-strings-w2ur66</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-a-pair-summing-to-a-given-value-8urfyl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/spark-fundamentals-and-optimizing-a-spark-application-ykva1e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/describe-a-conflict-with-a-colleague-and-how-you-resolved-it-qj8l24</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/how-do-you-manage-deadlines-and-have-you-missed-one-euyf7r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/design-an-online-ticketing-system-frbc8s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bosch-global-software-technologies/common-hr-questions-including-what-differentiates-you-02cipn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/first-non-repeating-character-in-a-string-pt394q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/student-with-the-highest-average-exam-score-7hw44t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/starting-indices-of-anagrams-of-a-pattern-in-a-string-bqjx8a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/print-all-triplets-with-a-given-sum-2btiw1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-platforms-required-at-a-station-ko2wbz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/why-do-you-want-to-join-this-team-xzl9mj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/minimum-swaps-to-make-a-string-balanced-h1v341</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/remove-k-digits-ng4faf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/merge-two-sorted-lists-without-extra-space-j0pwxz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/excel-sheet-column-number-representation-ld5vde</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/acid-properties-of-databases-1ewfzs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/implement-a-hash-map-4lsfua</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/swap-linked-list-nodes-in-groups-of-k-x751h9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/clustered-indexes-xgwy5i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/sql-server-isolation-levels-w0782w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/difference-between-hashing-and-encryption-29i875</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/design-a-notification-system-1s5fqi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/make-a-class-immutable-myt28p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/count-combinations-with-a-i-b-j-b-k-c-l-hnl7mf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/longest-beautiful-subsequence-t-t-6yutha</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/where-vs-having-unique-vs-unique-all-and-partitioning-1lnxym</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/null-pointer-dangling-pointer-static-vs-dynamic-binding-oops-gj331r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/explain-all-sql-join-types-and-sql-vs-nosql-csd29t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/process-vs-thread-including-single-and-multi-core-behaviour-b4972m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/what-is-deadlock-construct-a-deadlock-with-five-diners-at-a-b7rzlq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/implement-a-stack-of-unknown-capacity-without-back-pointers-btnei8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/third-highest-salary-from-an-employee-table-ozmtc7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/employee-name-with-id-and-manager-id-from-a-self-referencing-ljwcc8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/cpu-scheduling-lru-and-synchronization-in-java-vs-cpp-kb5fw3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/design-facebook-chat-messenger-dz3zz8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/rearrange-a-linked-list-by-a-specific-interleaving-pattern-fz80ox</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/tell-me-about-yourself-competing-offers-internship-details-6eds39</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/knight-s-tour-on-an-infinite-grid-dr7lzi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/design-a-task-scheduler-class-dnhd76</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/convert-a-hexadecimal-string-to-decimal-mtlu9h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/explain-normalization-with-an-example-up-to-bcnf-8qo1yq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/execution-order-of-sql-clauses-and-where-vs-having-wwm4in</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/print-all-primes-up-to-n-fk7qhu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/check-whether-a-string-is-a-palindrome-in-java-8ttc1o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/why-optum-and-willingness-to-relocate-hq4kib</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/intersection-of-two-arrays-of-strings-4uuo9s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/find-element-k-in-bitonic-array-bfs7ed</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/form-a-ring-of-strings-q7pqjz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/rotate-a-matrix-by-90-degrees-0pnm82</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/towers-of-hanoi-tp1tu0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/sort-1-million-strings-yhnm5w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/heterogeneous-array-in-c-hffl5x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/n-ary-tree-implementation-vtpf4j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/find-palindromes-in-numerical-string-rp2vzr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/c-syntax-validator-y2z4tn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-the-nth-license-plate-based-on-a-complex-pattern-8sof7p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/word-break-yjijr4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/design-a-coding-practice-platform-similar-to-leetcode-0kt6kp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/first-and-last-position-of-an-element-in-a-sorted-array-56sgx5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/letter-combinations-of-a-phone-number-hq7m6x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/inorder-and-postorder-traversal-recursive-and-iterative-eka63t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/basic-design-of-an-api-rate-limiter-u2pztc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/why-do-you-want-to-switch-8ztqk2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/what-are-interrupts-t8cgsu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/smallest-of-three-numbers-without-comparison-operators-t8a5et</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/static-versus-dynamic-library-tv88jb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/static-functions-in-c-lz5p7g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/set-clear-and-toggle-a-bit-t1auqf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/minimum-element-in-a-sorted-rotated-array-74s0te</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/clone-a-linked-list-with-random-pointers-without-extra-space-d96u8p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/maximum-distance-on-a-circular-path-with-wildcard-moves-2wh08z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/count-distinct-merge-outcomes-of-an-array-d1rfae</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/ways-to-reach-the-nth-floor-with-limited-triple-steps-s9eu4h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/resume-and-background-questions-4jifvn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/normal-forms-and-anomalies-710osk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/nth-highest-marks-and-a-join-query-nh4wze</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/two-sum-and-then-3-sum-j71v4v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/java-compiler-versus-interpreter-jvm-garbage-collection-and-x22803</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/merge-sort-versus-quick-sort-rbkas9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/implement-a-blocking-queue-and-print-odd-even-numbers-with-9vltxb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/java-collections-concurrency-api-serialization-and-design-6wn0zz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/alien-dictionary-order-y03c5w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/median-of-a-number-stream-42457u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/producer-consumer-with-a-thread-pool-without-the-executor-234oq5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/garbage-collector-design-discussion-yg9sry</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/memory-management-allocation-and-fragmentation-vlqb42</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/design-a-bus-seat-booking-system-cii65a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/cut-a-two-letter-string-fairly-between-two-people-x5cwy7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/remove-one-element-so-the-array-splits-into-equal-sum-parts-pbjdm3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/print-a-fraction-with-the-recurring-part-in-brackets-5hi6hk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-your-own-deque-in-java-l7skc4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-coins-from-bottom-left-to-top-right-of-a-grid-jymk03</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/immutable-classes-and-defensive-copying-lta6sk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/house-robber-r068eo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/compile-time-versus-runtime-binding-with-field-hiding-n3kwh0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/explain-your-sdlc-code-review-release-and-regression-hq5dhl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/left-view-of-a-binary-tree-in-o-1-extra-space-sx111i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/abstract-class-versus-interface-oop-in-j2ee-collections-and-32tz71</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/design-a-data-structure-for-a-scenario-and-implement-your-pyu503</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/orm-update-and-delete-code-plus-sql-queries-462ypd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/rapid-fire-tree-height-postorder-problem-merge-sort-versus-j3lqqn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/what-is-transfer-learning-56rh9s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/data-structure-for-a-jigsaw-puzzle-game-and-matrix-rotation-7o1d8s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/project-deep-dive-and-work-experience-questions-td7p6x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/check-whether-a-player-has-won-a-tic-tac-toe-board-6d9by8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/find-all-dictionary-words-in-a-character-grid-bgozd6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/handle-a-vague-project-add-rotten-tomatoes-ratings-to-a-siri-u9sei2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/implement-a-dictionary-and-discuss-hashing-issues-khgdf6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/lexicographic-rank-of-a-string-24y60k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/partition-a-linked-list-around-a-value-in-place-gyc7jv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/level-order-traversal-stored-right-to-left-per-level-or9ofg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/jump-game-to-a-destination-value-x2ta6p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/second-last-node-and-kth-node-from-the-end-in-one-pass-0q3efl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/dfs-and-bfs-traversal-of-a-tree-v7ytlj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/hr-chat-on-experience-location-and-hobbies-jv5p3f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/count-unconnected-trees-and-the-root-with-most-children-b7fwui</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-equal-elements-after-at-most-k-increments-vdxch1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/task-scheduler-with-cooldown-xov43a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-a-ttl-based-cache-y3e8oe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/low-level-design-of-a-notification-system-0ew2ya</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/scheduling-algorithms-for-autonomous-vehicles-45vd7r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/how-the-stack-works-in-recursion-yeggh4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/iterative-inorder-traversal-using-a-stack-and-optimise-xiw9ck</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/32-bit-multiplication-on-a-16-bit-multiplier-alu-in-c-chwca2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/count-ordered-pairs-with-a-i-a-j-i-j-2jbbf8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/path-with-minimum-maximum-edge-security-level-il41qk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/split-data-into-minimum-packets-with-minimised-largest-h5ds4r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/detect-an-event-whose-duration-exceeds-a-timeout-bnk92f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/count-lucky-permutations-of-an-array-given-edges-8l5cw7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/count-special-numbers-divisible-by-another-element-ogm0h0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/count-submatrices-whose-sum-is-divisible-by-k-57rppe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/longest-palindromic-substring-for-every-prefix-luox2i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/product-of-array-except-self-handling-overflow-and-zeros-n8361v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/django-mvt-and-osi-tcp-ip-models-laik40</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/minimum-steps-for-a-knight-to-reach-a-target-b6kafa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/rotate-a-matrix-by-k-yuw353</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/project-audience-and-motivation-dn291v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/what-happens-when-you-enter-a-url-in-a-browser-bl3h65</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/why-computer-science-and-what-would-you-build-14dg5i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/final-coordinates-from-a-move-string-vb7a2i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/duplicates-nth-item-per-partition-self-join-matches-and-13rzbl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/word-frequency-subarray-sum-equals-k-and-merge-k-sorted-hbdn7x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/spark-optimisation-techniques-and-python-collections-e9f5w2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/generate-a-bank-statement-from-debit-and-credit-columns-ha2rb2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/characters-to-append-for-a-palindrome-and-email-masking-9o4nr0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/add-two-numbers-as-linked-lists-and-mirror-a-binary-tree-1ct8l9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/spark-architecture-error-score-file-validation-join-c31brh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/spark-job-slowing-from-5-minutes-to-2-hours-khxll0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/executors-for-500-gb-on-a-64-gb-16-core-cluster-5mkac2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/repartition-versus-coalesce-warehouse-versus-lake-and-nk4vlb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/design-snake-and-ladder-and-find-minimum-dice-rolls-i6uz8t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-the-3-fastest-of-25-horses-with-5-lanes-2suq7w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/logger-rate-limiter-with-additional-constraints-ma6s5h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-closest-common-manager-and-subarray-with-zero-sum-x8dd5i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/solve-3-dsa-problems-on-hash-maps-linked-lists-and-graphs-vj21fj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/detect-a-loop-in-a-linked-list-12q1v5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/spiral-traversal-of-an-n-x-m-matrix-ar6dq9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/detect-loop-in-a-linked-list-using-floyd-s-algorithm-8gxjy9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/swap-nodes-pairwise-in-a-linked-list-rpa8t5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/find-the-missing-and-repeating-number-from-1-to-n-k4zvlt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sql-queries-on-student-data-wq1p7q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-last-10-lines-4gqt12</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/first-unique-character-ybx19a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/spiral-matrix-traversal-cx0wiw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-words-in-string-i8h89i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/convert-linked-list-to-bst-mpv55s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/solve-the-josephus-problem-with-an-analytical-solution-ymwg6h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/design-a-game-leaderboard-showing-top-rankers-across-regions-n73bzz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/what-happens-when-you-type-a-url-in-a-browser-and-press-f7pmlv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/discuss-internship-scalability-open-source-work-and-apple-afge06</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-the-largest-rectangle-formed-by-given-points-min-area-lmzk39</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/minimum-lines-needed-to-print-a-paragraph-at-a-given-width-43jhef</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/time-your-proposed-solution-was-not-accepted-by-your-manager-1pvn3u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/time-you-joined-a-new-team-and-added-value-for-the-customer-pnw1gf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/how-would-you-react-joining-a-team-of-far-more-senior-shn1c2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/time-a-senior-pointed-out-problems-in-your-proposed-solution-1z3yi9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/longest-increasing-subsequence-where-adjacent-elements-wb1f17</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/find-a-path-through-a-0-1-grid-from-first-to-last-cell-u00n0k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/unique-email-addresses-leetcode-929-4opvad</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/build-a-rest-service-serving-player-data-from-a-csv-f63n3g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/design-a-photo-storage-application-sr36e4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/jump-game-can-you-reach-the-last-stone-klo8el</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/implement-merge-sort-and-analyze-its-complexity-and-edge-g07nsc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/walk-through-resume-projects-conflict-handling-and-learning-k09phf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/solve-the-n-queens-problem-via-pair-coding-22gutr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/manage-teammate-conflict-project-challenges-and-project-wfh67x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/what-is-semantic-html-and-give-example-tags-m2ka8q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/is-javascript-synchronous-or-asynchronous-explain-the-event-tc7c7u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/flatten-an-n-dimensional-array-without-built-in-functions-zvbyl5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/explain-and-implement-debouncing-ewf8nf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/build-a-responsive-bootstrap-style-tab-component-in-react-32ca3h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/implement-a-phone-directory-using-a-trie-98b72q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/implement-browser-back-and-forward-buttons-25pm6n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/print-all-subsets-of-an-array-q4a4lu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/all-nodes-at-distance-k-in-a-binary-tree-ncod4k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/design-low-data-notifications-for-mobile-recharge-users-7h78wh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/house-robber-ii-h2r43d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/design-a-high-scale-e-commerce-app-that-survives-flash-sale-x4xu51</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/length-of-the-longest-run-of-consecutive-1s-in-binary-en7hnn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/maximum-sum-with-no-two-adjacent-elements-7a0msu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/implement-a-linked-list-and-find-its-middle-element-jg7ymu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/celebrity-problem-using-a-stack-eag6j9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/dijkstra-shortest-path-modified-into-a-dp-problem-f09fak</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/smallest-divisor-given-a-threshold-gku8tc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/print-all-subsequences-of-a-string-bl5upk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/decode-a-string-with-a-circular-cipher-given-shift-k-ib7y7m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/find-median-from-a-data-stream-hje9nd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/implement-explode-without-the-built-in-spark-explode-9lpzcb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/can-the-second-string-be-made-by-repeatedly-inserting-copies-xbvh8j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/build-a-string-choosing-at-most-one-character-from-each-p1p427</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/heapsort-and-quicksort-analysis-pdr70a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/remove-duplicate-occurrences-in-sorted-linked-list-pa590u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/distinct-character-numbers-in-range-9aeuhg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/lexicographical-largest-subsequence-a5wksc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/print-perimeter-elements-of-a-matrix-o1pbxt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/hierarchy-query-ix99wj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/complex-nested-div-css-selection-qqw54z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/top-10-amps-from-each-designation-sql-query-jiwb4z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/build-order-problem-involving-project-dependencies-ybn3yk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/calculate-sum-of-elements-in-a-submatrix-rectangle-j5y9dq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-number-of-islands-in-a-matrix-drqf6p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/insert-node-into-generic-tree-with-child-sum-constraints-16vqcl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/maximum-distinct-speakers-in-m-continuous-days-jg8zuh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-median-of-two-sorted-arrays-y1ckf0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-event-dependencies-and-circular-dependencies-1g0myl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/delete-a-node-given-only-a-reference-to-that-node-in-a-7xmuty</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/distinct-pairs-with-difference-k-rx3gag</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/sum-of-votes-query-6d1bpc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/concatenate-strings-in-alphabetical-order-70xsw5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-character-groups-cd2ksw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/binary-search-tree-operations-mwg6h7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/deep-dive-into-cuda-and-inference-engine-experience-8u2rmv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/point-where-the-maximum-number-of-intervals-overlap-gpcf2n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/find-bugs-in-a-roughly-250-line-c-program-pm04ic</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/computer-architecture-gpu-and-cuda-questions-3hjdi0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/compiler-design-phases-and-syntax-trees-67revk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/walk-through-resume-and-why-the-compiler-intern-role-81dzz2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/level-of-a-binary-tree-with-the-most-alive-nodes-vpqq2y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-all-pythagorean-triplets-between-1-and-100-5lyvwf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/jug-and-burning-rope-puzzles-iq6p9l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/why-a-software-career-from-an-electronics-background-qmc5qt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/bubble-sort-palindrome-check-and-largest-palindromic-pino22</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/introduce-yourself-and-explain-a-project-4j5jl1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/rotate-a-matrix-90-degrees-clockwise-jnt1h9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/merge-k-sorted-linked-lists-4j97pa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/maximum-length-of-a-mountain-in-an-array-o7pbah</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/o-1-space-and-o-log-n-versus-o-n-time-gb6cfv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/what-happens-when-you-search-google-com-tcp-vs-udp-caching-b534bp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/teamwork-without-enough-guidance-and-communication-gaps-i11yb4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/innovative-solution-in-a-project-m6fdsl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/dealing-with-setbacks-and-delivering-results-xhum8x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/subarray-with-given-sum-and-check-if-a-tree-is-a-sumtree-agpax9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/pyspark-jvm-scala-versus-java-rdds-and-dataframes-49j5ao</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/data-modelling-sql-normal-forms-er-diagrams-and-keys-ztkvm8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/distributed-file-systems-and-parquet-versus-avro-cfxjj8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/median-of-a-stream-of-integers-24a1bg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/why-leave-why-goldman-sachs-what-you-bring-rtf10p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/count-robot-paths-through-cells-of-1-in-a-grid-6gi1mt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/ml-model-accuracy-95-in-test-but-10-in-production-9c53cd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/write-a-prompt-so-chatgpt-returns-a-correct-json-result-3acjm1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/add-an-api-with-service-layer-and-tests-to-a-given-repo-2g7c5v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/check-whether-a-bracket-string-is-balanced-5qet67</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/heavy-load-scaling-rate-limiters-and-thundering-herd-x9wcg5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/find-a-pair-of-values-summing-to-a-target-b1mr0h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-path-sum-in-a-matrix-and-unique-triplets-with-given-v6q22l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/max-sum-of-non-adjacent-nodes-in-a-binary-tree-w6yltw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-sum-that-cannot-be-created-with-given-coins-cynxk3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/n-queens-and-merging-intervals-l2ay11</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/design-a-web-app-supporting-multiple-languages-nh58tq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/pairwise-swap-linked-list-nodes-generalized-to-k-ab2p5n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/kth-largest-element-in-a-bst-without-modification-0tad71</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/selection-ways-and-dice-probability-lji8xc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/time-complexity-of-a-recursive-power-function-and-dpqf3e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/convert-nchw-tensor-layout-to-nhwc-in-a-1d-array-4vtlvg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/search-in-a-sorted-and-pivoted-array-ohd88i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/stack-supporting-getmin-in-o-1-time-and-extra-space-o6z2vd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/implement-aligned-malloc-op9mhg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/minimum-matches-to-find-best-and-second-best-of-128-players-zytcv9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/two-threads-printing-even-and-odd-numbers-in-order-bjvr6k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/mutex-vs-semaphore-shared-resource-issues-and-deadlock-n9h144</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/proud-projects-challenges-and-learnings-a1yi1k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/path-in-a-grid-avoiding-blocked-cells-then-minimum-moves-to-ymx6bp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/intersection-of-multiple-linked-lists-with-duplicates-c1a6l0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/find-the-kth-node-from-the-end-of-a-linked-list-c0b8w5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/compiler-optimizations-such-as-loop-and-peephole-41qrx7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/merge-sort-on-a-linked-list-with-runtime-analysis-o2froe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/extract-words-of-a-sentence-into-a-2d-array-in-c-prof4j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/maintain-top-9-apps-in-a-3x3-grid-zxcq18</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/reduce-cache-misses-when-multiplying-large-matrices-pxn92z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/reduce-time-when-a-compiler-invokes-another-15-times-rmit3m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/project-details-approach-data-structures-and-design-patterns-232r7k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/project-questions-and-why-join-this-field-560ac3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/convert-a-tree-to-a-sum-tree-9sxuza</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/form-the-least-possible-number-from-a-sequence-a3952x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/coin-change-ways-and-longest-palindromic-substring-lu2uo3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/all-insertion-orders-that-produce-a-given-bst-27tt3i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/count-the-number-of-islands-in-a-grid-qcctx4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/auto-correct-and-auto-complete-using-a-trie-3vxpas</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/browser-back-and-forward-navigation-k0zqj1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/testing-code-reviews-environments-and-debugging-024q70</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/distributed-servers-load-balancing-caching-and-scaling-3eqayq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/beyond-comfort-zone-feedback-customers-ideal-team-why-s3tc0h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/count-colorings-of-an-n-x-3-grid-with-3-colors-s3hhly</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/split-a-string-so-no-character-appears-in-two-parts-kt1nm7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/do-two-intervals-intersect-id18z8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/first-repeated-word-case-insensitive-bn72ug</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/bubble-sort-then-a-faster-sorting-algorithm-p0a9a6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/numbers-not-visited-by-frogs-in-a-queue-4jxnj3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/maximum-balloons-shot-by-one-arrow-on-a-grid-bes2nu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/database-concepts-denormalization-foreign-key-acid-u0emfu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/steps-to-build-an-ml-model-from-a-business-use-case-zan0kb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/devops-cloud-shift-and-cloud-providers-tqf091</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/going-against-a-manager-and-skills-to-develop-3nr0c1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/what-is-a-rate-limiter-and-where-does-it-sit-in-hld-s9wz2a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/lld-of-a-wiki-management-system-u62wxa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/partition-tolerance-versus-availability-r7oyw6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/load-balancers-auto-scaling-monitoring-caching-and-eviction-a775vg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/lru-cache-with-o-1-operations-thread-safe-1qmo7d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/save-gotham-82lbkd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/size-of-the-largest-identical-binary-tree-2myk4i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/extend-short-rhyme-scheme-to-match-long-one-ixi8u2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-root-for-valid-alternating-binary-tree-9m5g41</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/minimum-operations-to-make-string-empty-by-removing-yubyk9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/count-distinct-decimal-subsequences-from-a-binary-string-9t5the</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/max-subarray-sum-with-first-and-last-elements-same-vbzu2t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/determine-if-m-x-n-matrix-can-be-printed-with-solid-color-w855j1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/power-of-5-check-and-remove-unnecessary-spaces-in-string-rfa0xs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/optimize-a-b-split-search-query-and-develop-snake-game-p464pb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/password-generator-3khuql</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/the-longest-fibonacci-series-into-an-array-uoy4jb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/group-strings-that-are-rotations-of-each-other-b7aem3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/order-of-deleting-storages-with-parent-child-dependencies-x5nxcm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/minimum-cost-route-through-teleporters-with-broken-ones-wh4bnp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/giving-harsh-feedback-that-helped-someone-grow-chds2o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/example-of-going-out-of-your-way-at-work-846mz5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/what-do-you-plan-to-learn-in-the-next-year-wtw8tb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/design-email-retrieval-ranked-by-a-query-and-user-profile-7938mr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/describe-your-experience-with-microsoft-azure-for-data-lf7nsb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/ensuring-data-security-and-compliance-for-healthcare-data-on-gt92md</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/experience-with-azure-databricks-for-big-data-processing-and-ss8deo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/managing-and-optimizing-cost-of-azure-data-workloads-a9ez65</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/most-frequent-digit-among-primes-in-a-range-8kthgu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/java-language-fundamentals-autoboxing-annotations-isinstance-6ulqeu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/what-happens-to-other-threads-when-one-throws-a-runtime-e8280w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/explain-java-garbage-collection-and-the-java-memory-model-goa9ih</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/hashmap-vs-treemap-concurrenthashmap-and-overriding-4ipnc0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/implement-an-lru-cache-without-linkedhashmap-bmdqi4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/explain-inner-classes-and-where-famous-java-apis-use-them-5xv1k2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/reverse-a-linked-list-tree-height-and-leaf-count-for-a-node-z6vztu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/how-linkedin-computes-the-number-of-hops-between-connections-45lf5l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/remove-spaces-from-a-string-in-constant-space-without-built-30v84y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/highest-average-of-marks-xm6cf8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-meeting-rooms-required-6ql4qz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/product-of-the-last-k-integers-from-a-stream-b2as5p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/scenario-question-on-load-balancing-scaling-db-optimisation-2sxvvk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/agile-ci-cd-testing-and-spring-boot-fundamentals-b9zfnr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/design-a-file-management-system-ow7yhs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/data-warehousing-data-modelling-and-slowly-changing-0fb0em</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/two-sum-in-python-nz3l1j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/why-do-you-want-to-work-at-walmart-1mhcqh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/design-a-upi-like-system-with-multiple-wallets-woo2f4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/locking-mechanisms-and-transaction-isolation-levels-7nl83d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/redis-and-caching-strategies-99egid</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/handling-thread-failures-or-downtime-under-high-load-5vnfx1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/sql-with-dense-rank-and-rank-vs-dense-rank-jihfd5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/mislabeled-jars-puzzle-thmq8h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/explain-an-sql-based-project-in-detail-uinnc1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/find-the-k-th-frequent-element-in-an-array-m86u8t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/print-a-binary-tree-in-spiral-order-59rexk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-the-k-th-smallest-element-in-a-bst-bj7dmv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/reverse-a-linked-list-and-min-heap-vs-max-heap-4ezxtp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/lambdas-hashmap-internals-memory-management-and-gc-t9ylcf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/design-an-event-planner-with-room-and-attendee-availability-l8lhz7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/why-this-role-experience-goals-and-why-apple-zdc3a9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/vote-counter-with-rank-based-counting-for-millions-of-votes-qnh0bc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/value-of-the-n-th-node-at-level-l-in-a-0-1-binary-tree-332lv4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/find-all-english-words-formable-from-a-set-of-characters-wfbfw8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/deep-dive-into-past-tasks-decisions-and-performance-7uy18z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/how-have-you-shown-apple-values-like-deep-expertise-and-307thq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/sample-n-items-preserving-the-original-probability-7qroi1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/react-component-to-display-1m-records-gpipl9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/build-a-simple-web-application-in-two-hours-yqv64k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/java-fundamentals-platform-independence-collections-6rrjq4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/spring-and-spring-boot-basics-k07lde</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/maximum-trains-that-can-stop-at-a-station-67ydjx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/where-spring-boot-and-node-js-run-and-dependency-management-cltg21</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/countdown-timer-from-a-time-read-from-a-file-ano7mm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/design-a-form-with-a-subscription-fee-used-by-billions-v2w2mg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/validate-a-completed-sudoku-board-lyeq9n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/react-fundamentals-css-concepts-and-frontend-behavioural-v5dwzz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/design-a-logs-monitoring-system-l7v2c2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/past-experience-how-you-work-values-and-collaboration-3d6fin</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/convert-postfix-expression-to-infix-expression-owz1lo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/decode-an-encoded-string-z29w5f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/word-ladder-transformation-sequence-be4zhm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/least-number-of-unique-integers-after-k-removals-n0gi7e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/encapsulation-in-python-i3o8li</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/remove-vowels-from-string-4iahty</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/producer-consumer-event-processing-ke1ljr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/min-swaps-to-balance-parenthesis-4r5byd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/palindromic-substring-a6jh7h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-whether-a-string-is-a-palindrome-python-du62op</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-the-vowels-in-a-string-python-mog7j9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/create-two-related-tables-and-count-employees-per-department-gtr60v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/dbms-vs-rdbms-olap-vs-oltp-and-data-warehouse-basics-914dlc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/keys-normalization-joins-and-star-vs-snowflake-schema-53sapv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/face-mask-detection-project-deployment-and-last-minute-lpq60p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/detect-whether-a-linked-list-is-circular-n15ovp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/how-would-you-learn-cpp-from-scratch-3lzpz7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/design-an-lfu-cache-as-an-end-to-end-product-pv6c84</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/deep-dive-on-current-project-and-its-research-paper-4cmvw2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/disagreement-with-a-co-worker-where-you-later-found-you-were-rg9437</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/generate-parentheses-g2ckvb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/handling-conflict-in-a-cross-functional-team-es8vhs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/what-would-you-do-if-a-teammate-is-not-responding-lm96s0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-unique-permutations-of-digits-without-leading-zeros-pvze2d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/design-an-ott-platform-like-netflix-or-prime-video-03qn22</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/word-ladder-style-shortest-transformation-problem-hwpi2f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-whether-an-array-is-a-valid-mountain-array-4amrl9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/median-of-two-sorted-arrays-of-different-sizes-aywj4q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/hld-of-your-current-project-with-requirements-and-6egjon</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/design-and-code-an-api-for-a-front-end-service-java-spring-b8ohgr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/prioritized-task-queue-blocked-in-production-with-an-ad-hoc-n50kxq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-repeating-element-in-a-sorted-array-cu3x0r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/design-a-logger-that-discards-duplicates-within-a-resetting-oma7jc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/design-a-phonebook-application-i18yxq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/where-is-google-lagging-behind-its-competitors-and-why-78s7bw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/conflict-with-a-co-worker-or-team-4x5cjo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/a-challenge-you-faced-at-work-pp9nmg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/when-did-you-promote-an-inclusive-work-environment-3cermr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/a-time-you-had-to-adapt-s3ctak</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/critical-bug-fix-about-to-ship-but-some-user-subgroups-are-8zrcd3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-common-prefix-using-a-trie-h11myy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-elements-in-query-ranges-where-max-minus-min-is-below-90zwwq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sum-of-leaf-nodes-at-the-minimum-level-of-a-binary-tree-ti3bqc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/critical-section-race-condition-and-solving-the-critical-j6mgz4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/concept-of-virtual-memory-1b46jy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/producer-consumer-problem-explain-and-write-code-t1r5th</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/represent-the-fraction-of-two-numbers-as-a-string-2y4ht0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/detailed-discussion-of-projects-and-current-internship-pxvt4k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/write-a-recursive-fibonacci-function-and-analyze-its-z5qy5k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/start-and-end-index-of-the-maximum-subarray-t43rl8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/kth-largest-element-at-every-position-in-an-infinite-stream-4byxqg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/why-microservices-instead-of-a-monolith-in-your-project-gus2aj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/which-design-pattern-decides-the-object-created-at-runtime-h1i6w6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/active-active-vs-active-passive-architecture-drcnb4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/ensuring-kafka-events-land-in-the-same-partition-nfa5vy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/how-a-distributed-redis-cache-works-dnq5rx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/reentrant-locks-and-whether-they-work-across-different-zx6x2x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/first-missing-positive-then-expose-it-as-a-rest-endpoint-z83xyi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/ci-cd-build-process-istio-and-service-mesh-features-zasm6s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/spring-boot-annotations-q7z1qd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/high-level-design-of-twitter-with-read-heavy-multi-region-3mb9x7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/what-is-a-b-testing-and-how-would-you-build-its-y2k1vh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/what-is-canary-deployment-g8l40f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/ci-cd-process-followed-in-your-project-0nhwox</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/handling-a-conflict-situation-with-your-manager-flab3i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/your-design-works-while-the-architect-s-design-fails-in-t6ijoy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/how-you-find-time-to-upskill-and-use-ai-daily-638gig</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/minimum-over-a-sliding-window-in-a-2d-matrix-b7hym3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/reverse-bits-in-a-range-l-to-r-of-an-integer-in-o-1-8h6syq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/check-whether-the-compiler-is-little-endian-or-big-endian-i6lj3a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/cache-threads-ram-and-paging-with-logical-to-physical-eg0l6h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/reverse-a-linked-list-from-scratch-5dtjt7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/print-1-to-n-using-n-threads-in-sequence-indefinitely-igs6fh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/shared-memory-between-threads-and-cache-write-back-policies-0s6s7u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/variable-storage-templates-inline-functions-c-program-qs9ege</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/automatic-fan-speed-control-from-multiple-temperature-dk49r7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/check-whether-a-linked-list-is-a-palindrome-try7hm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/semaphore-vs-mutex-paging-virtual-vs-physical-addresses-qzx2mb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/interest-in-the-role-and-plans-for-a-master-s-vwbe2e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/apple/design-a-clickstream-data-processing-system-for-log-data-u7fqq5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/check-for-a-cycle-in-a-linked-list-6px8iy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/reduce-a-string-by-removing-k-consecutive-identical-s8qd8j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/count-the-ways-to-reach-a-given-score-in-a-game-rm0frk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/circular-array-loop-leetcode-457-qvjh5t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/average-score-per-student-from-name-score-pairs-d2ch12</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/smallest-window-containing-all-characters-of-another-string-iz15og</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/kth-smallest-or-largest-element-in-an-unsorted-array-off5c4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/data-structure-that-sets-all-values-in-o-1-xvz1gx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/pseudocode-for-an-lru-cache-using-a-queue-ck74oj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/process-vs-thread-and-what-a-restful-service-is-ac71eq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-a-thread-pool-manager-vi3mv0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/pseudocode-for-an-mru-cache-using-a-stack-6z5vj8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/kubernetes-and-the-advantages-of-vms-over-docker-g7p8oz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/aspirations-and-what-you-are-looking-for-at-goldman-sachs-c3fk49</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/count-the-number-of-factors-for-each-number-in-an-array-e6kqg5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/swap-vowel-then-consonant-pairs-and-strip-special-characters-b80ny9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/sql-command-categories-and-joins-on-two-tables-30hckp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/what-happens-when-you-message-a-friend-on-whatsapp-pi6y42</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/reverse-a-singly-linked-list-with-optimizations-adle7n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/detect-stack-and-heap-growth-direction-931w18</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/different-ipc-mechanisms-and-d-bus-pros-and-cons-wv732g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/how-does-boost-asio-work-and-how-did-you-use-it-2f9l6t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/find-the-missing-number-in-an-array-and-optimize-it-412a26</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/when-do-you-need-a-vector-and-how-does-it-work-internally-27cje1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/how-to-tell-little-endian-from-big-endian-architecture-fz0kbi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/how-d-bus-supports-ipc-and-its-ways-of-communicating-227zeh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/implement-memcpy-including-overlapping-memory-wbneh1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/solve-abcd-x-4-dcba-rwfv8f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/risc-vs-cisc-arm-vs-x86-and-cross-compilation-c4y6wg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/count-the-set-bits-in-a-number-w7lsoq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/constructors-destructors-delete-vs-free-object-creation-and-l2b6k7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/validate-ip-address-ofg5hy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/how-to-ensure-an-api-has-no-downtime-and-models-in-trending-j4yhm7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/add-a-new-api-to-a-given-flask-repo-and-discuss-edge-cases-1tp5l4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/extend-the-database-design-for-new-entities-and-map-it-to-a-01mmg8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/what-tests-would-you-write-for-the-api-from-round-1-nsaq9i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/what-is-rag-system-prompts-and-llm-temperature-ozra4i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/managing-work-pressure-and-why-switch-7lkd5o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/find-the-root-and-build-a-tree-from-parent-child-pairs-ob8uub</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/project-contributions-expectations-for-the-role-and-career-couc4h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/distinct-numbers-by-flipping-bits-ne8yli</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/detect-loop-in-linked-list-6ctcpk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/max-path-sum-in-binary-tree-hnn3z2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximize-stick-cutting-value-p4syi7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-element-in-infinite-array-po4gu8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/connected-components-sorted-by-component-sum-and-node-count-9baxlo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-pair-indices-with-highest-randomnessfactor-tq200t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/clone-a-singly-linked-list-with-next-and-arbitrary-pointers-pedr4z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/maximize-distance-between-1s-by-flipping-m-zeros-5fp85p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/check-string-rotation-equality-2yo1ut</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-the-single-non-repeating-number-in-array-2wdx23</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-factorial-of-a-large-number-9vlvpu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/reverse-alternate-groups-of-k-nodes-in-a-singly-linked-list-rql646</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/create-a-class-in-solidity-n80tsb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/count-triplets-with-product-equal-to-a-given-number-c4vzc2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-the-kth-largest-element-in-an-unsorted-array-va9ez9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-the-gcd-of-two-numbers-dmrw5u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/top-view-of-a-binary-tree-12zaap</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/print-the-power-set-of-a-string-of-distinct-characters-cn5m5r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/practical-uses-of-different-data-structures-a3qec7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/print-a-binary-tree-in-vertical-order-14vfb5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/what-new-and-exciting-thing-did-you-do-in-the-last-few-days-6i6bf1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/find-elements-that-occur-more-than-once-in-an-array-siwh9x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/find-elements-appearing-more-than-n-k-times-f7rb1q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/lowest-common-ancestor-with-parent-pointers-fakci9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/maximum-even-sum-from-a-list-of-numbers-3e3zrs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/deep-dive-into-last-project-and-tech-stack-choices-0l6d9n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/design-a-cleartrip-like-service-with-premium-members-a08lp4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/implement-calculateeta-based-on-vehicle-type-i3pxwp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/design-paytm-risk-management-service-tcr6xy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/tell-me-about-a-time-you-used-ml-or-ai-in-a-project-iby6dr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/tell-me-about-a-project-you-worked-on-from-start-to-end-k61ueq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/how-do-you-handle-a-non-technical-customer-or-stakeholder-txf9ii</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/tell-me-about-a-recommendation-that-influenced-stakeholders-9uk32y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/tell-me-about-a-risk-you-took-and-whether-it-paid-off-2yw3mq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/calculate-churn-rate-from-a-company-level-table-re6ae0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/build-monthly-retention-curve-with-30-60-90-day-6-month-and-ve7q10</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/compute-ctr-by-score-bin-from-scores-and-interactions-tables-ajov1l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/best-time-to-buy-and-sell-stock-with-cooldown-5im9o5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/sort-a-nearly-sorted-k-sorted-array-i0moo9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/method-overriding-vs-overloading-lli5h4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/bike-model-with-comparator-hashset-equality-and-facade-muo2gq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/threads-executor-services-future-and-callable-56h9h3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/data-quality-in-a-streaming-pipeline-p3m8ou</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/solid-principles-and-agile-in-the-previous-company-l22uvb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/strengths-weaknesses-and-recognised-accomplishments-aocqg4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/why-switch-salary-expectations-and-expectations-from-walmart-71w6xy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-the-pivot-in-a-rotated-array-with-duplicates-7vjavx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/classic-0-1-knapsack-bt1w8m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/hashmap-internals-java-deep-dive-and-time-complexities-lm5lru</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/design-a-notification-sending-system-for-multiple-user-0ofbuc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-the-kth-largest-number-in-a-stream-klr89n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/minimum-number-of-platforms-required-wovuz3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/coin-change-count-the-ways-to-reach-a-target-o028jj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/concurrenthashmap-hashmap-working-and-string-mutability-zixha0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/build-an-in-memory-cache-with-eviction-and-ttl-mytyn3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/email-notification-system-with-retries-and-async-handling-i83ix6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/upi-like-payment-system-y782dp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/ride-booking-system-7oe73u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/merge-two-sorted-linked-lists-and-reverse-the-result-9ce12s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/singleton-strategy-and-builder-patterns-and-solid-7m2b0a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/spring-aop-boot-and-internal-tomcat-wd8ux6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/atomic-integer-virtual-keyword-and-visibility-vs-w8j73s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/sql-vs-nosql-indexing-and-cap-theorem-7fy9l0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/hld-of-tinyurl-3kgjcm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/check-whether-a-string-is-a-palindrome-xzo97k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/find-the-kth-min-max-element-using-a-heap-zkve2b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-an-n-ary-tree-0wo5ul</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/product-of-array-except-self-joi20d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/count-total-anagram-substrings-ykvpk0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/design-sql-tables-for-users-with-multiple-passport-numbers-db232q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/rotten-oranges-problem-1d45tz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/minimum-number-of-platforms-for-trains-qho9rs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/internal-working-of-hashmap-in-java-0u3ybw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/oop-concepts-singleton-factory-and-multithreading-t7ul9f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/sql-vs-nosql-cap-theorem-and-acid-igb5k7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/why-switch-challenges-favourite-project-team-conflict-9s4vqn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/why-choose-data-analytics-mbg5y8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/which-google-product-did-you-find-a-bug-in-and-how-would-you-45t8uf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/segregate-even-odd-list-max-sum-non-adjacent-character-n2elxi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/vertical-order-traversal-and-rotten-oranges-3a2yu6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/median-of-stream-perfect-sum-median-of-two-sorted-arrays-r87413</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/sort-colors-and-partition-equal-subset-sum-qrwi58</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/minimum-platforms-for-railway-station-5l5s8k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/hackwithinfy-coding-round-1-ju1y9e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/hackwithinfy-coding-round-2-iug67s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/dictionary-pattern-matching-using-trie-qq7x0v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/distance-between-two-nodes-of-binary-tree-vntb6z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/cut-two-strings-at-a-common-point-to-form-a-palindrome-8xsilp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/edge-test-cases-for-calculator-function-5h14kz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/design-data-structure-for-boolean-stream-with-bulk-updates-3h4rwy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/design-data-structure-for-player-scores-and-rankings-6kb4xp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/lexicographically-smallest-subsequence-of-length-k-xv1md8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-nearest-bike-for-people-on-a-matrix-ktbm9b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/minimum-steps-for-a-knight-on-an-infinite-chessboard-ya4ehn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/replace-most-frequent-character-in-string-with-k-edt44n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/count-elements-matching-specific-index-and-parity-rules-u0qncq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/print-sum-of-numbers-present-in-alphanumeric-string-sfgr0n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/xor-without-xor-operator-ej54m9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/string-and-integer-stream-processing-e0a0ra</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/implement-thread-priority-1dg9jf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/detect-loop-in-linked-list-and-find-start-c1ckvc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/spiral-order-binary-tree-traversal-yd4mab</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/find-first-index-of-substring-9i880s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/fake-palindrome-substring-count-0o3cfm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/continuous-subarray-with-target-sum-0ssanl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/sql-join-differences-and-highest-salary-3tumc7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/integer-to-binary-conversion-2ii63f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/most-frequent-words-in-chat-cl9kad</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/max-consecutive-neighbors-in-grid-vh4feo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/file-directory-visit-summary-z718kv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/election-vote-combinations-olqj7l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/maximum-area-of-rectangles-in-a-matrix-88k3jf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/squares-of-a-sorted-array-fn2haz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/check-if-array-pairs-are-divisible-by-k-9gkdfh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/top-k-frequent-words-hw78sh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/count-possible-decodings-of-a-digit-sequence-ydejn7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/palindrome-partitioning-8no8fm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/check-whether-two-binary-trees-are-identical-qu1gbn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-the-smallest-missing-positive-number-in-an-unsorted-5u4s4v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/linked-list-with-next-and-arbitrary-pointers-2mtys8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/detect-and-remove-a-loop-in-a-linked-list-k6ggna</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/sql-query-execution-5sgore</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/first-and-last-occurrence-in-sorted-array-mc6xdu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/lowest-common-ancestor-in-binary-tree-5x3yg6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/balanced-parentheses-expression-ufg4xq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/scenario-based-data-structure-selection-s24x98</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/finding-middle-element-in-a-linked-list-4aj7k1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/modify-constant-variable-in-c-fgq22j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-subarray-with-consecutive-elements-jh7302</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/custom-datatypes-in-cpp-3cqfwy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/shortest-path-in-nxn-maze-g8asaa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/forming-numbers-with-operations-j565au</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/add-two-numbers-represented-by-linked-list-3k4tnw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/spiral-level-order-traversal-9wgc6s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-loop-in-array-uctov7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/basic-sql-query-to-retrieve-filtered-data-1kyn7v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-a-rest-api-for-managing-product-data-with-crud-k9fxe5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/implement-a-sorting-algorithm-efficiently-s6bffy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/swap-strings-without-a-temp-variable-and-implement-strcpy-mpbb1h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/first-non-repeating-character-in-a-stream-erq567</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/purchasing-supplies-chocolate-wrapper-problem-w8xpkw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/count-index-triplets-with-conditions-wvo6jh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/count-of-subarrays-having-exactly-k-perfect-square-numbers-hs1i2c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/burn-a-binary-tree-starting-from-the-target-node-utm3nb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/push-dominoes-simulation-fsaee1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/generating-sequence-with-lcs-cost-b5sahg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/lexicographically-smallest-number-dv9jjv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/max-sum-of-nodes-at-level-vbgvy3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/mirror-image-of-tree-iif3mp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/reverse-doubly-linked-list-7ijfwa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/written-exam-with-aptitude-c-programming-algorithms-and-2-q08czc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/java-oops-string-immutability-linkedlist-middle-element-and-0xzswu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/leader-element-html-ui-modification-and-sql-table-joins-dbm9l0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/manually-calculate-bits-and-endianness-nh0vmy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-kth-largest-element-in-array-tmion7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/minimum-number-of-steps-to-reach-end-of-array-tts01a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/divide-number-and-return-result-as-string-with-repeating-wko1uy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-median-of-a-stream-of-numbers-tt0qtl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/pancake-sorting-style-character-array-sorting-hckc7z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-count-of-a-number-in-sorted-array-7wrgmu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/draw-a-line-on-a-2d-array-of-booleans-i7fhzs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/compare-two-documents-using-n-grams-ftcth2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/get-the-3rd-highest-salary-u896gk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/remove-duplicate-rows-in-sql-9qmbev</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/where-vs-having-1s72db</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/sql-indexing-34iv5c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/handling-large-csv-files-in-python-w7ijv7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/map-filter-and-reduce-4mawgp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/database-connectivity-in-python-qv86jl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/exception-handling-zo2k28</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/rdd-vs-dataframe-ewl5ju</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/reading-csv-in-pyspark-qegr28</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/shuffle-operation-in-spark-a0gciz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/pyspark-performance-optimization-gk9cyt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/schema-evolution-in-delta-lake-k8zzg1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/kth-digit-of-a-b-expression-reduction-and-cell-traversal-lwr2rk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-odd-element-and-node-out-and-jump-game-variation-pl2qme</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/word-ladder-and-o-1-randomized-data-structure-7mvhez</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/max-occurring-string-with-limited-memory-bciwy1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/make-a-string-a-palindrome-by-removing-a-character-gp5pa4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/evaluate-a-simple-expression-with-only-and-9uimd8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/shortest-path-in-a-binary-maze-4-directions-vvzjw7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/sorted-insert-into-a-circular-linked-list-from-an-arbitrary-xvo12d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/merge-3-sorted-arrays-without-duplicate-values-puxdg0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/design-a-web-crawler-9ytdvk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/ocean-view-buildings-504oy8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/pattern-target-matching-with-removable-repeated-characters-94cqc1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/project-you-are-proud-of-a6sk9y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/conflict-with-a-teammate-fgw6p7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/a-time-you-disagreed-with-someone-u2gcr5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/a-time-you-had-to-follow-someone-else-s-opinion-xl72bj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/design-an-online-food-delivery-app-qn56t9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/lru-cache-9ro1yk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/palindrome-after-deleting-certain-characters-s0mkjr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/variation-of-minimum-meeting-rooms-required-bnt3r1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/low-level-design-of-a-music-player-app-like-spotify-l7q9nz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/design-a-url-shortener-with-multi-region-deployment-bovjl8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/handling-idempotency-during-checkout-8p5ijp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-parentheses-to-make-a-string-valid-pix7jh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/smallest-substring-occurring-only-once-incd0j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-two-incorrectly-placed-nodes-in-a-bst-zzgj2j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/generate-all-valid-ip-addresses-from-a-string-22jtb7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-cost-to-split-2n-people-between-two-cities-dt0ig9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/design-a-url-shortening-service-lp72ed</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-all-combinations-of-n-numbers-summing-to-s-6549h5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rearrange-array-so-evens-are-at-even-indexes-and-odds-at-odd-7zgka7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/a-time-you-messed-up-and-how-you-handled-it-70jtja</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-inversions-in-an-array-y1fpbi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/a-time-you-implemented-something-challenging-9oaxqq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-substring-with-at-most-k-distinct-characters-6dkqua</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-substring-without-repeating-characters-92adn6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/a-time-you-went-above-and-beyond-8tr4bs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/a-time-you-missed-a-deadline-s2suqs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/a-time-you-transferred-your-responsibilities-z2wv8f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/a-time-you-didn-t-know-how-to-proceed-veb1m5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/a-time-you-received-critical-feedback-2b8z6s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/a-time-you-solved-a-complex-technical-issue-tb3mlo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/a-time-you-collaborated-closely-with-teammates-nmu19w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/how-you-handled-critical-feedback-from-a-senior-ijusw8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/a-time-your-suggestion-was-implemented-14f96m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/navigating-a-team-conflict-tsf55x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/something-you-are-particularly-proud-of-and-a-past-project-gk1tpw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/data-structure-with-constant-time-insert-delete-and-random-4qns2o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/minimum-steps-to-reach-1-4lmgky</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/pattern-searching-in-strings-st01kk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/running-median-of-a-stream-of-integers-g7pfuh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/text-justification-8uczqd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/skyline-style-problem-1iwwrd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/angle-between-clock-hands-9adviu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/shortest-path-with-alternating-edge-colors-harder-variant-cjq88s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/merge-sort-for-linked-list-e5ofv9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/longest-leaf-to-leaf-path-with-maximum-sum-through-root-eg7qep</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/implement-fibonacci-series-in-python-uv87se</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-the-most-profitable-start-and-end-date-for-a-trip-given-f6v9kw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/play-all-songs-randomly-in-n-iterations-with-o-n-time-umkz55</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/validate-xml-string-q2gi87</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/design-data-structure-supporting-insert-delete-search-and-a53qje</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/car-tracking-instruction-sequence-3frdr9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bfs-based-easy-questions-lohc5a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-minimum-way-to-get-target-price-from-a-set-of-values-i16afa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/movie-ticket-booking-data-modeling-and-basic-coding-a83rhn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/first-and-last-positions-in-sorted-array-va5drz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/print-prime-numbers-in-range-a7y23y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/most-negative-number-in-subarrays-8qm8pi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/longest-bitonic-subsequence-equal-parts-jag1ef</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/print-single-nested-valid-parentheses-substrings-dlea6b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/connected-components-in-a-graph-crg5pu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-steps-to-reach-boundary-edges-of-a-matrix-ly1uaa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/russian-doll-envelopes-99l3xq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/count-number-of-nice-subarrays-g91bad</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/find-max-consecutive-ones-q6xww1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/sum-of-same-consecutive-numbers-occurring-k-times-wd3nci</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/find-length-of-longest-word-and-print-matching-words-7tl7n5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/query-to-find-2nd-highest-salary-y2smyr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/count-segments-containing-index-with-specific-constraints-8l4qn2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/find-pairs-with-target-sum-eum2g5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/inverting-bits-to-maximize-ones-lbs99a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-prime-and-generate-primes-up-to-n-efficiently-wc6uar</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-a-string-without-stl-and-keeping-digit-positions-0bjks1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/write-and-explain-any-code-up6cor</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/sql-queries-and-database-connectivity-mp0366</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/ancestral-tree-sibling-and-lca-queries-0umjmg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/logger-logic-design-using-sliding-window-16hy3f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/explain-static-and-virtual-functions-tft6lj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/split-an-array-into-two-equal-sum-subarrays-bce1ej</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/create-bst-and-print-extreme-left-leaf-node-or-last-level-wzah0o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/array-insertion-and-shifting-8wecl0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/minimum-shelter-length-for-k-cars-t8ktub</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/delete-operation-for-two-strings-yhouw4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/first-non-repeatable-character-y3qxws</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/sum-of-factorial-series-3qrd47</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/sort-matrix-g8h1hf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/nth-prime-number-5o35ja</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/minimum-elements-for-array-lcm-i772ph</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/print-reverse-of-singly-linked-list-s84fzr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-two-differing-elements-in-two-arrays-2m0uok</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/string-similarity-check-vmpm0k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/mobile-charging-time-calculation-phf55r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/maximum-consecutive-toys-within-budget-qqsd1h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/linked-list-with-next-and-arbitrary-pointer-fksy5c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/edit-distance-with-insert-and-delete-only-k9qlgm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/shift-zeros-and-find-middle-of-linked-list-89j3xd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/queue-using-stacks-merge-arrays-and-pattern-z0qf71</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/level-order-traversal-of-bst-and-hashing-zv5fs9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/stock-buy-sell-1a3pi8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/count-strings-generated-by-replacing-placeholders-g3ec8f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/web-page-layout-implementation-6tx98q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/longest-palindromic-subsequence-length-from-string-2qpi0y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/paragraph-word-frequency-and-lexicographical-sorting-5rhrm7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/count-distinct-pairs-with-positive-sum-ka288b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/stripe/transaction-rule-parser-with-ai-assistant-hackerrank-0is3ge</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/longest-common-prefix-of-an-array-of-strings-3x5dz7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/valid-palindrome-ignoring-case-and-punctuation-gm6pod</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/stripe/payment-ledger-with-idempotent-writes-refunds-and-currency-90u1au</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/stripe/in-memory-rate-limiter-with-sliding-windows-and-distributed-i98x1u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/stripe/design-a-webhook-delivery-system-for-third-party-bpbcr5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/stripe/walk-through-a-payment-reconciliation-system-you-built-cjral5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/longest-chain-of-words-7rvg36</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/uber/delete-an-edge-to-minimize-subtree-sum-difference-wmo09s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/uber/rapid-fire-os-and-networking-fundamentals-u9mfnr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/uber/count-valid-parentheses-expressions-of-length-n-without-5tjtwp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/uber/count-permutations-that-produce-the-same-bst-t6gcpe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/uber/bookmyshow-seat-booking-concurrency-management-sxn7of</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/uber/design-patterns-and-database-normalization-vs-2bmy4q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/uber/resolve-a-team-conflict-over-choice-of-design-pattern-dnn2y1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/stone-crossing-jumps-sum-of-squared-jump-lengths-bcuhi6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/maximise-pawn-captures-on-a-chessboard-grid-k8jh5j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/inorder-traversal-code-and-rebuilding-a-bst-from-traversals-r6s800</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/second-rank-student-query-with-and-without-limit-offset-4exg3q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/convert-a-binary-tree-to-its-mirror-huc5jj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/length-of-the-longest-common-subsequence-pnqcp3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/sort-an-array-of-pairs-pkm5o5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/check-whether-a-string-is-an-interleaving-of-two-other-frths9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/remove-every-k-th-person-from-n-people-seated-in-a-circle-ii15ok</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/implement-matrix-multiplication-using-pointers-zxx53m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/stripe/parse-a-csv-string-and-answer-multiple-queries-6w1ypj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/print-the-greatest-number-from-a-given-string-c7k7a4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/write-a-sql-query-using-joins-on-a-given-database-6l6to4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/explain-approach-for-a-given-program-draw-its-flowchart-and-54hm0n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/string-partitioning-of-a-website-url-rwkwa0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/design-a-geolocation-system-rea0h6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/meta/design-a-turn-based-gaming-setup-6wk71y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/justify-choosing-the-mern-stack-and-javascript-on-the-jea16a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/explain-oop-concepts-with-a-practical-example-5at385</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/co-workers-falling-behind-on-a-team-project-52x9ac</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/print-all-combinations-of-a-given-length-from-given-ld9fsz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/os-basics-scheduling-memory-and-file-management-g2blk9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/inheritance-with-real-life-examples-and-exception-handling-s9jskm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/cpp-libraries-advantages-over-other-languages-stl-and-x5eccr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/dfs-vs-bfs-structure-complexities-and-why-binary-search-v56v2l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/store-a-very-long-character-sequence-with-constant-time-pl5ug2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/keep-student-names-sorted-by-marks-tjmsw9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/strengths-weaknesses-and-barclays-principles-57t7ym</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/advanced-java-oop-paradigms-and-exception-handling-14580a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/employee-with-minimum-salary-in-each-department-ig2cvr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/count-the-words-in-a-sentence-i47dq2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/how-would-you-live-the-barclays-rises-values-xsm2ee</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/implement-a-stack-and-a-queue-t1g53q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/oop-concepts-and-their-real-life-applications-d8mkw3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/frontend-backend-or-database-management-preference-12c1v7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-uni-valued-subtrees-in-a-binary-tree-8a5bec</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-nodes-at-distance-k-in-a-binary-tree-v01gp9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/design-a-cricket-scoreboard-system-using-os-dbms-and-15lr4c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/barclays-rises-values-and-stewardship-situations-18nkjq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/write-code-for-gcd-oqwr9u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/print-a-number-pattern-separated-by-asterisks-for-a-given-d55wb2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/write-code-for-the-fibonacci-series-x2c2ho</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/explain-object-oriented-programming-and-its-concepts-hashing-kl07ub</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/transpose-a-matrix-wktlu5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/design-a-tiktok-style-google-news-ajojd9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/prime-number-program-and-file-handling-in-python-nrfln3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sum-of-numbers-in-a-string-0oo25c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/print-numbers-1-100-based-on-divisibility-conditions-x2dkiz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/collecting-coins-aeivv5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/largest-dividing-k-1vm16n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/middle-of-the-linkedlist-ny7opx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/git-workflow-commands-qplw9o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-duplicate-element-in-array-h6ltdr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/create-a-stack-77xrqf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/binary-search-and-bst-tvc69a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/queues-and-heaps-35dn6s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/find-majority-element-without-extra-space-6js689</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/merge-element-frequencies-of-two-arrays-e29god</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/print-all-nodes-at-distance-d-from-a-given-node-6q7df7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/maximum-probability-path-across-river-stones-lzm79h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/two-sum-with-indices-dvzv3m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/validate-binary-search-tree-uh7681</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/nth-node-from-end-of-linked-list-zj8ish</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-two-binary-trees-are-mirrors-0traar</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-cycle-in-a-directed-graph-54cby7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/first-negative-integer-in-every-window-of-size-k-trnl1x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/submatrix-sum-queries-in-o-1-sf1ces</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/water-droplets-moving-in-a-pipe-8uwfa1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/first-non-repeating-character-from-a-stream-in-o-1-259fy8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-leaf-to-leaf-path-in-a-binary-tree-12ez0f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-the-linked-list-wb7de7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/determine-if-ingredients-can-be-prepared-doqc4z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/maximum-coin-collection-game-ltq88p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/print-each-word-in-reverse-order-7zptsw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/implement-hashmap-data-structure-v3nduk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/sort-a-string-using-anonymous-class-jt5u9a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/design-a-stack-that-returns-minimum-in-o-1-kmoe9s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-buggy-commit-using-version-control-v7ih6g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/maximum-water-that-can-be-stored-between-two-buildings-eexy32</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-largest-and-second-largest-elements-in-array-nase00</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/highest-absolute-sum-of-2-values-in-finite-array-5uyhnc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/set-102nd-bit-in-a-character-array-516bbm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/avl-tree-operations-and-balanced-bst-5pv75f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/hashing-techniques-and-cpp-stl-implementation-n5qa61</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/breadth-first-search-bfs-and-applications-52hbvy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/find-bugs-in-code-snippets-e7qpgk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/output-of-sizeof-strlen-and-dereference-statements-hdyv8v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-100-maximum-integers-from-1-billion-integers-nmr57q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-repeating-integer-in-array-with-o-1-memory-ta706t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-index-in-bitonic-array-nq0j9p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/median-of-two-sorted-arrays-09sr0m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-huge-text-file-based-on-a-column-under-memory-11xgh2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/minimum-projects-to-reduce-error-score-to-zero-lrq03l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/minimum-towers-to-cover-signal-bandwidth-3hbewu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/programming-basics-oops-and-pyramid-pattern-gdm33e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/java-loops-and-string-comparison-methods-ivlp1r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/find-pythagoras-triplets-from-an-array-09isbd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/sorting-algorithm-time-complexity-efficiency-zqa27w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/pseudocode-for-linked-list-node-insertion-e7emep</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/characteristics-of-a-bst-d3biz1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/compute-the-factorial-of-a-number-509jws</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/implement-linked-list-operations-2bpo6j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/remove-trailing-blank-spaces-from-string-u2gegr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/check-if-characters-in-a-linked-list-form-a-palindrome-qgt6yn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/merge-two-sorted-linked-lists-inplace-eq14bx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/find-the-kth-element-from-the-end-of-a-linked-list-in-one-2kuu7x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-first-non-repeating-character-in-a-string-md1jld</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-next-palindrome-larger-than-a-given-number-8xd7o0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rearrange-a-singly-linked-list-p5x3px</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-a-pair-with-a-given-sum-exists-in-an-array-qzk7xm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-paths-in-a-matrix-fz66fk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-two-missing-numbers-in-a-set-of-1000-1x2tub</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/swap-two-numbers-without-a-third-variable-0ogvqs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/sort-array-with-even-numbers-left-and-odd-numbers-right-7hupjz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/spell-checker-with-prefix-suggestions-qgxn43</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/check-if-string-contains-all-digits-avhae2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/smallest-number-with-digit-product-n-cv4e3i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/maximum-sum-of-all-triplets-score-om59yc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/maximum-number-of-cities-can-be-visited-20jzkv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/maximum-of-student-groups-can-satisfy-y9vu0r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/morse-code-word-combinations-38bvrf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/swap-bits-of-an-8-bit-number-8bp08q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/design-a-stack-supporting-getmin-in-o-1-time-and-o-1-space-fd7pbm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/design-an-array-class-and-solve-various-cpp-and-dsa-problems-2gvirn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/level-order-traversal-undirected-graph-traversal-and-array-8y3n8m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/constant-vector-dynamic-2d-array-power-of-2-and-kth-largest-wz8qdl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/implement-quick-sort-and-analyze-time-complexity-i3jiza</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/element-closest-to-zero-and-stack-based-array-problems-z4d1fz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/reverse-linked-list-fibonacci-quick-sort-dp-and-bfs-4ocen6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/match-goals-count-using-binary-search-i7gaxd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/matrix-traversal-and-prime-sum-es632x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-word-occurrences-in-matrix-ww68t0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/min-max-in-array-pair-sum-and-water-jug-puzzle-ol7f9m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/stolen-value-right-tree-view-and-sorted-matrix-y8shjq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/container-with-most-water-and-variable-access-restriction-097q20</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/coding-and-personality-assessment-kvb0nf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/valid-anagram-and-lru-cache-n0z21o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-error-in-c-program-and-bit-manipulation-gulj4d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/set-memory-location-reverse-words-and-quad-sum-afjo5k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/print-elements-with-odd-frequencies-from-a-constant-array-uy8oub</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/partition-array-for-maximum-alternating-sum-and-max-prime-gkgym6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/binary-search-and-tough-graph-with-dp-problem-ei9qoc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/element-presence-check-in-two-arrays-ae1hdy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/palindromes-from-a-string-72p5jo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/maximum-path-sum-in-a-matrix-yb1dhe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/count-integers-with-odd-factors-cjykr9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/two-sum-key-pair-usp37o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/count-valid-triangles-krd1ii</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/most-frequent-character-via-linked-list-ge7ycg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/online-assessment-with-mcqs-basic-sql-and-coding-8i1ij8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/scenario-coding-3-table-sql-join-and-oop-questions-g4z69s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/red-black-trees-tree-traversal-and-selection-sort-complexity-m1j5u8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/number-of-coins-merge-arrays-and-expression-trees-p4m8m2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/find-sum-of-numbers-in-an-array-at-prime-indexes-d3lsam</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/minimum-replacements-to-make-binary-string-alternating-xjjz34</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/graph-traversal-using-bfs-zx92vt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/replace-characters-in-string-using-dictionary-mapping-qmojc0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/arrange-array-of-string-numbers-to-form-the-largest-value-v5dvkb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/find-second-highest-salary-of-an-employee-4oeaic</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/find-path-of-exact-length-k-in-dag-2nx6y8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/difference-between-assignment-and-equality-operators-j82akk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/write-code-to-check-for-a-prime-number-l3rx9k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/explain-oop-concepts-inheritance-and-polymorphism-xtdni4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/compare-arrays-vs-linked-lists-and-stacks-vs-queues-534dr2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/file-explorer-component-irwgv6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/leetcode-easy-problem-azp70v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/interactive-box-and-circle-ea2iyt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/find-missing-numbers-from-1-to-n-7nbd5m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/find-non-repeating-element-9qoecr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/check-for-integer-overflow-qvwk16</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/find-pair-with-given-sum-s6d3op</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/swap-even-and-odd-bits-t60s4r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-trailing-zeros-in-n-factorial-ivx7sk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/compute-cukoo-sequence-for-large-input-9bc35k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/check-if-one-binary-tree-is-a-subtree-of-another-87x815</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/print-consecutive-numbers-using-odd-and-even-functions-s2ga8b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/implement-c-library-functions-strcpy-and-strcmp-oj3hti</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-cycle-in-a-graph-using-dfs-ntw1or</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/check-single-path-in-a-maze-grid-kbp3b0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-smallest-number-formed-by-inserting-a-given-digit-il8tui</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/count-pairs-from-two-sorted-matrices-with-given-sum-e8frun</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/check-if-a-given-binary-tree-is-a-sumtree-il7gx4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/length-of-longest-substring-without-repeating-characters-shso6r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/minimum-maximum-values-expression-and-longest-subsequence-m579fn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/design-data-structure-based-on-conditions-and-bit-6f5v6b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/list-all-common-subsequences-of-two-lines-in-lexicographic-e9lh0p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/modified-two-sum-in-o-logn-time-and-string-manipulation-7kaf7n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/bursting-balloons-problem-1sw43z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/find-the-largest-palindrome-in-a-given-string-0k3e65</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/find-middle-element-of-linked-list-in-single-pass-0ex72q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/find-missing-and-repeated-numbers-in-an-array-ay73vm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/solve-a-sudoku-puzzle-using-an-algorithm-d0b1hi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/swap-two-values-without-third-variable-dvong1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/select-maximum-date-from-a-table-yu5b53</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/find-maximum-integer-i-satisfying-equation-with-log-and-sqrt-veje3p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/ending-indices-of-substrings-of-b-that-are-prefix-of-a-2svbm5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/number-of-pairs-with-gcd-1-9813qr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/find-element-where-left-elements-are-smaller-and-right-are-5ic9qf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/traverse-3x3-dot-matrix-with-4-lines-nli81t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/minimum-knight-moves-to-reach-target-square-ae47nw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/find-size-of-largest-island-in-binary-matrix-idlvq5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/keep-track-of-minimum-element-in-a-stack-t1jmxl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/maximum-length-by-combining-strings-wz5z2v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/maximum-occurring-digit-in-a-range-of-prime-numbers-p1wy3d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/minimum-steps-to-get-desired-array-opsv4y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sliding-window-maximum-p0ybst</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-single-element-in-sorted-array-6thqr2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/find-nth-highest-salary-department-wise-19ueiq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/wrap-numbers-in-quotes-for-rest-service-4dv8g4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/check-if-vowels-in-a-string-are-in-alphabetical-order-k9rbgm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/count-character-occurrences-2olbfn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/count-total-number-of-ones-in-a-number-ku2rrh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/longest-increasing-subsequence-lis-ms8p5m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/transpose-the-matrix-s1o27k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/string-character-transformation-r00qa0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/prime-number-program-reb5s3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/factorial-with-recursion-p95oyj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/print-matrix-in-spiral-form-starting-from-a-given-point-p-b135ld</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/smallest-number-after-removing-k-characters-e8s7y7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/convert-matrix-into-a-linked-list-matrix-m23ys0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/compress-string-by-consecutive-element-counts-z8nz58</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/check-if-binary-tree-is-a-perfect-binary-tree-k4lhv1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-two-numbers-appearing-only-once-in-an-array-b329z9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/sorting-technique-for-an-almost-sorted-array-8ld8a8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/print-sorted-matrix-elements-in-sorted-order-smz7yg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/lowest-common-ancestor-in-an-n-ary-tree-gkig1o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/maximum-perimeter-sum-of-rectangles-from-sticks-wlw0z7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-closest-number-difference-from-array-yuh60i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/delete-all-nodes-equal-to-k-in-a-linked-list-0vnhye</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/find-missing-element-in-a-sequence-w6fasz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/find-second-largest-element-in-a-list-44h8uh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/check-if-a-number-is-prime-or-not-s7vluq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/warehouse-item-shipment-optimization-l1ufhs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/binary-palindrome-check-9nny32</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/format-even-length-words-1rcbyr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-k-pairs-with-smallest-sums-gi4a2t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/4sum-problem-3gdk7f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/minimum-operations-to-transform-string-pqyud8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/copy-a-binary-tree-92duop</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/rotate-a-linked-list-t9ohg4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/two-sum-zero-a21m29</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/prime-factorization-2g2c81</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/celebrity-problem-841yse</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/unique-character-substrings-p9lcc5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-a-peak-element-qra05z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/top-view-of-binary-tree-dsq5nx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-difference-between-node-and-ancestor-oh5hix</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-pairs-with-equal-sums-d8aqc2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lowest-common-ancestor-m92l2o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/clone-binary-tree-with-random-pointers-k46doi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-triangle-path-sum-6wejuw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/move-zeroes-to-end-y1yxu5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/smallest-subarray-with-k-distinct-numbers-xi6087</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/largest-subgrid-with-conditions-o6ut6w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/dsa-basics-arrays-and-linked-lists-od64iz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/calculate-the-squares-in-n-n-chessboard-ubl4hj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/combine-the-anagram-27e2s8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-the-height-and-diameter-of-the-tree-5wmaci</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/largest-sum-path-in-the-tree-blj3or</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/reverse-linked-list-yromy7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/add-2-numbers-represented-by-linked-lists-he69jm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/flood-fill-algorithm-and-x-o-flip-q5556i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/stack-as-queue-and-vice-versa-fhx677</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/sort-array-contains-only-elements-0-1-and-2-ytk7t2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/midpoint-of-linked-list-5t4yyy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/delete-a-node-in-the-linked-list-without-head-node-er1yuy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/kth-largest-element-using-the-heap-5nqxdw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/longest-subarray-with-absolute-difference-of-adjacent-c7ey3c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/uncommon-words-from-sentences-with-custom-delimiters-rj6l0p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-bridges-in-a-graph-y5b7tt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maximum-sum-with-no-adjacent-elements-selected-r8mefi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-overlapping-interval-with-least-difference-o642pi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/pseudo-code-for-4-queen-problem-nq3qbo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/implement-all-tree-traversals-kyq8su</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-a-big-file-that-doesn-t-fit-in-memory-tlkio3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-if-linked-list-is-a-palindrome-1o0ycq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/explain-and-write-working-merge-sort-3e7cv6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-5-coordinates-forming-a-polygon-from-n-coordinates-7zskv8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/design-3-stacks-in-a-single-array-without-overflow-ok0wff</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-palindromic-substrings-owby1j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/merge-sort-implementation-and-time-complexity-9wupte</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/find-student-with-maximum-marks-0oc56g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/factorial-of-negative-number-yhrc75</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/merge-point-of-merged-linked-lists-ow0hh5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-second-maximum-element-in-o-n-136ogg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/concatenate-n-strings-based-on-character-matching-zmrq0l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/string-compression-without-extra-space-mbsqu0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/eliminate-consecutive-duplicate-characters-isf1po</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/largest-palindrome-using-delete-and-swap-operations-iuw9l6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/fibonacci-with-recursion-and-time-complexity-u0ckag</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/find-a-number-in-a-sorted-array-of-unknown-size-owr3s0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/mastercard/modified-job-scheduling-9jndr8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/toggle-only-second-bit-of-an-8-bit-char-ow3u3e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/evaluate-string-expression-using-bodmas-k6jbyr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/tree-height-and-diameter-n56hcd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/count-most-frequent-element-in-array-o6m7jl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/why-java-is-platform-independent-hkkif0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/difference-between-final-and-finally-keyword-lu5eep</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/pillars-of-oops-u0cfq8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/convert-a-list-of-characters-into-a-string-4y231p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/what-are-threads-in-java-1hbd8a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/explain-quick-sort-algorithm-bmysu9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/difference-between-abstract-class-and-interface-ey8pwu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/find-a-given-key-in-a-list-of-numbers-jsbj6a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/meaning-of-public-static-void-main-string-args-87m29y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/internal-working-of-arraylist-q9gsag</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/meaning-of-the-static-keyword-in-java-nfxvy7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/find-the-max-frequency-of-an-element-in-an-array-mdi45b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/diamond-problem-in-java-av7ui6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/largest-squared-length-in-grid-containing-same-characters-cauh5b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-pair-sum-and-rearrange-array-elements-fcg4e4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/power-function-matrix-path-cost-bst-check-and-array-shuffle-sf7fos</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/bmi-calculator-p6f4l0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-first-and-last-position-of-element-in-sorted-array-8tuqbv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/increasing-triplet-subsequence-q7w8y4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/subarrays-with-sum-equal-to-k-50ix3a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/zig-zag-array-conversion-g4ozbz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/linked-list-vs-array-7lqxk6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/factorial-calculation-vpij7m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/reverse-a-string-in-place-jnix73</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/reverse-every-n-elements-in-a-queue-3cbpo7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/boundary-traversal-of-a-tree-3z878a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/pattern-matching-in-o-m-n-ii5mz1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/excel-sheet-column-name-from-number-84rhn1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/update-subarray-value-and-find-maximum-frequency-n0tbex</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/minimum-cost-to-make-two-strings-identical-b101hk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/check-for-balanced-binary-tree-pn4ngg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/maximum-profit-from-buying-and-selling-mangoes-di444o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/maximum-subarray-sum-problem-0q9q1b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/find-word-in-2d-character-array-0mplco</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/check-if-strings-are-rotations-of-each-other-qh97of</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/find-missing-number-in-consecutive-numbers-vsv821</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/minimize-penalty-on-an-inverted-apple-tree-by-watering-one-j72sq3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/minimum-number-of-platforms-required-for-railway-bus-station-kk2dbj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/root-to-leaf-path-sum-equal-to-a-given-number-huuj66</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/maximum-length-chain-of-pairs-ait35c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/deep-copy-of-a-linked-list-g0uu5y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/balanced-parenthesis-with-special-characters-tq8xsd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/swap-two-numbers-without-using-another-variable-i6wt84</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/implement-any-sorting-algorithm-ti2ee2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-minimum-possible-number-by-rearranging-digits-vy8k0m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-frequency-of-array-elements-in-o-n-time-and-o-1-space-bld56g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/time-complexity-comparison-of-different-search-algorithms-vv5h2o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/implementation-of-queues-using-linked-list-xvqn1r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/difference-between-single-linked-list-and-double-linked-list-hu85bz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/determine-if-linkedlist-a-is-reverse-of-linkedlist-b-6ku6vd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/write-complex-sql-queries-and-deduplicate-dataframe-4s8b16</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/assert-keyword-in-c-cpp-9qj91z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/elevator-round-trip-stop-order-w4i9n6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/delete-leaf-nodes-of-a-binary-tree-epbg81</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-loop-in-singly-linked-list-k5opwh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/extract-and-sum-numbers-from-string-fadx8k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/replace-each-number-with-next-greater-on-right-mjv6vz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/biggest-island-in-2d-matrix-re3qd6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/print-singly-linked-list-from-start-and-end-alternatingly-1s9qew</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/rod-cutting-problem-for-maximum-profit-qcfim1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/left-view-of-binary-tree-with-and-without-queue-px01by</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/count-occurrences-of-x-in-sorted-array-zih2fr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/investment-profit-maximization-11qups</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/minimum-word-transformations-af76sv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/max-number-with-k-adjacent-swaps-w9oh1q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/check-if-string-is-repeating-pattern-go4zf9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/nth-element-from-last-in-one-iteration-8lnfmu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/delete-node-from-singly-linked-list-without-head-node-nf85or</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/get-intersection-from-two-arrays-is5nic</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/least-positive-integer-multiple-made-of-9s-and-0s-g3rb6m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/find-actual-length-of-string-with-trailing-length-value-5n54it</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/check-palindrome-using-recursion-only-gk9y9s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/print-words-in-decreasing-order-of-frequency-from-paragraph-cuagr2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/return-all-palindromic-substrings-oqj2eu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/multiply-two-integers-as-strings-ert8t9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/coordinate-mapping-ebav05</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/range-maximum-query-4kct8f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/thief-sensor-avoidance-25rral</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/max-distance-seating-f8axuh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/binary-string-split-9nbql7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/check-if-numbers-at-even-indices-are-even-n2t4e2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/tomohiko-sakamoto-s-algorithm-ep0pzw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/regex-and-anagrams-82jt6i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/sql-joins-ghtj4w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/next-even-number-zsh1gh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/number-representation-m85h1j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/matrix-rotation-hy6fa7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/smallest-subarray-with-sum-greater-than-x-bnys9r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/minimum-number-of-platforms-required-for-trains-0pv8rz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/top-2-words-with-only-alphabetic-characters-b8afcm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-element-repeating-exactly-once-with-unrestricted-4pfz7a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/minimum-operations-to-convert-a-permutation-into-an-identity-8993pg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/convert-an-array-into-a-zig-zag-fashion-w5aiu0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/circle-of-strings-50ikcu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-percentage-difference-between-4-month-and-6-month-bne09y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/capitalize-first-letter-of-each-word-in-text-dataset-jfbhq6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-optimal-time-to-buy-and-sell-in-a-dynamic-price-market-3ey767</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-number-of-non-trailing-zeroes-in-binary-form-of-decimal-tsmg6r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/rotate-a-number-matrix-by-90-180-270-degrees-en3f6v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-leader-numbers-in-an-array-in-o-n-time-8xaa63</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/find-the-second-highest-salary-from-an-employee-table-f23p03</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/implement-a-stack-using-an-array-q8fp97</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/which-sorting-algorithm-to-use-for-a-billion-numbers-pd3mus</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/count-minimum-steps-to-get-given-desired-array-qtiiz2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/maximum-index-difference-j-i-such-that-arr-j-arr-i-g3ofng</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/convert-24-hour-time-to-12-hour-time-format-3qnbde</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/extract-years-from-given-text-h3z8va</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/hospital-medicine-box-pick-game-u341tm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/minimum-cost-candy-shop-visiting-with-skips-0kkub5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/generate-and-filter-random-numbers-with-user-prompts-einrg2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/memory-copy-implementation-rch5v9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/distinct-pairs-with-sum-divisible-by-m-82l0yb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/largest-index-difference-in-strictly-decreasing-subsequences-yrii9s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/identify-people-leaving-a-party-4z7ad7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/string-permutations-kkiom4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/connect-nodes-in-zig-zag-pattern-n57w71</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-in-array-with-pattern-constraint-twr90j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/mirror-placement-in-grid-cwdjh0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/regex-matching-5ooef4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/split-the-array-into-good-sub-arrays-based-on-gcd-4ta2eq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/final-discount-price-9sxp65</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/circular-trail-most-visited-spot-edqo01</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/mystery-value-from-sequence-operations-8p3xqz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/even-odd-series-string-arrangement-ki28js</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/arrange-tanks-to-maximize-distinct-subarrays-5pbco5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/find-minimum-number-of-missing-jewels-4b12c2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/count-k-where-first-k-bulbs-are-on-and-last-n-k-off-r0ekgh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/product-of-all-elements-except-self-nsd75a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/multiply-by-7-ug6uvt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/alternating-binary-string-vrxua7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/character-replacement-via-dictionary-f1be9e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/left-view-of-a-binary-tree-c9jcem</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/implement-binary-search-tree-4odwvd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/implement-optimized-bubble-sort-52uqm3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/check-if-string-can-become-palindrome-with-one-swap-hnx0d1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/calculate-number-of-days-between-two-dates-l17cv4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/iterative-and-recursive-pre-order-traversal-vmx3ec</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/filter-tree-nodes-within-a-specific-range-a453cy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/fixed-length-sliding-window-problem-35likq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/sum-of-squares-of-diagonal-elements-lyck1v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/circular-list-operations-l9e6dh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/check-if-character-array-is-a-palindrome-j4e4dj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sort-a-doubly-linked-list-2xlbv5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/mail-rooms-for-office-buildings-b930of</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/level-order-and-zig-zag-traversal-m1k5s5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/sum-of-two-numbers-with-maximum-product-and-next-permutation-zvwi0o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-second-maximum-integer-in-an-array-j2k9w3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-the-n-th-number-in-a-mixed-power-series-lsmx9g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/reverse-a-string-without-built-in-functions-in-c-and-java-4054ss</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/calculate-a-b-mod-c-using-log-n-approach-cdby6k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/count-capital-small-letters-and-numbers-in-a-sentence-mp3gfm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/activity-scheduling-problem-dn5zp8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/sort-a-linked-list-of-0s-1s-and-2s-t7twfm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/maximum-profit-from-multiple-stock-buy-and-sell-transactions-6517dz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/standard-bfs-for-graph-traversal-yostp3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-valid-dictionary-words-in-a-character-matrix-29b9bq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/generate-all-binary-strings-by-replacing-question-marks-kccox5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/count-valid-parenthesis-strings-meeting-a-sum-condition-0unpl7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/write-pseudo-codes-for-insertion-merge-and-bubble-sort-pmr6mh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/frog-river-crossing-path-printing-hj3k1n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/balanced-parentheses-and-in-place-list-intersection-he4n8j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/spiral-level-order-traversal-and-lowest-common-ancestor-in-lxgpp9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/determine-element-rank-from-two-arrays-and-connect-same-n61hza</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/y-linked-list-intersection-character-frequency-and-duplicate-di3ddh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/evaluate-algebraic-expression-with-character-counts-and-8xglq2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/remove-duplicates-from-sorted-unsorted-arrays-and-count-jeme6a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/mirror-characters-of-a-string-n0w0ba</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/rearrange-positive-and-negative-numbers-inline-8i3vwb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/dijkstra-prims-and-dynamic-programming-o1i2ny</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/merging-overlapping-intervals-ae9yrm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/merging-intervals-5od5ho</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/level-order-tree-traversal-vs0ok1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/array-difference-reduction-t6syhd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/count-perfect-squares-cca42c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/valid-path-pairs-in-a-tree-hfl9sr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-all-subarrays-with-sum-equal-to-k-a30epb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/linked-list-loop-operations-race-condition-and-endianness-2mi50x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/swap-msb-and-lsb-of-an-integer-sjdq9j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-paths-in-chess-matrix-ms43qu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/combination-sum-to-highest-odd-number-6nuixp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/prevent-fights-at-wedding-by-inviting-guests-d00bk0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/print-all-integers-from-a-string-w85oly</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/python-data-types-factorial-leap-year-and-sql-queries-1pl42r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/perform-exploratory-data-analysis-live-on-dataset-w67wd4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/sql-query-to-join-tables-and-filter-6av2lx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/maximize-greatness-of-an-array-3azgs3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/recurrence-relation-using-bitwise-operators-pzt1w8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/find-the-maximum-repeating-character-in-a-string-d2kznr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/find-integral-pairs-for-equation-with-factorials-66qdmc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/count-subarrays-where-given-number-is-the-maximum-z8t5c2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/minimum-jumps-to-reach-end-of-array-8ehoqk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/maximum-sum-of-movie-ratings-with-k-flips-5sxg32</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/search-in-a-sorted-rotated-array-oq5d9p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/duplicate-a-linked-list-with-random-pointers-h0hdkq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/maximum-currency-exchange-rate-tuky6n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/easy-coding-and-dp-problem-zerhd5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-common-subsequence-and-traversal-xc0x0x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/connect-binary-tree-level-nodes-and-find-mayor-candidate-g76f09</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-alternate-quarters-of-linked-list-gqn9ly</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/spiral-traversal-and-anagram-search-data-structure-f1h24c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/reach-queen-location-in-2d-matrix-9ng566</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/minimum-points-for-boundary-enclosing-all-points-s5jqh5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/reverse-string-using-queue-y0ek65</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/remove-duplicates-from-array-except-first-occurrence-ttt0il</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/logical-implementation-of-splitwise-9639n1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/count-maxima-cells-in-a-2d-grid-alakg7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/print-number-rhombus-pattern-mhyvn1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/folding-a-linked-list-reorder-list-a0qyoj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/design-data-structure-for-o-1-index-search-and-o-n-traversal-20zjy3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/find-factorial-iteratively-and-recursively-9r1r8b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/check-if-sentence-contains-all-english-alphabets-2bkp8m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/parenthesis-matching-y82f3o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/row-with-maximum-0s-in-a-matrix-g7krh5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/multiply-two-numbers-without-using-operator-gh9bwi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/check-if-number-is-palindrome-du0z5x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/check-if-given-sum-is-available-in-array-w8adsg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/construct-tree-from-inorder-and-postorder-traversal-zw1vas</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-longest-distance-between-two-nodes-in-a-tree-1232iw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-right-view-of-a-binary-tree-3vi7cr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/design-a-stack-with-push-pop-and-min-in-o-1-k5zhrp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/merge-k-sorted-arrays-of-size-n-hbrl4d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/code-a-math-function-using-binary-search-or-newton-s-method-flocv5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/stream-based-coding-question-99zmq5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/print-string-characters-in-a-specific-diagonal-zigzag-y09qyz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/subarray-with-largest-sum-using-window-size-of-four-ire9qg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-missing-character-or-number-in-a-linked-list-w48rhu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/customer-account-details-using-classes-with-restricted-56d8tm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/in-place-deletion-of-an-element-from-an-array-h546cz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/demonstrate-function-overloading-and-overriding-in-cpp-ia78p8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/calculate-number-of-notes-from-an-atm-machine-17pn52</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sql-queries-for-student-filtering-and-sorting-y40muj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-odd-and-even-numbers-and-swap-numbers-c23wj7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-array-length-manually-without-using-functions-3ngqh5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-whether-a-number-is-in-the-fibonacci-series-cm4niv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/common-prefix-after-character-removal-zup763</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/stone-breaking-problem-525o86</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/html-tag-matching-l5m1a1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/find-number-in-infinite-sorted-array-dv71mp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/shortest-direction-moves-4qmt7h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/decode-encrypted-binary-string-ekobz2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/count-ways-to-reach-nth-stair-using-1-or-2-steps-nvj86c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/number-of-palindromes-in-range-4eo2lh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/check-valid-c-variable-l4vpyp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/delete-a-node-in-bst-b7ynnt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/level-order-traversal-without-recursion-ag3cy3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/find-kth-maximum-element-in-an-array-bfe1au</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/elements-occurring-odd-number-of-times-l3yi9f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/delete-nodes-occurring-more-than-twice-5pomn3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/find-last-occurrence-of-pattern-in-string-ltrq31</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/find-set-bits-using-recursion-sp0tiy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-left-view-of-a-binary-tree-4fhwf2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-sum-of-n-elements-after-kth-smallest-element-in-bst-9bd48l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-rotation-count-of-sorted-rotated-array-1wqp4w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-ways-to-reach-nth-stair-65i5u9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-all-non-repeating-words-out-of-two-given-sentences-0eddva</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-pair-with-target-sum-in-sorted-array-n63ene</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-second-highest-element-in-bst-cz2d79</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-k-smallest-elements-in-unsorted-array-i72r8x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/aptitude-cs-fundamentals-and-2-coding-questions-6m7q60</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/stack-designer-and-pow-x-n-uo6l0v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/minimum-steps-in-maze-with-zeroes-dv72iy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/count-non-repetitive-palindromic-substrings-fjaa8l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/word-ladder-sort-stack-segment-tree-u2nw0h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/spiral-matrix-unique-encoding-decoding-word-search-in-2d-ejo2wd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/print-a-triangle-of-pattern-z8jg6y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/build-equations-from-statement-z5sor1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/queue-using-stacks-min-stack-buy-sell-stock-and-balanced-bst-wy7g40</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/multithreading-and-deadlock-detection-enw0cp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/hashset-implementation-java-streams-and-hashcode-equals-p9ecjy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/convert-linked-list-to-circular-q94zo8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/k-closest-elements-zero-sum-subarrays-and-longest-common-rig24k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/prisoner-escape-jumps-coc799</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/smallest-substring-containing-characters-t2xc0t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/mouse-in-a-maze-6icjqd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/reverse-string-preserving-special-characters-9p57mu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/find-3-4th-node-in-a-linked-list-8a0oxf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/cuda-array-reduction-vrn6oc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/reverse-an-array-mdxrd6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/binary-search-tree-from-array-zb7wu1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/print-numeric-pyramid-pattern-in-java-yz4yjg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/find-sine-wave-shaped-1s-in-a-matrix-i807ee</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/difference-between-callable-and-future-run-and-call-z793ky</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/check-if-an-array-represents-a-heap-jsu2hd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/recursive-function-to-print-1-to-100-b2k50s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/chess-pawn-moves-70od73</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/tree-data-structure-question-4qbjd5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/resolve-compile-dependencies-z4fye6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-overlapping-rectangles-pxo328</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/wildcard-character-matching-ja94fe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-if-given-number-is-a-lucky-number-xpb0ot</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/find-pairs-in-an-array-with-sum-k-5bzmhi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/check-if-array-a-is-a-subset-of-array-b-9gqo0i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/insert-element-and-delete-greater-elements-pg48v9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/sum-of-root-to-leaf-numbers-12fk36</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/minimum-steps-to-reach-level-n-vjo7pl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/minimum-moves-in-2d-matrix-bj61h2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/duplicate-a-stack-048qbb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/minimum-swaps-for-valid-parenthesis-qaq4l3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/equalize-balls-in-buckets-b3876y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/sort-linked-list-by-absolute-values-5eq6k0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/sql-query-for-movie-venues-k5eoun</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/detect-loop-in-array-representation-647rzn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/max-sum-subarray-xg9wp0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/max-sum-path-in-a-triangle-8vznat</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/minimum-length-substring-containing-all-unique-characters-5wf52b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/minimum-contiguous-substring-where-t-is-a-subsequence-eh6402</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-all-root-to-leaf-paths-in-a-binary-tree-662xb4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/delete-duplicate-folders-in-a-system-g8f3xb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/minimum-sum-partition-mhivc7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/print-all-prime-numbers-up-to-a-given-number-epi8iz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/check-if-two-strings-are-misarranged-versions-of-each-other-8i8upl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/check-if-a-number-is-the-power-of-2-szxx66</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/write-a-simple-recursive-program-and-evaluate-complexity-93ipkh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/implement-stack-using-linked-list-1ok4c1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/pick-unique-random-numbers-from-an-array-without-built-ins-6fnubs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/read-file-and-print-based-on-divisibility-s95y66</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/travelling-salesman-problem-5ceim9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/construct-binary-tree-from-postorder-and-leaf-node-status-q6h9io</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-132-pattern-subsequences-in-array-udpfd2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-next-highest-permutation-string-detb3r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/smallest-substring-containing-all-characters-w9jn3j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/stock-and-span-variation-for-maximum-profit-av946p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/implement-notepad-find-and-replace-algorithm-bduu4j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/minimum-operations-for-beautiful-matrix-530wu7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/evaluate-fibonacci-sequence-and-memoization-5ovqfq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/find-middle-of-linked-list-jxfj3e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/print-array-in-waveform-cp8s86</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/minimum-deletions-to-make-string-palindrome-0lnow8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/reverse-a-linked-list-recursively-u3kjde</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/find-the-height-of-a-binary-tree-0kelwe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/read-write-binary-tree-to-file-q1jmvn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/print-a-number-without-printf-kpu54d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/expression-tree-evaluation-pbnm4g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/find-row-with-max-1s-in-2d-array-i1qe6u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/knight-s-possible-moves-pv1lnp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/create-bst-from-unsorted-array-xtbc5r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/copy-a-linked-list-vyj811</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/sort-array-of-0s-and-1s-ow2xee</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/bfs-of-a-graph-0llj7z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/two-sum-in-sorted-array-3d2xvz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/count-substrings-starting-with-a-and-ending-with-b-da4u8m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/copy-bits-between-integers-54eqnl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/design-stack-with-o-1-max-d23xu0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/basic-c-language-mcqs-m5e5zl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/calculate-hypotenuse-using-command-line-arguments-b2pcc3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/static-variables-and-pre-processor-directives-0lzqsj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/oops-concepts-and-polymorphism-8r1yju</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/count-consonants-vowels-and-special-characters-mi3hou</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/modify-2d-matrix-in-place-based-on-1-elements-3jwftm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/find-nth-term-of-fibonacci-series-and-math-questions-om0i0t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/maximum-rectangular-area-in-a-histogram-7vekd8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/partition-a-web-page-into-four-parts-using-html-v06q00</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/binary-tree-traversals-and-bst-operations-7jky6e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/ascii-character-manipulation-and-pattern-printing-aehkr7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/task-scheduler-queue-implementation-211xis</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/longest-subarray-with-sum-divisible-by-k-qmchy9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-element-with-highest-frequency-in-an-array-uf3inz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/delete-a-node-from-the-end-of-a-linked-list-usp5a0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/quick-sort-algorithm-and-complexity-e2frgb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/rotate-matrix-by-90-degrees-2h95be</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/check-if-a-singly-linked-list-is-a-palindrome-5t0v22</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/what-are-stacks-and-queues-58tadj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/binary-tree-anticlockwise-traversal-and-bst-deletion-i18a55</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/minimum-perfect-squares-sum-sql-salary-query-and-loop-vivq3v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/maximum-sum-path-in-two-arrays-hfk8r1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/search-an-element-in-a-sorted-and-rotated-array-mtiwl3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/minimum-platforms-x1k0ne</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/check-if-a-pair-exists-with-a-given-sum-in-given-array-l7b3ec</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/excel-column-title-from-column-number-5e38xj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sql-query-for-absent-students-aggregated-by-month-zmfoj5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/digit-sum-operation-on-string-ap5xjh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/all-possible-fake-palindrome-sub-strings-57qgtz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/print-middle-node-of-a-linked-list-92xpf0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/remove-duplicates-from-unsorted-linked-list-54rg99</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/sequence-of-operations-to-reach-a-number-nxg406</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/maximum-sum-path-in-a-tree-efpck8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/longest-subarray-of-0s-or-1s-5tfaqc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/delete-element-from-circular-linked-list-qe3nqv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/palindrome-sum-generation-p0tqlw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/minimum-coins-for-sum-6srhu7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/find-the-nth-prime-number-0dchz0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/teradata/factorial-implementation-6xwh6x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/maximum-amongst-minimum-in-sub-arrays-8wfqt4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/minimum-number-of-fountains-to-activate-t9ps1a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/find-corresponding-y-for-x-from-points-kwyak3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/count-words-in-a-given-string-4xzf1s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/minimum-increment-operations-to-make-array-equal-sf7w69</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/n-queen-problem-wdxl7w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/find-substring-in-big-string-efficiently-t7zqnb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/find-in-order-successor-in-a-binary-search-tree-ml7a92</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/print-all-combinations-of-balanced-parenthesis-j0pys7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/determine-if-array-elements-are-prime-uc9030</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/print-n-fibonacci-numbers-1nr3c5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/lexicographically-smallest-string-and-max-transactions-om6nrs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/reverse-linked-list-iteratively-and-recursively-e30uq0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/compare-sorting-algorithms-and-code-merge-sort-gm2s1h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/find-the-maximum-sweetness-of-the-least-sweet-chocolate-ot8akp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/count-integers-from-1-to-n-with-odd-number-of-factors-atdvf0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/garbage-collector-and-delete-keyword-l7fv52</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/maximum-area-of-rectangle-in-histogram-gr473w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/number-of-dice-rolls-with-target-sum-rlpm9f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-the-duplicate-number-w3e17l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/max-sum-path-in-two-intersecting-linked-lists-445k2u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/special-character-parity-string-arrangement-jawi2h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/find-special-substrings-t7icof</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/bursting-balloons-gxjy50</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/display-and-manipulate-linked-list-r8knob</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/reverse-string-and-words-l7rr2y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/get-minimum-element-in-stack-v98gzr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/triangle-path-counting-e17od4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/trie-search-implementation-zwyj8y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/intersection-of-linked-lists-q8wn9z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/nodes-at-kth-depth-v2weti</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/construct-bst-from-traversals-7qxq2q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/merge-sort-algorithm-tdr99c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/reverse-array-and-count-unchanged-position-characters-506zui</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/case-insensitive-pattern-matching-585dqz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/move-all-zeroes-to-the-end-of-the-array-in-place-nbe23b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/number-of-islands-jwzl6x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-pairs-with-given-sum-y1jjnl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/merge-two-sorted-linked-lists-5nknty</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/check-if-binary-number-is-divisible-by-5-without-conversion-qhr6zt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/sort-an-array-of-0-s-and-1-s-zzmm1e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/min-stack-in-o-1-time-9lrn8e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/level-order-traversal-q9qdol</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/check-if-string-is-rotated-by-two-places-ficd8h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/blackrock/bitonic-point-dzx1gn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/find-index-of-max-occurring-element-c0nxna</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/vertical-order-traversal-of-n-ary-tree-1i81p4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/candies-distribution-and-check-if-binary-tree-is-a-subtree-lg0pvv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/maximum-product-subarray-and-bottom-view-of-binary-tree-0ofn1p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/sort-array-with-k-unique-numbers-and-sort-array-of-1-2-3-5ytdg9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-the-most-expensive-hotel-in-each-city-based-on-monthly-6ukcl3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/file-compilation-order-via-topological-sort-ewmrl3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/cutting-a-rod-t24b2p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/explain-heaps-and-write-heapify-ds0g7o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/swap-two-incorrect-nodes-in-bst-8xxo55</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/sort-a-very-big-text-file-with-limited-memory-33rov5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/shortest-path-in-graph-with-multiple-edges-rq5uzx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/maximize-amount-from-removing-pr-or-rp-substrings-u0yz12</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/minimum-elements-to-add-to-array-b-to-make-a-a-subsequence-2fbf0b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/maximum-size-rectangle-binary-sub-matrix-of-1s-1f75qo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/print-nodes-in-top-view-of-a-tree-pqom51</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-next-greater-number-using-same-set-of-digits-ptr80r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/minimum-number-of-platforms-required-for-railway-station-m7sy03</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/search-array-where-adjacent-elements-differ-by-k-pak596</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/circular-linked-list-t7k1sy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/height-of-binary-tree-oai7cc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/reverse-a-string-using-stack-54zuzq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/find-duplicate-elements-in-an-array-33zab8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/find-missing-number-in-an-array-au2ult</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/restful-services-race-conditions-and-java-fundamentals-m11535</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/array-segregation-merging-probability-and-puzzle-tj98fn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/java-internals-garbage-collection-and-array-zigzag-awzr4g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/linked-list-reversal-rubik-s-cube-and-pythagorean-triplets-81q179</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-a-linked-list-is-a-palindrome-in-place-9n6wt1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-number-of-occurrences-in-a-sorted-array-dd5jyo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/group-anagrams-5r3lq2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/unique-length-3-palindromic-subsequences-7fqi2v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/range-of-queries-with-distinct-primes-ojemz0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/the-value-of-a-weighted-tree-v9rgah</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/data-aggregation-and-counting-mbc4hy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/longest-palindromic-string-scmng6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/next-greater-frequent-element-1pjsyr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/shortest-distance-in-2d-grid-ibu5z8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/bottom-view-of-binary-tree-a3k7r7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/swap-elements-to-make-array-sums-equal-5tokmz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/shortest-unique-prefix-dglt5g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/path-between-two-nodes-in-a-tree-18qz3p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/find-the-nearest-exit-in-a-maze-grid-qyti22</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/function-overloading-vs-function-overriding-twts2m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/javascript-execution-on-web-browsers-8sxjzk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/design-a-web-page-with-multiple-geometric-figures-r5sph1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/sum-of-digits-p8j3ug</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/check-palindrome-fae2qo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/tree-traversal-implementation-63o3lv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/flexible-strings-programming-contest-bias-and-max-swiggy-psfa65</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-stack-using-priority-queue-with-o-1-push-and-pop-h2inlk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/three-mislabeled-jars-problem-i2y8ow</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/create-and-balance-a-bst-from-random-numbers-g6ij95</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/linked-lists-vs-arrays-and-vector-internal-implementation-sizky6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/evaluate-critical-section-code-segment-with-global-lock-g8xys4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/reverse-linked-list-segments-fflv7l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/kadane-s-algorithm-variation-a8ssaj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/minimum-sum-path-m7a04x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/count-special-symbols-and-reorder-digits-based-on-parity-0x90xc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/find-numbers-formed-by-multiplication-of-consecutive-numbers-0rq7f9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/java-even-number-printer-brk9bn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/java-method-addition-rvmg81</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/consecutive-user-logins-lob4k0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/count-contiguous-bits-6ms5w6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/delete-common-words-j2wgmz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/last-index-to-place-a-flower-yd4ac0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/random-number-generation-xtuyv3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/increasing-character-sequence-from-pairs-6vdry5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/print-a-triangle-pattern-vw1vbq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/design-a-priority-counter-queue-using-deque-1izx4a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/fit-maximum-cubes-into-a-large-cube-nlig1g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/tic-tac-toe-permutations-8usilt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-starting-index-of-1s-in-a-binary-array-bmj5a9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/maximum-subarray-sum-with-negative-numbers-5t5snu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/transform-string-using-intermediate-string-array-ilw3g3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/subarray-sum-problem-ktbdn6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/write-pseudo-code-for-binary-search-2wv68c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/identify-unique-numbers-in-an-array-of-repeating-numbers-2z5j2p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/implement-stack-and-queue-x1pjmu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/remove-duplicate-characters-in-a-string-tgu82k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/max-modules-completed-per-project-dehjv9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/implement-a-sorting-algorithm-o8jyec</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/gender-separation-cs268v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/vector-functions-e4s7an</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/void-pointers-qjsx8c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/vector-vs-array-botmh9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/sum-of-non-consecutive-subarray-u4uk5k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/maximum-area-of-histogram-uf6y7g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/longest-increasing-subsequence-and-string-turns-jfwpc5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/collect-maximum-points-in-a-grid-6oa3n8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/maximum-contiguous-sum-in-an-array-fpky60</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/swiggy/generate-f12-from-f6-a6p26r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/coin-combination-problem-5aux0b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/design-command-line-file-system-operations-i0ckla</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-sum-of-digits-in-a-number-g15fgj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/traversing-an-array-from-back-to-front-and-vice-versa-hqz2y1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/write-your-own-sqrt-function-0wjye6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/smallest-missing-positive-number-8z0idl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/form-a-circle-with-array-of-strings-qcel05</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/kth-smallest-element-in-a-bst-6w4mz8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/maximum-profit-with-multiple-stock-transactions-b98xod</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/allocate-minimum-number-of-pages-pu49cb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/minimum-semesters-required-to-finish-all-courses-with-c6bdxq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/sum-of-pair-with-maximum-product-q4wpau</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/modulo-exponentiation-ds4mxn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/find-pairs-where-a-b-c-d-fnli8h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/expression-sum-to-100-ng352n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-anagrams-in-a-dictionary-647ck6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-pair-with-sum-c-in-sorted-array-mbtp5o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/check-if-t2-is-a-subtree-of-t1-o5pcin</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/minimum-towers-to-cover-all-nodes-in-a-graph-7ctkvs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/o-1-search-with-arbitrary-space-complexity-oq74fz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/dijkstra-s-algorithm-and-graph-traversal-fayv9h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/calculate-cumulative-sum-of-gcds-for-array-range-queries-z559zx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/count-n-digit-magic-numbers-with-remainder-k-modulo-m-nko0kd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/minimum-grid-size-for-values-1-to-n-at-distance-k-or9oq6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/print-employee-hierarchy-based-on-input-string-iwmyh9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/reverse-words-in-a-string-based-on-fibonacci-series-indices-oor7e9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-max-square-in-2d-matrix-with-boundary-as-1s-40dcgg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-optimal-stock-buying-and-selling-channel-49i09y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-median-from-a-stream-of-numbers-without-extra-memory-sm20jz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/numeric-to-roman-conversion-8utblh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/employee-presence-query-vo8g0j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/matrix-transformation-isa9uk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/move-zeros-to-end-l8jwzj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/in-place-90-degree-clockwise-rotation-of-a-submatrix-43f3ze</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/resort-sorted-array-containing-negative-and-positive-values-i96tvy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-subsets-that-contain-equal-sum-in-an-array-n7qm6e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/check-if-characters-of-a-sample-string-appear-in-order-in-a-fd97px</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reverse-words-in-a-string-gi7sla</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-vowels-and-consonants-dzo6s6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/calculate-average-and-grades-hm9mmh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-and-multiply-two-lists-uercv7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/project-code-and-db-connectivity-r4och4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/rebound-height-and-temperature-decrement-vxstw3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/implement-binary-search-with-real-world-example-p27rd6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/filter-records-for-the-month-of-october-1ddjw3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/explain-merge-sort-and-provide-pseudo-code-6ai2zd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/explain-the-producer-consumer-problem-mvtd88</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/print-all-palindromic-substrings-in-a-string-wo8ihd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/search-element-in-a-sorted-matrix-x893mm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/second-maximum-and-reverse-string-iiq49h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/sort-array-placing-zeros-at-the-end-w8nmjt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/nuts-and-bolts-and-minimum-platforms-ldb6fo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/sql-query-for-2nd-maximum-salary-and-hotstar-scale-yc59zk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/count-distinct-palindromic-substrings-je2wtu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/kth-smallest-element-in-unsorted-array-td5x37</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/city-traversal-by-distance-h9e8ef</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/shortest-distance-between-cities-for-multiple-queries-0og4xh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/form-a-string-from-a-character-grid-6apzpc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/insert-a-node-into-a-doubly-linked-list-qui4r2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-all-grandchildren-s-children-in-a-family-tree-3ltzi8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/merge-overlapping-intervals-io2jcw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/write-javascript-code-for-a-simple-login-form-ebbjy0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/convert-digits-by-mapping-9-digit-xham4w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/boolean-matrix-question-rvj7jp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/subtree-node-count-4fuyfm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-the-row-with-the-largest-length-of-consecutive-1s-4ue02k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/inorder-successor-and-predecessor-in-a-binary-tree-8ym9ha</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-all-pairs-with-sum-k-in-a-sorted-array-5zvrx7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-second-largest-element-longest-consecutive-1s-and-yhre0q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/replace-all-occurrences-of-substring-s2-with-s3-in-s1-m7h4ui</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/add-two-numbers-represented-by-linked-lists-with-carry-8x5ah3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/generic-bst-implementation-with-encapsulation-and-custom-39tcir</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/delete-and-earn-ciimm0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/unique-path-finding-on-triangle-vertices-biyg4k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/k-reverse-linked-list-ndq1sn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/time-to-completely-hydrate-a-binary-tree-rau7ig</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/implement-max-heap-and-deletion-3wjidk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/count-ways-to-remove-eggs-l81vn3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/remove-bst-keys-outside-range-6jslw8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/minimum-repetitions-for-substring-yg1nwq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/longest-path-with-same-label-in-tree-8u4ks9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/random-sublist-of-size-n-7oph8w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/top-10-video-watch-rates-aqo6hi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/design-a-data-structure-that-acts-as-queue-and-stack-tisa90</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/count-ways-to-reach-the-n-th-stair-rv4l57</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/jump-game-3fgvq9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/check-if-string-is-a-palindrome-33zl0d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/find-transition-point-in-infinite-sorted-array-of-0s-and-1s-a5kxx7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/path-finding-using-bfs-p9ix56</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/find-minimum-value-node-in-bst-s2hdpi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/two-sum-and-subarray-with-given-sum-uby3ax</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/find-mid-and-reverse-linked-list-83bq7a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/check-if-n-is-a-leap-year-gl2xc8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-substrings-starting-with-vowel-and-ending-with-6jvblz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/reverse-a-stack-without-using-another-stack-aew6pk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/connect-all-nodes-at-the-same-level-in-a-tree-9lee4y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/move-negative-numbers-to-end-of-array-ebyx8y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/egg-dropping-problem-5vgwic</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-issubstring-using-kmp-zc9fnk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/generate-1-7-from-1-5-lyni6r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/print-permutations-of-a-string-m9bn2b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/bits-to-flip-to-convert-a-to-b-6l15os</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/form-maximum-number-from-array-wxm3nj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/next-greater-element-in-linked-list-uwizf3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-rows-of-coins-ew8agd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/subarrays-with-product-less-than-k-30lsq0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/largest-substring-having-repeated-characters-n1rj5a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/smallest-subset-size-with-sum-equal-to-k-ma1p8h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/frequency-of-queried-element-in-array-5i8k5i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/bst-insert-and-search-egq7ev</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/form-largest-number-from-array-of-numbers-0z6ta6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/calculate-people-remaining-in-a-room-at-end-of-day-3lmw3a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/find-the-minimum-number-in-a-given-set-of-numbers-3puavv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-the-missing-roll-number-in-a-class-loz4cr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/square-root-of-an-integer-dlr9cg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-faulty-players-in-chinese-whispers-oziw7c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/validate-string-containing-t-r-u-e-in-order-ov0n5a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/cross-platform-file-search-algorithm-qjn7oe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/implement-a-linear-queue-qw2h08</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/get-size-of-variable-without-using-sizeof-ril2f8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/divide-a-number-by-4-without-division-operator-n4bznv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/insert-node-at-given-position-in-linked-list-mc8lvk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/necklace-formation-t92c2f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-socks-to-get-n-matching-pairs-zknkn2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/binary-search-on-an-infinite-array-p9fhu2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-element-appearing-more-than-50-in-a-stream-0hhtz4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/print-1-to-200-without-using-loops-asga64</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/replace-element-with-sum-of-next-or-previous-k-elements-zfn4bt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/reverse-binary-string-of-an-unsigned-integer-w3xafx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/factorial-of-a-large-number-as-string-ocz9mw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/sort-a-hashmap-of-objects-by-an-attribute-o1u4zb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/make-the-array-beautiful-nn6v32</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/count-combinations-of-1s-and-3s-summing-to-target-2sifnw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/replace-word-this-with-that-without-inbuilt-functions-5kvk41</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/find-the-second-highest-element-in-an-array-8huzh7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/hashmap-manipulation-using-java-8-streams-rdlj5l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/check-if-string-is-palindrome-using-recursion-9h0k0f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/implement-tic-tac-toe-game-6bfj1e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/simulate-bouncing-ball-on-wall-u7lk29</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/cuda-program-to-add-two-arrays-by-index-wv67dt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/process-termination-triggered-by-file-content-t53kmq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/implement-linux-ls-command-t2r6qi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/cuda-program-for-matrix-multiplication-9or0d7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/select-flask-with-minimum-wastage-y64jtu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/separate-positive-and-negative-numbers-h4aker</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/push-zeroes-to-end-and-sort-non-zeroes-mdy63m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/count-maximum-chocolates-with-wrapper-exchange-9o3axp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/longest-segment-of-integers-excluding-bad-numbers-nx9645</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/longest-subsequence-with-product-1-modulo-n-w8vo7h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/minimum-jumps-to-reach-largest-and-smallest-character-78p5hn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/book-allocation-problem-w17now</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/smallest-number-with-at-least-n-trailing-zeros-in-factorial-oqpti7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/unit-area-of-the-largest-region-of-1s-smy10h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/sort-a-string-in-ascending-order-k0c6n6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/print-a-string-word-by-word-tkiq55</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/find-numbers-divisible-by-5-in-a-given-range-gps101</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/find-the-greatest-of-three-numbers-h6gpkb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-sum-of-non-adjacent-elements-63dai3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-maximum-sum-strictly-increasing-subarray-8tyb5e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/automate-file-transfer-and-count-html-css-files-s8wy0g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/find-count-of-palindromic-sub-string-y3678b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/linked-list-insertion-and-loop-detection-mm1meq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/binary-array-sorting-sqg54b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/add-two-binary-strings-gpzc1u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-max-value-of-a-i-a-j-a-k-onjkr8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/print-left-nodes-of-a-tree-z976bw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/max-product-of-sub-arrays-1sk3qr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/binary-sort-algorithm-implementation-23bth4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/construct-binary-tree-from-preorder-and-inorder-traversal-3uk62c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/next-greater-element-and-previous-smaller-element-e7zyjp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/find-second-largest-element-in-a-bst-ac5y3a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/detect-cycle-in-directed-and-undirected-graphs-9tnm8x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/find-the-next-number-in-the-series-6lxlu2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/string-to-integer-atoi-7w331q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/stock-buying-problem-s364t2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/image-blurring-simulation-2amz4p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/count-points-covered-by-exactly-one-interval-36qshh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/find-the-first-occurrence-of-s2-in-s1-z3mh8a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-all-anagrams-of-a-pattern-in-a-text-string-dlyx2s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/print-all-paths-forming-a-ring-graph-fyb8l5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/longest-sequence-in-an-array-heql5a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/closet-xy-pair-in-a-grid-1amcip</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/match-objects-by-character-value-and-compute-product-sum-sm2u37</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/compare-expression-trees-zdo9b2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/is-subsequence-and-git-bisect-implementation-o5lew1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/guest-arrival-and-departure-plates-count-lrsv1n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/lru-cache-and-hashtable-implementation-y17ewt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/6th-largest-element-in-sorted-2d-array-z2ahbs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/nodes-at-distance-k-from-a-given-node-hg8amz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-root-to-leaf-paths-with-less-than-k-bad-nodes-1gdnsi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-in-row-and-column-wise-sorted-matrix-qtgl9o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/climbing-stairs-c79zhb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/distance-and-path-between-leftmost-and-rightmost-leaf-3yx7pc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/3-sum-closest-x2t7vr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/delete-all-duplicates-in-unsorted-linked-list-in-one-pass-p82z0b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-path-avoiding-mines-9bgimb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-symmetry-in-n-ary-generic-tree-m03qcc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-duplicate-elements-from-sorted-linked-list-5d6r2p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-in-a-nearly-sorted-array-with-swapped-adjacent-5rf2sl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/validate-sudoku-41h0fd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/word-ladder-convert-cat-to-men-i6gwg9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/find-common-elements-in-three-sorted-arrays-8to9tb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/copy-list-with-random-pointer-s8c99a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/non-overlapping-intervals-wso5gr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/bitwise-operation-problem-similar-to-ugly-numbers-w467bu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/design-ds-to-find-and-remove-character-with-maximum-gfl2l6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-gold-collection-in-a-grid-ua8ce9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-window-containing-all-characters-of-pattern-131aax</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/alien-dictionary-character-order-8fn9zd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/superimpose-two-trees-chng7r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-length-snippet-containing-all-keywords-fumab1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/evaluate-list-of-variable-expressions-xm52cy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/matrix-symmetry-lcs-and-balanced-parenthesis-w9mmko</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/create-tree-from-ternary-expression-and-write-sql-query-f4rbuf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/matrix-search-bst-pair-sum-and-two-pointer-approach-t908ad</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/tree-sum-w30i5a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/next-palindromic-time-hb73s9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/kth-level-from-leaf-lb539t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/print-number-pattern-based-on-powers-of-11-80fa2r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/dot-product-of-two-vectors-and-dynamic-memory-allocation-jybj62</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/compound-interest-macros-vs-functions-and-puzzles-pk35es</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/factorial-summation-remainder-and-cake-cutting-puzzle-b5ryl5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/minimum-length-after-removing-substrings-01-or-10-ol4dbz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/resume-project-deep-dive-and-oop-concepts-rkcx75</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/merge-two-sorted-array-qhqc5f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/compare-two-strings-without-library-530z9k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/add-binary-numbers-given-as-linked-lists-jtojk5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/minimum-bracket-reversals-and-stock-buy-sell-7uaj1s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/ancestors-between-binary-tree-nodes-and-fixed-point-8lyxxd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/maximum-stolen-value-from-houses-and-next-greater-number-o9ne53</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/subarray-with-zero-sum-and-left-view-of-binary-tree-70csgc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/good-subsequence-problem-ztn78o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/implement-merge-sort-q1y4rw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/advanced-java-and-spring-concepts-pbdz86</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-maximum-element-in-an-array-7ckaoh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/count-elements-in-array-between-l-and-r-fd3iho</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-number-x-in-a-rotated-sorted-array-pgt9ul</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-the-depth-of-a-tree-qf8c5g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/print-a-matrix-in-spiral-form-l6ym1c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/iterative-inorder-traversal-if52j1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/reverse-a-string-wordwise-d2dcep</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/calculate-a-b-in-log-n-and-count-multiplications-p6wpau</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/length-of-the-longest-valid-parenthesis-substring-zvq7f8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/count-straight-lines-from-graph-points-869rft</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/sort-array-b-according-to-array-a-jg8hpw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/swap-two-characters-in-a-large-string-a3wb9p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/excel-sheet-column-number-28qndw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/reverse-linked-list-in-groups-of-given-size-5o98dt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/check-if-a-number-or-string-is-a-palindrome-8xhjve</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/reorder-array-according-to-given-indexes-77sjyy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/interleave-characters-from-left-and-right-ends-of-string-78eh01</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/count-occurrences-of-a-character-in-a-string-f5j4yf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/find-second-maximum-element-in-an-array-wrzu81</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-character-occurrence-bubble-sort-middle-node-in-one-uayd9f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/increment-operations-to-make-array-equal-p4dtgn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/arrange-consonants-and-vowels-in-a-linked-list-665x47</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/maximize-median-after-k-additions-gl5z2v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/arbitrary-pointer-to-greatest-right-node-aj70gd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/min-deletions-to-make-string-palindrome-zygye3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-median-in-row-wise-sorted-matrix-wb3i15</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/implement-strcpy-o51qaq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/print-file-from-eof-to-start-kr1vrs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/size-of-a-binary-tree-zpq16n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/c-language-concepts-0l7are</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/merge-two-sorted-arrays-using-linked-list-5bfdt8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/memory-representation-of-negative-numbers-cws42e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/max-difference-between-two-elements-lfc4pz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/find-nth-rank-student-6my06s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/static-variables-in-memory-dq7ae4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/count-ways-to-express-number-as-sum-of-consecutive-numbers-xrj9no</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/handshakes-puzzle-and-java-memory-concepts-ixc9wv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/staircase-step-counting-and-k-largest-numbers-in-running-3zqhnb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pruning-tree-paths-and-custom-o-log-n-hash-map-with-avl-tree-jh0yyl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-pangrams-in-a-large-file-918e3w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-cost-matrix-path-nodes-at-distance-r-and-sum-of-bits-q5oids</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-subsequence-with-maximum-sum-xiy77y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sql-query-27jm88</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/rest-api-data-retrieval-9fl5y8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/linked-list-workings-ma0kpx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-the-nth-minimum-number-p3i2gd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/generate-substrings-and-subsequences-elz2mi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/matrix-multiplication-asjb03</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/subarrays-with-sum-0-7ldyf0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/populate-next-pointers-p3ijxv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/knight-s-shortest-path-f34par</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/string-transformation-cost-p3h4l6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/max-area-rectangle-h1x4mr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/plagiarism-detection-algorithm-psb96g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/string-character-difference-comparison-96i3db</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/reverse-words-with-special-characters-i6c2yh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/map-implementation-and-comparison-dggn1j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/extract-and-transform-numbers-from-a-string-5lmbbg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/logic-for-pyramid-pattern-printing-clf1fx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/convert-warm-to-cold-in-four-steps-ed1vww</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/fill-queue-with-blocks-of-sizes-1-8-9t873r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/delete-leaf-nodes-and-print-level-by-level-q86g8b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/largest-number-from-string-digits-1k8n0s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/code-producer-consumer-problem-sntc8h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-price-in-the-last-30-days-data-structure-f9ib95</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-money-from-houses-without-adjacent-theft-01htdc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/bracket-validator-zf9gja</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-rotation-count-of-sorted-array-q5e21o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/topological-sort-fm21a5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/min-and-max-amount-to-buy-candies-with-a-free-offer-ha7ku7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reverse-a-word-amazon-from-string-i-am-working-for-amazon-5r0109</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/search-in-row-wise-sorted-matrix-fisgz5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/count-word-occurrences-in-a-file-hlm6l8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/segregate-even-and-odd-placed-numbers-rqj41m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/bst-insertion-and-balancing-1bfajy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/print-all-root-to-leaf-paths-ptb3x2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/frequency-of-elements-in-o-n-039yg8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/binary-search-algorithm-5qbmzm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/lemming-vs-stemming-and-string-manipulation-c5j898</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/max-and-min-element-from-array-te6ehs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/maximal-rectangle-1fxso4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/sum-of-all-subsets-of-a-set-hw2izu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-the-point-where-maximum-intervals-overlap-5gmrx3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/connect-ropes-with-minimum-length-u5wjwe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/remove-nth-duplicate-element-from-linked-list-6obtym</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/word-occurrences-across-files-in-a-directory-aiea1z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/count-number-of-bits-to-be-flipped-to-convert-a-to-b-l4e9x1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/technical-interview-cj3isf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/find-distinct-characters-in-string-mi4yau</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/vowel-count-in-string-using-java-8-l3nkzf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/convert-halves-of-string-to-lower-and-upper-case-lvc51g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/difference-between-arraylist-and-linkedlist-avgey9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/reverse-a-doubly-linked-list-yutcb7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-cycle-in-a-linked-list-mab42n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/trie-insert-and-search-67tnwf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/missing-number-in-ap-series-j22ttw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/binary-tree-maximum-path-sum-oz1478</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-subtrees-with-given-sum-et9k4l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/serialize-and-deserialize-binary-tree-gn6jlg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/connect-nodes-at-same-level-t4t30b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-linked-list-in-k-sized-groups-6h8f3c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sum-of-cousins-in-binary-tree-p6ij9z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/subsets-with-given-sum-h17li2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/queue-using-stacks-pg4ydb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/minimum-days-to-watch-movies-under-a-daily-time-limit-4gmm0p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/circular-shift-of-binary-representation-qmgb5o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/implement-allocatememory-function-in-c-0qakv9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/odd-even-number-plate-scheduling-s2zv5e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-binary-tree-is-bst-ip3a9t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/second-maximum-element-6ei89m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/depth-of-bst-5mu4r0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/binary-search-implementation-yjnj2i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/string-matching-kcqjn9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/segregate-0s-and-1s-and-balanced-parentheses-8fk2yh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/print-hollow-square-star-patterns-azra65</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/print-matrix-in-wave-form-unique-character-count-and-n3rf23</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/decode-chmod-value-r07zmj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/roman-to-integer-tng3xs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/servlets-applets-and-java-platform-independence-mze1f0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/generics-file-handling-and-multithreading-in-java-dzqlg2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/segment-binary-string-into-powers-of-5-6ip87v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/minimum-circles-crossed-between-two-points-69zpfc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nvidia/turn-a-specific-bit-on-or-off-in-a-32-bit-integer-rrbm0g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/maximum-total-movie-rating-with-flips-xp9j4e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/gem-exchanges-on-circular-track-2xkmap</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/validate-tic-tac-toe-board-state-ctpw58</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/mutual-friend-in-a-graph-nv1gln</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/randomized-doubled-array-pdcg6f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-original-array-from-doubled-array-p2qsyi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pascal-triangle-and-grid-dp-ku67sx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/subsequence-modulo-problem-6cjujx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/parent-child-node-analysis-wesr13</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/find-missing-and-repeating-numbers-68lrvj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/find-topmost-and-second-topmost-manager-from-employee-table-k9ipfe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/add-two-numbers-without-using-plus-operator-vrmv9n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/find-nth-fibonacci-number-with-optimal-complexity-vzvon0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/switches-and-bulb-state-toggle-psv921</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/minimum-gifts-for-employees-sent-onsite-51yffn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/palindrome-permutation-check-eydh8q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/sql-query-to-find-names-of-all-employees-that-start-with-mu-0oy1b1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/determine-if-two-halves-of-a-string-are-alike-in-vowel-count-ix3o61</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-kth-distinct-string-in-an-array-cy9kyb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/count-trailing-zeros-in-factorial-d82b49</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/minimum-cost-path-in-undirected-graph-eofqe5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/longest-sinusoidal-subsequence-6ud7b1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/consecutive-integers-with-sum-z-6cvwl1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/add-two-binary-numbers-qpbu2w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/word-transformation-steps-ypao25</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-best-fit-interval-and-second-smallest-element-without-kppt46</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/modified-coin-change-and-longest-balanced-braces-length-52zfgy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/bst-subarray-lca-stack-and-sorting-algorithms-xrrw37</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/java-mutability-multithreading-and-spring-boot-uwlq25</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/define-data-structures-and-explain-linked-lists-and-trees-oas8rt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/design-a-hash-table-with-million-entries-minimizing-xrq5xl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/determine-if-two-objects-are-related-g3uta1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/delete-nodes-from-tree-based-on-list-qur1fp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/divide-array-into-k-buckets-with-minimum-sum-difference-7qtd87</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/longest-substring-of-all-unique-characters-zgiv16</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/add-a-digit-to-a-large-number-represented-as-a-linked-list-yd1lvr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/detect-cycle-in-directed-graph-and-print-nodes-0hemu0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/shortest-path-in-directed-graph-with-equal-edges-mbhj65</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/shortest-path-in-dag-with-different-edges-8hzm7f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/implement-thread-safe-singleton-class-as9o2r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/write-copy-constructor-for-derived-class-47qp6e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/write-comparator-function-syntax-in-map-w8msmv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/sort-n-files-with-k-entries-each-olga0u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/deep-copy-vs-shallow-copy-9lf8ny</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/count-occurrences-of-pattern-in-string-j1sylq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-second-largest-element-in-an-array-mo0305</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/count-pairs-with-hcf-1-less-than-n-8mex0c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/kadane-s-algorithm-problem-5dyga4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/valid-parenthesization-with-multiple-brackets-ia06xk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/alternate-sentences-from-anagram-dictionary-fr900k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/balloon-burst-variation-dp-6jyvln</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/arrange-deck-of-cards-for-equal-probability-ipf8ep</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/number-of-jumping-numbers-f8lis5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/iteratively-remove-all-leaf-nodes-55gqze</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/m-coloring-algorithm-mfc7re</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/check-if-number-is-fibonacci-7w1ocz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/minimum-fibonacci-numbers-summing-to-k-6b5p72</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/aptitude-and-coding-assessment-3nt3uc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/sql-joins-logical-question-and-contiguous-subarray-6o9g31</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/check-anagram-strings-t0hwox</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-last-ten-lines-and-tree-traversal-o4y017</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/analyze-pointer-code-and-segmentation-fault-pee7xs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/intersecting-linked-lists-for-document-search-mkrz2o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/programming-language-comfort-and-java-features-hmfr3c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/oop-concepts-and-overloading-vs-overriding-d8jtf5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/print-a-matrix-spirally-q5shrf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/first-non-repetitive-character-in-a-string-et7lzk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/common-ancestor-of-two-nodes-in-a-bst-wx2ki1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/delete-node-in-bst-89672v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/print-1-to-100-without-loop-i7leez</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-difference-between-two-json-documents-and-reconstruct-2fdqd4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/count-valid-parentheses-in-an-expression-a1o6m5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/rat-in-a-maze-unique-path-37qqpp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/generate-all-valid-parentheses-for-integer-n-ezhwo4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/first-occurrence-where-a-i-i-with-duplicates-o7lvp1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-first-occurrence-in-conditionally-sorted-absolute-array-lt1ugo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-cycle-start-point-and-cycle-length-in-linked-list-5xh08l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/check-if-two-collections-of-strings-are-anagrams-m12clf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/pangram-check-wp61c3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/concatenation-check-gbqfj2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/biggest-palindrome-cr5ssc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-increasing-subsequence-l65qkw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/heap-sort-implementation-hzlm19</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/merge-sorted-array-ebty8u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-peak-element-no96zh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/codeforces-1000b-coding-problem-iq6v4o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/pay-an-employee-using-a-7-units-gold-rod-ozagx3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/design-a-stack-supporting-getmin-in-o-1-time-and-space-kkcf1v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-number-of-coins-for-change-kn6mu6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/100-door-puzzle-l2nlqz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/largest-subarray-with-equal-number-of-0s-and-1s-nn9gic</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/egg-dropping-puzzle-y0gu5q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-steps-to-reach-target-99lwob</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/reverse-a-string-using-library-functions-b8w7vy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-the-missing-number-jyn6nx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/generate-all-strings-by-replacing-with-0-or-1-ara17d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/railway-station-data-structure-b24n94</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/convert-postorder-to-bst-w5qlcq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/stock-buy-and-sell-gyu5jp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/fibonacci-series-and-prime-number-a757pi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/minimum-time-to-finish-tasks-across-cpus-tf5xrz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/number-of-unlock-patterns-in-a-grid-qnv7zq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/delete-nodes-and-return-forest-hc1yxz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/finding-mk-average-wg14zq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/single-class-deletion-operation-ttrn2q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/operator-overloading-for-multiplication-vke8q4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/function-pointers-for-class-members-k0bt9c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/delete-a-linked-list-node-by-index-c8ocb6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/implement-strcat-function-ijij5t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/longest-path-in-dag-4k2y0q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/graph-storage-representation-1rzfaz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/check-for-cycle-in-a-graph-tfz86q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/thread-reuse-js6vz4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/conditional-variables-for-threads-4g3mes</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/maximum-score-of-batsman-in-a-50-over-match-82juof</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/divide-by-8-without-division-operator-zt697z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/divide-square-into-7-parts-horizontally-g2za58</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/divide-equal-heads-between-two-people-with-blindfolded-coin-g0v7sz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/check-for-odd-number-using-bitwise-operator-58rx5z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/check-multiple-of-4-using-bitwise-operator-9im2n5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/check-and-set-nth-bit-ppps2x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/subtract-symmetric-node-values-in-a-linked-list-p1v84f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/get-kth-row-of-pascal-s-triangle-lxa72h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/maximum-sum-path-in-a-grid-from-top-left-to-last-row-4nrb7u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/zigzag-vertical-order-traversal-for-binary-tree-f6p9lo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/replace-every-element-with-the-greatest-on-right-side-yz5byr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/check-arithmetic-progression-art9n1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/string-occurrence-count-f66x7e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/distance-to-duplicate-elements-3f9wqk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/minimum-moves-to-sort-array-4sssj5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/maximum-gap-after-bar-removal-1xoqou</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/max-k-for-submatrix-sum-3stlh7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/sort-array-of-structures-56ovi3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/minimum-window-subsequence-r1zsam</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/explain-java-c-and-their-differences-sn3xmr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/quantitative-aptitude-and-logical-reasoning-test-cfoa2t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/write-a-common-algorithm-like-fibonacci-5g1bqb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/longest-subarray-first-increasing-then-decreasing-ks01az</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/verify-birthday-paradox-b22umk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/minimum-distance-in-a-matrix-with-obstacles-4a6s3a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/count-elements-formed-by-adding-subtracting-operations-zab3uv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/return-nth-node-from-the-end-in-a-linked-list-uw0kxx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/explanation-of-system-out-println-w11utx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/method-overloading-and-overriding-return-types-e5lid2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/access-specifiers-and-return-types-in-overriding-ny089k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/exception-handling-with-overriding-and-static-methods-uw5jiq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/type-casting-and-object-creation-zps6nt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/try-catch-finally-return-behavior-q0ms7g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/throwable-class-hierarchy-in-catch-blocks-39pajx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/constructor-chaining-and-super-jumi09</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/maximum-xor-value-7uyme5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/divisibility-count-uvp2ms</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/find-second-maximum-salary-in-each-department-hwfq23</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/find-middle-of-a-linked-list-9lkdza</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/java-string-mutability-questions-wa86d0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/java-client-for-hitting-rest-apis-01gkfs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/concepts-of-polymorphism-p4x1ep</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/diff-between-hashmap-and-hashtable-n548rc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/remove-duplicates-from-an-array-in-o-n-space-and-time-6zne6k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/find-maximum-width-of-binary-tree-l0f8v3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/sort-a-stack-without-extra-space-xglm22</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/create-immutable-object-in-java-pbqra7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/print-last-ten-lines-of-a-file-efficiently-px4bj5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/database-query-writing-for-project-kq91oe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/string-matching-implementation-30xhtt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/fibonacci-series-generation-6kkkrp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/replace-elements-with-greatest-element-on-right-side-ui3q8b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/remove-all-duplicate-adjacent-characters-from-a-string-d50oik</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/knapsack-and-string-problems-25dtiz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/linked-list-cycle-and-memory-xtyw71</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/3d-lattice-points-mqw1ku</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/c-programming-and-graph-traversal-rfh6fs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/graph-node-distance-0glp4w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/queue-from-stacks-and-recursion-dxgim6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/sort-an-array-based-on-given-three-digits-order-i6ow75</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/average-price-using-java-8-stream-api-ro2ebx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/print-right-view-of-binary-tree-aigx0v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/detect-a-cycle-in-a-directed-cyclic-graph-z2uu1j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-next-bigger-number-jt5zso</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/concatenate-array-to-find-biggest-possible-number-5kw384</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-if-a-tree-is-mirror-of-other-tree-y3wpqr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-shortest-path-between-two-nodes-in-a-graph-uj09ru</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/print-cousins-of-a-binary-tree-6g41vs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/write-production-level-code-for-nth-fibonacci-otw7dz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/top-2-most-frequent-alphabetic-words-in-a-file-o3y9eb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/graph-traversal-problem-e3dynk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/segregate-numbers-in-a-range-qparg2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/tree-traversal-recursion-zb6oxi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/form-word-from-characters-q5u4z4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/remove-consecutive-duplicates-gbey8g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/number-equal-to-sum-of-left-and-right-subarrays-7k7aky</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/product-of-array-except-elements-at-indices-7n6syn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/first-non-recurring-character-in-a-string-si5p6s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-words-while-keeping-special-characters-gw4m3b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-missing-number-from-sorted-array-nsjfp7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/frequency-of-most-frequent-substring-within-constraints-pd3ygk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/maximum-product-of-two-non-overlapping-palindromic-t3q171</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/count-anagrams-of-a-string-sa3k72</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/maximum-frequency-item-pairs-6k9clf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/first-positive-element-in-window-fr6f2p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/unix-path-comparison-ysx68f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/minimize-array-sum-jpgpl2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/equalize-array-elements-waze5i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/check-if-a-number-is-an-armstrong-number-llsqo0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/bulb-switcher-problem-demz22</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/copy-data-from-one-memory-space-to-another-8b55dd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-the-best-average-grade-of-students-tvs2o0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-repeating-substring-8jbg3b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/check-if-a-number-is-a-power-of-10-wusy0i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/max-distance-on-a-circular-track-with-directional-steps-caszz2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/maximum-positions-of-final-array-element-l73zp7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/maximum-ways-to-reach-nth-floor-with-limited-jump-sizes-0s97mg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/reverse-a-linked-list-iteratively-84dk2f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/implement-merge-sort-on-an-array-ft0trh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/check-for-balanced-parentheses-3bulin</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/count-subsequences-starting-with-x-and-ending-with-y-z4os35</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/rearrange-a-linked-list-in-place-vnx991</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/finger-counting-sequence-algorithm-ucme11</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/2d-array-parameters-and-custom-memcpy-implementation-3ejm2g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/string-validation-and-bit-flipping-count-g8q32u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/level-order-traversal-and-tree-node-deletion-9etg95</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/transactional-rollback-across-mongodb-and-mysql-t4na53</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/rest-controller-endpoint-with-path-and-request-parameters-z55cqz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-employee-with-third-highest-salary-4pb0sp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/immutable-classes-and-string-pool-in-java-hey3sf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/fetch-all-employees-and-their-departments-using-joins-lwj2iy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/segregate-0s-and-1s-and-sort-array-of-digits-1-9-4hd8n2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/construct-array-based-on-frequency-intersection-zj7sy8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/binary-string-to-decimal-1av8k3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/nth-node-from-the-end-of-a-linked-list-2jqb9j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/construct-binary-tree-from-inorder-and-preorder-u5sqtw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/virus-detection-algorithm-supmi2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/check-if-rural-funds-are-properly-utilized-p0jxyi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/binary-string-transformation-fm49to</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/maximum-packets-for-tablets-7x9iyw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/sorted-subsequences-of-a-string-tom3wu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/matrix-traversal-with-cards-5i3elw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/splendid-matrix-generation-luncr3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/target-shooting-range-op10mz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/absolute-difference-of-greater-elements-on-left-and-lesser-38j6cr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/count-special-nodes-in-subtree-by-color-5l1o28</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/group-booking-amounts-into-ranges-w91js8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/count-ones-from-0-to-n-using-digit-dp-5ct149</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/implement-custom-sizeof-function-s66ls9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/determine-stack-growth-direction-5wxaeg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/design-api-for-64-bit-hardware-timer-from-32-bit-registers-1fjnpc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/merge-sorted-array-a-into-array-b-ygj3zd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/find-k-th-node-from-the-end-in-a-linked-list-wp4gl1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/modified-cycle-detection-in-linked-list-onu3vp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/calculate-total-traffic-fine-based-on-odd-even-car-numbers-mqmpy1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-proper-prefix-which-is-also-a-suffix-0f7xk6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-bst-subtrees-within-a-given-range-c1ieok</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-linked-list-is-a-palindrome-in-o-1-space-1mq7hv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/convert-integer-to-words-l6iilc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-all-elements-of-first-linked-list-exist-in-second-0xe6p2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/level-order-traversal-of-binary-tree-line-by-line-lz96i3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/two-sum-in-an-array-lejsi6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/classify-string-as-good-bad-or-mixed-nmk8aj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/maximize-final-sound-volume-for-song-playlist-87ztjp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-changes-to-avoid-adjacent-duplicate-elements-qskoc5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-left-right-and-top-views-of-a-binary-tree-ynv2em</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/word-ladder-problem-p9ziu7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/third-maximum-salary-b5cb9j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/towers-of-hanoi-approach-o9udun</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/next-nearest-palindromic-number-ivwqv5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/kadane-s-algorithm-e0mno1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/largest-set-of-contiguous-elements-p87b3c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/maximize-number-by-inserting-digit-3oyold</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/cutting-woods-into-k-pieces-dg9bps</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/hexadecimal-modulus-88in2f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/max-consecutive-ones-with-one-flip-rcmcc5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/maximum-cakes-in-journey-unm0ri</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/merge-sort-for-linked-list-of-floats-672vvk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/multiply-without-asterisk-qqcw7g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/generate-all-possible-partitions-of-a-string-xuz8v1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/remove-duplicates-from-an-unsorted-array-4hjh4z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/number-of-islands-with-8-directions-using-bfs-xb7bzd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-maximum-height-value-in-an-array-of-feet-and-inches-49xp8d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-intersection-of-two-sorted-linked-lists-recursively-hsdc3e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-alternate-nodes-and-append-at-the-end-of-a-linked-s7m0dp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-one-character-array-is-a-rotation-of-another-miezt3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-common-prefix-from-an-array-of-strings-1wzqm7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/minimum-steps-by-knight-hwf2ow</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/mask-characters-in-an-email-address-3f2gge</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/product-of-maximums-of-all-subsets-32tmqm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/minimum-time-for-cats-to-cross-a-tunnel-vnok2c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/stream-distribution-in-a-perfect-binary-tree-fhb8o2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/number-of-subsets-with-product-less-than-k-2plzq5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/minimum-string-repetitions-for-subsequence-9od9w0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/maximum-sum-increasing-subsequence-0dzqnu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/maximize-distance-to-closest-person-j81dnp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/double-spiral-level-order-traversal-of-a-tree-mk7y1p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-frequency-of-k-in-array-q07oac</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bst-from-sorted-linked-list-9uyidb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/nodes-at-distance-d-from-k-lxjg97</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-array-of-0s-1s-and-2s-p5wwn6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-two-large-numbers-in-files-6okyxl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/max-reacting-time-in-stack-uet8wr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/count-ancestor-pairs-with-product-k-mw09as</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/smallest-k-elements-in-stream-miozi1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/clone-a-linked-list-zy89lu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/tournament-winner-matches-b0z2wx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/telephone-dial-pad-combinations-33z0rv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/minimum-number-of-lines-to-cover-points-suk3ag</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/add-diagonal-elements-of-nxn-matrix-wwbap5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/delete-a-node-in-a-circular-linked-list-given-only-a-pointer-9as0sh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/rearrange-odd-and-even-nodes-in-a-linked-list-3vguro</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/count-pattern-occurrence-in-binary-file-2rla05</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/implement-custom-memcpy-handling-overlap-j6vlyl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/iterative-preorder-traversal-and-external-sorting-7v7i9h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/k-reverse-linked-list-and-peak-element-gg5ynp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/find-first-occurrence-of-0-and-shortest-common-supersequence-13wy1k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/multiply-two-numbers-using-recursion-i19xdg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/job-scheduling-with-heaps-9bwkks</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/smallest-integer-with-different-divisor-parity-lxkw6d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/minimum-cost-array-traversal-with-fixed-jumps-mhvdm8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/swap-two-variables-without-a-third-variable-9uc2xt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/addition-without-plus-operator-upfa3b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/josephus-problem-elimination-l749n7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/rearrange-string-characters-k-distance-apart-zir99d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-list-with-dynamic-input-size-746zcy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/minimum-days-target-cell-for-multi-chef-grid-travel-dcszv8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-path-sum-formed-by-consecutive-tree-nodes-kzn3yp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/insertion-and-deletion-in-a-tree-m4qwhs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/recursive-fibonacci-sequence-ujfej8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/set-entire-matrix-row-and-column-to-zero-pp87nu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/smallest-integer-with-digit-product-x-rbpot6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/sort-an-array-in-wave-form-k1gzca</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-magic-index-in-a-sorted-array-68khb1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/interleaving-string-check-0ku4th</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/pair-sum-from-two-sorted-matrices-z2kxju</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/first-missing-positive-integer-jqxk8v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/cpp-and-sql-technical-basics-6rg3gz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/expressive-words-gs1pw6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/data-structure-comparisons-byjz6y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-all-points-in-a-grid-can-be-visited-and-return-to-ctscx0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/resolve-maven-package-dependencies-in-pom-xml-stf14a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/reverse-elements-in-a-linked-list-ij5r3s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/last-stone-weight-after-repeated-bombarding-ldsb8n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/maximum-elements-popped-from-two-stacks-with-sum-constraint-8j15bd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/factorial-without-loop-or-recursion-5ab2gl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/print-boundary-nodes-of-a-binary-tree-vm7zdj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/round-robin-process-scheduler-using-circular-linked-list-vdt00s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/non-decreasing-array-o4dxth</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/minimum-stops-required-to-reach-the-destination-g7rg5d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/longest-balanced-substring-4naala</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/largest-tree-value-in-each-row-adi1bj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/flip-game-ii-5q1661</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/describe-binary-search-and-prove-its-time-complexity-de3prf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/sort-a-second-array-based-on-the-sorting-order-of-a-first-wbz0s4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/check-if-a-string-contains-balanced-brackets-sqp5n3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/maximize-stock-profit-within-budget-0-1-knapsack-m5ekuu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/count-ways-to-partition-integer-into-parts-up-to-k-z72l6l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/3sum-sum-of-3-numbers-as-0-1kn1h1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/target-sum-5ur5rm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/count-points-lying-inside-or-on-a-circle-for-multiple-2vueaf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/make-array-strictly-increasing-by-reducing-elements-u58hqs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/shortest-subarray-of-consecutive-elements-2edtdy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/count-number-of-ways-to-return-to-index-0-after-k-steps-6fi21f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/tower-of-hanoi-approach-pzdf3n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-square-root-of-a-number-with-fractional-part-without-7dvcc9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/design-atm-denomination-distribution-pmo2ms</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/reverse-string-word-wise-using-stack-61h31a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/search-in-sorted-and-rotated-array-oodu87</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-greatest-smaller-number-than-k-in-bst-ocjq3r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-delete-operations-to-make-two-strings-identical-q7mo00</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-pair-with-sum-closest-to-k-in-an-array-v6blzo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/paint-house-with-minimum-cost-cxou02</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/merge-sort-vs-quick-sort-7436ar</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/maximum-consecutive-1s-with-k-flips-hefbq5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/check-if-linked-list-is-palindrome-au33qz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/convert-bst-complete-binary-tree-to-min-heap-in-o-n-r13ji8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/expression-tree-construction-jevp8e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/nth-fibonacci-number-in-o-log-n-time-bn48rl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/find-number-of-correct-bracket-sequences-catalan-number-wp8bq5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/modified-0-1-knapsack-with-single-item-weight-change-unx3xg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-path-to-nearest-hospital-on-a-grid-etczo3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/longest-subsequence-with-adjacent-difference-k-h4wejg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/smallest-subarray-with-sum-greater-than-a-given-value-yqpui7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/reverse-both-halves-of-a-linked-list-around-mid-point-k2qd0a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/check-if-tree2-is-subtree-of-tree1-and-count-nodes-7t74se</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/minimum-number-of-jumps-to-reach-end-of-array-bm4mv5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/number-of-distinct-palindromic-substrings-hxs4rb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/postorder-traversal-in-bst-and-construct-trees-0g5abs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/query-sub-organizations-under-parent-organization-dh0t6r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/print-all-duplicate-numbers-in-an-array-zdehr7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/invert-a-binary-tree-iy2yng</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/smallest-multiple-of-a-given-number-made-of-digits-0-and-9-nh0k92</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/pathfinding-to-home-avoiding-robot-killers-msco86</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/shortest-path-from-source-to-destination-in-an-n-x-n-maze-0s383j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/count-elements-reachable-by-adding-subtracting-a-and-b-to-d-3l5czi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-maximum-vertical-sum-in-a-binary-tree-g1q4go</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-the-k-th-largest-element-in-a-stream-xi0uuj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-the-element-that-appears-once-in-a-sorted-array-in-o-guox1f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/policemen-catch-thieves-j5td54</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/count-servers-that-failed-3-times-in-a-row-el1zla</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/find-the-majority-element-in-an-array-without-extra-memory-h06l8f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/print-numbers-from-1-to-n-and-n-to-1-using-recursion-f1qqw3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/count-reachable-values-from-d-using-a-and-b-within-0-10-9-orrbi3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/shortest-path-from-source-to-destination-in-a-grid-with-k679wm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-distance-between-two-keys-in-a-binary-tree-83jgih</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/boundary-traversal-of-a-binary-tree-y6a9k9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/equal-maximum-sum-of-three-stacks-c1eraj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/dining-philosophers-problem-code-ma6i0y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/print-all-views-of-a-binary-tree-in-a-single-traversal-v10xvg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/sum-of-digits-in-all-numbers-from-1-to-n-6vrt4e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/sum-of-odd-position-digits-in-a-number-based-on-parity-fkyq38</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/compare-string-weights-based-on-character-positions-ascii-ttmvd8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/sql-query-to-find-names-of-persons-admitted-in-2015-apl8ys</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/find-and-remove-single-duplicate-number-in-an-array-isdco3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/convert-integer-to-english-words-e-g-1250-to-words-3730vi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-consecutive-sequence-in-binary-tree-x6q8u2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-number-of-platforms-required-for-a-railway-station-9izlmn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/find-divisors-of-n-in-a-given-range-38km9l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/the-handshake-problem-mjq29v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/sum-of-numbers-in-a-range-arithmetic-progression-xi1v0y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/minimum-books-taken-without-skipping-adjacent-boxes-k7nqtp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/ways-to-score-n-runs-without-consecutive-boundaries-tdnj77</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/is-subsequence-u7tbx3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/reverse-a-3-digit-number-50tqqw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/max-difference-a-j-a-i-with-i-j-847tux</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-sum-in-tree-with-no-adjacent-nodes-n5s04p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/chain-strings-to-form-a-circle-dv5xv1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/construct-balanced-binary-tree-from-sorted-linked-list-0rxgon</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/singly-to-doubly-linked-list-conversion-xt1okj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/find-combinations-for-target-sum-and-count-nr0en6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/find-loop-starting-point-in-linked-list-c7s0ib</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/check-if-s2-characters-can-form-s1-aef3jj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/timed-sql-sprint-1rcxt2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/arrange-images-by-frame-number-w6q4h6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/find-perfect-substring-wm819h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/balance-brackets-rnjlt0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-peak-element-in-an-array-q7rjqk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/marathon-energy-drink-consumption-901d66</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/jump-game-iii-cxlr1n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/situational-dynamic-programming-approach-k63bit</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/interleaved-strings-check-qjkg12</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/maximum-length-path-with-adjacent-difference-constraints-j6oe3e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/next-smallest-palindrome-by-at-most-two-swaps-p6n0m3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/maven-conflict-resolution-via-dependency-ordering-s98w2l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/number-of-fleets-on-a-race-track-y6w1jl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/coin-change-number-of-denominations-t97hv3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/quick-sort-on-doubly-linked-list-3ir89x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/sort-n-numbers-in-range-from-0-to-2-n-1-in-linear-time-ovum0b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/prim-s-mst-for-adjacency-list-representation-wjhny5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/longest-even-length-substring-with-equal-left-and-right-sum-879m3l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/reverse-a-bst-recursively-and-concatenate-two-bsts-8bbm9j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/evaluation-of-postfix-expression-nvmvf3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/kadane-s-algorithm-for-maximum-subarray-sum-9au5ug</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/generalized-water-jug-problem-r63cvs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-matrix-elements-in-diagonal-pattern-3sfzom</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/nuts-and-bolts-problem-5q6rn9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/max-roads-removable-maintaining-connectivity-for-two-and-odwri7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/best-time-to-buy-and-sell-stock-n23x43</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-depth-of-a-binary-tree-6bc9yz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/gas-station-circular-tour-7ejog0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/segment-tree-with-arithmetic-progression-range-updates-and-yysce4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/maximize-sightseeing-beauty-value-within-time-limit-9xorr0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-missing-fibonacci-number-in-array-j9zalk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/count-non-negative-integers-below-n-with-digit-sum-divisible-fjagm1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/minimum-adjacent-swaps-to-make-array-good-pt3cwp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/find-kth-good-number-greater-than-n-a4kjhe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/swap-0-and-5-without-conditions-loops-or-extra-space-kg7x9y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/check-if-two-strings-are-equal-by-swapping-letters-0hp2yc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/number-of-islands-variant-kbdxv6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/max-area-rectangle-calculation-mhbpm7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-missing-element-in-array-xim8hb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/count-vowels-permutation-qryyb7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/divisibility-by-8-wnm6s9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/root-to-leaf-path-sum-szpsj0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/character-occurrence-queries-f3jfsd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/max-occurring-character-rp7zkr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/zero-matrix-j3ipyu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/min-element-in-rotated-array-9xtpax</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/longest-substring-with-equal-0s-and-1s-abwo5y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/modified-bubble-sort-ay06n3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/filter-classes-by-student-count-rw4nwc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/count-elements-in-different-graph-components-97liks</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/case-insensitive-string-pattern-search-m3b6vu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/shortest-distance-with-k-edge-removals-pct6o5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/check-if-k-sum-subarray-exists-g3xm4z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-of-all-subarrays-of-size-k-w8nn6s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/find-the-next-number-in-sequence-b1g3m1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/first-repeating-character-and-character-frequencies-x81rnr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/reverse-an-array-in-place-6xebjm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/bubble-sort-implementation-8ca4ll</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/palindrome-and-string-reversal-variations-27e7ns</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/find-second-largest-element-v6g0qe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/path-with-maximum-weight-in-dag-9x7t04</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/queue-via-stacks-and-pythagorean-triplets-xm4jaq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/shortest-path-using-dijkstra-s-algorithm-hw3gkk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/search-a-word-in-a-2d-grid-of-characters-4onxd4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/rotate-an-array-and-validate-a-binary-search-tree-gb483p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/activity-selection-problem-for-class-schedules-tobx8o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/in-place-title-case-the-first-letter-of-each-word-in-a-2j3yxn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/sort-matrix-rows-based-on-second-column-elements-ggfw7c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-array-words-used-to-construct-an-interleaved-string-8fp5f0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/remove-vowels-from-string-in-place-2x9ozg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/merge-row-sorted-matrix-into-sorted-1d-array-with-no-35dzcx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-all-subsets-with-zero-sum-in-a-1d-array-zicjm0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/check-if-a-string-is-a-pangram-uo7bim</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/maximum-sum-submatrix-of-given-size-coe1er</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/lexicographical-sort-of-numbers-without-string-conversion-1yvwnj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/maximum-number-of-inversions-among-elements-92s0um</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/reverse-nodes-in-k-group-in-a-linked-list-5eongg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-nearest-smaller-element-on-left-oyc612</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/right-view-of-a-binary-tree-s96ytk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/max-consecutive-1s-after-flipping-0s-in-k-length-subarray-ke3oni</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/vertical-sum-of-a-binary-tree-9wnt3f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/count-array-subsequences-with-target-sum-dckwa9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/basic-python-programming-with-list-and-dictionary-ntj808</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/minimum-cost-to-reach-end-of-array-with-jumps-7eaohh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/modular-exponentiation-z2dg1f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/implement-quick-sort-2urdst</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/nth-node-from-the-end-of-linked-list-i6hmsp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/searching-in-bst-0ig8tz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-triplets-with-a-given-sum-in-an-array-hb7752</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/add-1-to-a-string-number-43su9x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/kth-smallest-element-in-array-7fbb6r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/minimum-operations-to-form-max-length-palindrome-sc1cxh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/sort-stack-and-find-middle-element-in-o-1-oak3nq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/delete-leaf-nodes-with-weight-less-than-k-z51znj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/check-if-two-tree-nodes-are-cousins-nq4y70</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/level-order-and-pre-order-traversal-8ct9gc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/heapify-implementation-25q03x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/optimized-merge-sort-and-quick-sort-partition-d88jyj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/dfs-bfs-and-strongly-connected-components-fcka07</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/separate-positive-and-negative-numbers-in-array-ef67kx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/count-matrix-connections-uv1jb0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/count-min-max-cells-zle3jw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/dot-product-of-two-arrays-4cbm9y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/add-fractions-ue6174</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/select-4-people-from-6-couples-m5jsn8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/median-of-two-unsorted-arrays-uij2dn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/calculate-distance-after-steps-on-coordinate-plane-dvq9vx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-length-of-identical-character-substring-with-m-h0n4if</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-a-tree-into-its-mirror-tree-0yevps</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-binary-tree-in-vertical-order-3k17nx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-median-of-array-without-sorting-qte8bj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-maximum-possible-stolen-value-from-houses-slj9kg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-words-in-a-sentence-6ondye</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/next-permutation-and-light-bulb-problem-4wya2s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/tree-burning-sequence-160lce</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/max-depth-of-json-string-7j8mye</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/o-1-insert-delete-getrandom-lqcz7y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/search-in-sorted-matrix-nxkqf5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/multiply-two-large-numbers-ix8djn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/k-diff-pairs-and-palindrome-substrings-7f8a5d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/linked-list-trie-and-bst-operations-hp5lb4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/smallest-number-with-given-digits-and-sum-3yabk2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/produce-factorial-output-from-zero-input-ne13fj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/find-pythagorean-triplet-in-unsorted-array-aa2v8u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/max-element-and-reverse-2h456z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/hierarchical-employee-list-k9afta</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-element-with-maximum-frequency-136y5h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/valid-brackets-in-string-xy6z3h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/third-maximum-sum-of-two-elements-x1k7y7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/hashing-collision-handling-8zqqjd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-middle-element-of-linked-list-efficiently-ku3x6g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/topological-sort-for-dependent-graph-nodes-z2putx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/design-a-stack-that-supports-getmin-in-o-1-4rdgbj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/minimum-cost-path-in-matrix-o5en4t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/time-complexity-of-recursive-fibonacci-code-f0jtg3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/maximize-sum-of-k-elements-from-array-corners-yz5nxn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/delete-a-node-from-a-singly-linked-list-sql13m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-triplets-with-zero-sum-in-an-array-2cvzaz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/print-duplicate-numbers-in-an-array-j15avz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/spiral-order-traversal-of-a-binary-tree-5cx6u9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/number-of-ways-to-represent-n-as-sum-of-four-integers-a9nlll</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/print-1-to-20-using-two-threads-alternately-dhqe5g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/reverse-linked-list-in-groups-of-k-1x8xrh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/paint-house-problem-lzd7vv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/implement-find-all-and-replace-all-with-limited-regex-pr96op</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/merge-bus-routes-9qu14p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/satisfy-people-with-candies-ci6cxg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/write-semaphore-code-o06bwc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/number-of-sub-arrays-with-sum-equal-to-k-9bto1x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-x-in-equation-string-j8dvet</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/calculate-x-y-in-log-y-time-f3ejy9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/in-place-reversing-of-a-string-4wn00j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/implement-merge-sort-on-a-doubly-linked-list-68ru5u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-extra-character-in-two-strings-4fgvcs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/calendar-availability-api-and-nodes-at-distance-k-uzvjr8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/level-order-and-skew-order-traversal-with-constant-space-j15gjg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/largest-sum-contiguous-subarray-and-duplicate-elements-q7ammy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/three-coding-questions-pairs-primes-and-cyclic-subsequence-jgzt2o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/segregate-0s-1s-and-2s-15355y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/bst-preorder-to-postorder-04pjtp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/largest-submatrix-with-black-boundaries-9dkhh1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/count-all-possible-fake-palindrome-substrings-ljxgp8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/define-oops-and-its-concepts-tc3j0d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/cross-join-vs-natural-join-vs-inner-join-by0iew</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/checked-vs-unchecked-exceptions-and-garbage-collection-in-apwxn5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/check-if-a-linked-list-is-a-palindrome-89xma2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/maximum-submatrix-sum-yr4x92</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/all-possible-permutations-of-a-string-rtev0b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-the-nearest-perfect-square-number-5l9qx0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/insertion-sort-algorithm-2odri9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/count-characters-and-alphabets-in-a-string-mjiq78</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/difference-of-number-and-its-reverse-me01ua</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/smallest-subarray-with-frequent-element-xc40dg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/group-shifted-strings-yn2fe9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-index-with-smaller-left-and-larger-right-elements-jzhue7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/minimum-fuel-cost-path-t5g9qc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/quicksort-algorithm-g5z0hc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/max-product-of-max-element-in-all-subarrays-tfr6ok</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/troop-of-cats-crossing-a-tunnel-s6i5gj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/populating-the-next-pointer-in-tree-nodes-tra7gq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/code-for-factorial-fibonacci-series-and-palindrome-jpx98e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/stack-and-queue-operations-ik1iea</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/recursively-remove-1s-sandwiched-between-1s-zscb97</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/maximum-length-prefix-printable-with-broken-keys-and-k-51y9qf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/topological-sort-of-a-graph-recursively-and-iteratively-7pfgc6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/coin-change-total-ways-with-denominations-1-3-5-k604ee</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/spread-exam-questions-among-students-with-email-capacity-i7yjte</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/implement-3-stacks-in-one-array-and-defragment-v1pl68</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/find-the-size-of-int-in-c-without-using-sizeof-operator-0w898h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/delete-a-node-with-a-given-value-from-a-singly-linked-list-mgi78k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/check-if-a-given-string-is-a-palindrome-in-c-63ut7p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/multiply-two-matrices-7funr9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/maximum-sum-contiguous-positive-subarray-ql0nrs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/smallest-window-in-a-string-containing-all-characters-of-i77pil</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/pattern-printing-in-c-and-java-tj8fmn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/hollow-diamond-pattern-printing-h8lz4j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/count-employees-and-order-by-id-9dwgfq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/find-occurrences-of-y-in-the-range-of-x-2om2t3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/finding-sum-of-digits-until-single-digit-4owtxp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/count-led-changes-for-sequential-digit-display-umi30x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/minimum-free-days-for-tasks-1-2-3-and-4-yv3hjh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/design-a-parking-lot-data-structure-by-car-and-area-sizes-q5exsx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/length-of-longest-subarray-with-sum-less-than-or-equal-to-k-m0pbct</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/maximum-of-minimums-of-all-subarrays-of-size-k-f2fcx8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/sum-of-ceil-square-root-of-node-counts-in-graph-components-282zn1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/largest-matching-submatrix-in-two-binary-images-r2pxrn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/count-ways-to-climb-m-stairs-with-variable-step-sizes-u5ctno</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/count-occurrences-of-a-word-in-a-given-string-9emtxc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/merge-two-sorted-arrays-with-o-1-extra-space-nle4wc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/reverse-an-array-in-groups-of-given-size-0c20jy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/find-sum-of-array-elements-at-prime-indices-92vxpo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/repeated-digital-sum-until-single-digit-7qo6pb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/find-the-equilibrium-index-of-an-array-kfnn5s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/find-items-present-in-both-lists-with-different-prices-lg0bie</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/count-strings-formed-by-removing-one-character-rtd9x5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/sort-array-according-to-count-of-set-bits-ufwzt8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/word-frequency-and-palindrome-check-ignoring-spaces-251vfv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-full-nodes-in-a-binary-tree-iyxx1n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/best-time-to-buy-and-sell-stock-with-at-most-k-transactions-pkjqk4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/non-repeating-characters-in-a-string-r8u2kb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/longest-common-substring-from-index-zero-zcid0u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/remove-anagrams-and-sort-lexicographically-txi2hs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-pair-with-sum-k-in-sorted-and-rotated-array-xy2iq7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/find-anti-clockwise-array-rotations-to-get-initial-array-5sukga</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/group-names-with-letter-combinations-272t7c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/bubble-sort-approach-m87ggq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/array-vs-linked-list-and-search-operations-mn4qmz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/reverse-string-sort-and-reverse-binary-string-t1rrmn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/amortized-time-complexity-for-item-insertion-c4phzk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/two-sum-variations-4aei0t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/pointers-linked-lists-vectors-dp-graphs-and-binary-search-in926w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/inversion-count-in-array-pdnsj3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-maximum-sum-combinations-from-two-arrays-h2gj2c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kth-most-expensive-transaction-in-a-stream-o0nnp5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-communication-path-between-two-leaves-38s5zb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/explain-merge-sort-and-its-complexity-cifg88</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/multiply-opposite-elements-of-two-arrays-and-sum-wi2jj3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/implement-a-sorting-algorithm-and-analyze-complexity-71vncw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/implement-a-cpu-scheduling-algorithm-3ab5xw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/write-palindrome-code-12ogsp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/smallest-5-digit-number-with-sum-s-8phg6h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/nearest-prime-number-before-x-q2ixy6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/recursion-and-fibonacci-series-u1t3np</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/maximum-consecutive-1s-in-binary-string-19dzji</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/coin-change-with-standard-denominations-4p38dj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/single-source-shortest-path-algorithm-3xfaqu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/modular-multiplicative-inverse-modulo-10-9-7-a4qwni</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/check-character-frequency-equality-in-string-halves-mqfs3w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/check-whether-sudoku-is-solved-j8qtoh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/random-song-player-without-repeats-cet38j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/rotate-an-array-in-place-wyqk5p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/permute-digits-to-get-largest-number-evp00w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/print-consecutive-numbers-in-pyramid-format-ohplx1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/transpose-of-a-matrix-n-times-xi6rhc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/write-custom-unchecked-exception-and-trigger-stackoverflow-e8ljn6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-sum-contiguous-subarray-tv5my9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimize-cash-flow-among-friends-7al6fd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-second-highest-salary-and-explain-dbms-joins-t7a9gy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/count-derangements-obi0bk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/remove-all-occurrences-of-a-character-in-a-string-hywq5p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/print-linked-list-reversed-and-forward-using-recursion-uji9xg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/minimum-swaps-to-make-string-a-palindrome-1pbdt7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-distinct-employees-ei58y6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/average-salary-by-department-ftv4tg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/list-buildings-with-no-employees-hen6ph</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/check-if-subsequence-of-a-string-is-substring-of-another-81svtc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/maximum-even-sum-subsequence-2y7ups</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/lexicographically-smallest-string-after-removing-duplicates-3ct8bd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/minimum-number-of-days-for-rotten-fruits-4ckefh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/delete-node-in-linked-list-without-head-pointer-rx1kt1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-largest-elements-wqcv2h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/task-ordering-6dwt76</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/log-file-error-retrieval-idh4ze</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/stepping-numbers-45zlgh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/total-area-of-two-overlapping-rectangles-rnxr0z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/add-digits-of-a-number-until-a-single-digit-is-reached-xt2tmy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-two-arrays-form-the-same-bst-ec88bm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/days-for-stock-value-x-to-become-y-72yq81</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/maximum-segment-length-such-that-product-is-positive-hof2yi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/merge-intervals-hc63p8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/minimum-number-of-swaps-required-for-arranging-pairs-i4zwb1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/rearrange-linked-list-in-alternate-first-and-last-element-h2z47d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/continuous-tree-484fnl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/maximum-contiguous-books-read-within-available-hours-li2fyy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/search-word-in-a-2d-grid-qt6fs3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/swap-adjacent-nodes-in-linked-list-dq6h79</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/first-5-largest-numbers-in-running-stream-9vjmu1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/rotate-string-based-on-sum-of-squares-of-digits-6bo2er</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/find-square-matrix-subarray-with-max-sum-7tkl2c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/construct-largest-even-number-from-digits-ysict3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/find-minimum-element-with-4-consecutive-occurrences-4f1zyi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/check-matching-braces-sejh6h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/count-n-digit-numbers-with-given-sum-u3swb4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/kth-smallest-element-in-bst-ixwj1p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/fix-swapped-nodes-in-bst-kt0h49</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/dfs-coding-and-technical-mcqs-8aml7t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/matrix-common-elements-median-of-sorted-arrays-zig-zag-hxtu0w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/pairs-with-sum-near-k-intersecting-linked-lists-and-r7rhip</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/matrix-string-search-and-hashing-in-networks-2sf6zr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/coding-and-sql-writing-l697yq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/lca-of-binary-tree-and-0-1-knapsack-9rtcnp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/clone-a-graph-and-design-a-secret-storage-service-wuotv9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/greatest-of-three-numbers-and-array-formula-evaluation-ahxl5j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/largest-sum-contiguous-subarray-and-sum-of-prime-factors-je9nci</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/linked-list-merging-reversal-and-sql-customer-count-lzr562</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/tree-traversals-and-maximum-subarray-sum-qgq109</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/sum-of-divisors-ufo8up</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/find-index-triplets-0asbw0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/level-of-number-in-bst-1s20qp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/find-element-by-percentile-gtplv0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/leetcode-587-66fqmc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/nodes-in-complete-binary-tree-ifbk5y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/insert-position-in-sorted-array-004zyb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/determine-relation-between-two-circles-5w5s5o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/count-error-resolution-actions-for-consecutive-process-8iy798</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/explain-pointers-and-the-asterisk-notation-5mv461</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/write-the-logic-of-bubble-sort-sm1pn7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/find-string-length-without-string-functions-3kq25g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/find-duplicates-in-an-array-jyem1v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/minimum-steps-to-reach-a-destination-reebp1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/count-reachable-numbers-in-array-fu2rm6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-pivot-in-rotated-array-ewkk93</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/minimum-cost-to-join-wires-ksa3x5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/sum-of-predecessor-and-successor-3191t7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/store-anagrams-by-frequency-x1jyzz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/decode-map-to-huffman-tree-i674xq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/sum-of-dependencies-in-a-graph-and-array-merge-operations-i0mq24</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/standard-leetcode-problems-tapping-rain-water-regex-matching-38rr8v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/right-view-of-binary-tree-and-binary-search-implementation-v3mthq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/sorting-searching-optimization-design-patterns-and-sql-joins-hs58kg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/evaluate-infix-arithmetic-expressions-6qi5sj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/add-two-numbers-represented-as-a-linked-list-ka4rsd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/print-pattern-and-check-palindrome-in-c-wouuh2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/rotten-tomato-missing-number-and-merge-k-sorted-arrays-wp9y5n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/detect-whether-the-linked-list-is-circular-i5odmb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-whether-the-number-is-a-power-of-2-71j3v0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-whether-two-trees-are-identical-724qvo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-peak-element-index-in-a-bitonic-array-7tbis8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-a-subarray-with-sum-closest-to-zero-8275jq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/compute-symmetric-difference-of-two-string-sets-with-custom-lm6rne</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/number-of-islands-water-island-problem-1oyrw5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/merge-two-bsts-with-limited-extra-space-wvq1jp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/implement-merge-sort-for-an-array-and-a-linked-list-zdqzh0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/write-an-immutable-class-ipubv2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/how-eclipse-makes-sure-of-parenthesis-eoho05</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/maximum-number-of-songs-played-during-journey-time-39gevz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/kth-largest-element-with-full-heap-code-jla4xs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/maximum-element-in-kth-window-with-code-d4xvhh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/get-minimum-element-in-o-1-time-p8t6r5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/print-the-hierarchy-of-employees-6w5whv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/print-dependency-order-using-topological-sort-p5h58c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/median-of-linked-list-297ik5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/print-even-and-odd-numbers-using-multi-threading-7yxgpg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/core-java-concepts-discussion-holv3m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/remove-duplicates-and-find-occurrences-in-a-string-vdrz8u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/oops-os-concepts-and-language-differences-d7j1g7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/average-for-each-department-sql-query-o4e4wc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/implement-binary-search-in-python-6z937n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/evaluate-java-postfix-increment-expression-ox5z8m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/string-immutability-in-java-6eelrl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/sort-0-and-1-in-place-in-o-n-time-9skryc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/maximum-profit-stock-problem-in-o-n-niq61h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/maximum-subarray-with-non-adjacent-elements-y55yjm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/sort-1gb-data-in-64kb-ram-pg7nnh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/find-missing-and-duplicate-numbers-in-an-array-agkd93</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/implement-a-stack-with-getmin-in-o-1-3w3cxc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/find-all-subsets-of-a-string-fkz17p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/find-the-kth-digit-of-a-raised-to-power-b-c7mwvd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/what-is-mvc-in-angularjs-kmess3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-first-repeating-element-in-an-array-8mnznb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/design-and-implement-a-special-stack-data-structure-9f0vtm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-all-sub-nodes-of-a-directory-structure-with-its-path-qw9nxe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/sql-query-for-dropdown-employee-filter-pyxge3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/search-a-word-in-a-crossword-z6p8ah</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-all-repeated-elements-in-an-array-sk2h5c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/count-possible-paths-in-a-matrix-0bl42t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/find-number-repeated-maximum-times-in-n-ranges-sen22y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/find-if-strings-can-be-chained-to-form-a-circle-0e47hy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/represent-large-numbers-and-manipulate-bit-ranges-xh647r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/clone-a-linked-list-with-next-and-arbit-pointer-15bymw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/days-of-month-using-2-dice-puzzle-4o4p68</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/2-eggs-and-100-floors-puzzle-fjqx30</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/print-all-combinations-and-permutations-for-n-lights-obvyx8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/program-to-check-syntax-of-a-string-c8n8fl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-last-nth-element-of-linked-list-in-single-traversal-4qz4yz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/arrays-vs-linked-lists-binary-trees-structures-vs-unions-n5btzw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-range-with-maximum-overlap-count-5nkuo2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-start-and-end-index-in-a-huge-sorted-array-0mlghn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/reverse-a-string-06vjb2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/find-day-of-the-week-for-a-given-date-9dktgq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/difference-between-linked-list-and-arraylist-zph5fe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/print-an-array-in-reverse-in-python-76ogkm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-index-of-point-in-rotated-sorted-array-hie681</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maximum-profit-earned-from-stock-buying-and-selling-u5m8tb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/exactly-one-swap-9g46hy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/partition-the-array-uft2ae</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/binary-search-of-double-values-4bu3g2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/file-input-reading-with-priority-queue-rxkup4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/sliding-window-with-sets-1nqexg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/level-order-traversal-and-zig-zag-traversal-4nccm2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sort-an-array-of-0s-1s-and-2s-c48cs0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/right-and-top-view-of-a-binary-tree-hs0xdb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/modify-spirally-sorted-matrix-0tnfo1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/fill-square-matrix-with-randomized-numbers-58pmvt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/count-vowels-in-a-string-xh56ml</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/palindromic-numbers-implementation-qwn5l6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/sql-query-using-like-operator-68exks</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/first-bad-version-and-best-time-to-buy-and-sell-stocks-j1fpzo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/monthly-sales-and-average-selling-price-for-2024-mq5em3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/third-highest-selling-product-per-category-xho1v7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/react-memo-vs-usememo-hook-selection-voy0tu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/pseudocode-for-react-card-component-from-figma-03511q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/reverse-linked-list-and-vector-class-implementation-ddj9on</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/graph-bipartite-check-7968va</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/unix-shell-script-to-find-zip-and-move-old-files-ace86a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/binary-search-and-hash-map-program-in-java-6c1lr0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/two-sum-problem-from-naive-to-optimized-q4ebzu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/remove-duplicate-and-k-th-last-nodes-from-linked-list-lo5jcl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/two-sum-product-array-except-self-and-array-search-0r8xn4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/dutch-national-flag-problem-5pxo61</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/area-of-inscribed-circle-in-a-square-x0lv8f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/reverse-sequence-of-words-in-a-sentence-in-place-c5uvxq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/expression-evaluation-bodmas-0dn2px</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/find-if-linked-list-is-circular-and-find-starting-node-qe1hj2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/maximum-sum-rectangle-in-2d-matrix-60jy5x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-number-of-pairs-such-that-x-y-y-x-dqmap2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-path-with-given-sum-in-a-binary-tree-puguo0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-nth-node-from-last-in-linked-list-798yxw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/difference-between-pointer-to-constant-and-constant-pointer-ow9xr2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/height-of-binary-tree-without-recursion-3kvrpu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/median-in-a-running-stream-of-integers-shoqc2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/abstract-class-in-oops-0zqivn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/basic-string-manipulation-and-time-complexity-ait8ar</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/sql-queries-using-joins-instead-of-inner-queries-n673li</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/xml-tag-searching-and-matrix-sine-wave-detection-r64bem</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/discussion-on-oops-coin-change-and-radix-sort-ecgmt1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/sliding-window-maximum-triplet-sum-and-missing-numbers-mf77gi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/design-a-shuffled-song-player-with-o-1-space-7xgqab</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-top-k-scores-at-each-stage-from-incoming-stream-hohor6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/optimal-sequence-of-dependent-sub-tasks-execution-s3ayfe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/convert-between-snake-case-and-camelcase-p9a1o5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/aptitude-and-digital-electronics-mcqs-m990pk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/digital-electronics-and-algorithmic-coding-nng0dq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/sum-of-sequence-based-on-character-mapping-86tsn0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/count-even-and-odd-digits-in-a-number-fbd49j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/count-numbers-with-exactly-k-digits-lgw97i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/count-character-frequency-in-a-string-and-sort-by-frequency-vhcj2l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/maximum-number-by-doing-at-most-k-swaps-npjb3b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/boolean-parenthesization-0bx1o7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/minimum-cost-to-fill-given-weight-in-a-bag-08qeir</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/second-largest-element-without-sorting-44kya6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/online-assessment-with-coding-and-mcqs-tuqy0l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/pseudocode-for-finding-repeating-elements-in-an-array-nq4vdo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/find-word-with-most-anagrams-in-a-sentence-z2v3f9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/assign-prime-numbers-to-characters-and-multiply-minimum-kn7dq7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/count-possible-paths-between-two-vertices-13j39b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/delete-given-binary-tree-iteratively-and-recursively-0gtdpy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/clone-a-linked-list-with-next-and-random-pointers-6azahi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/check-balanced-parentheses-zt1zim</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/partition-a-set-into-two-subsets-with-constraints-gtjm52</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/maximum-sum-of-non-contiguous-elements-in-array-h9c1fx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/combination-of-four-elements-summing-to-x-3wrwsq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/manage-single-reference-in-doubly-linked-list-5nnch3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/rotate-right-a-binary-tree-i9p1e7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/sql-query-for-average-marks-classwise-for-each-week-2n0cdn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/create-a-mirror-image-of-a-tree-y01wxe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/minimum-rooms-required-for-guests-qylda9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/flatten-a-linked-list-67pw4w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/find-loop-and-intersection-in-linked-list-85nvgs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/finding-duplicates-in-array-8zm5li</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/stack-queue-and-function-pointers-8s0lh4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/sorting-algorithm-complexity-analysis-694shd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/aptitude-cs-mcqs-and-medium-coding-questions-3n94h9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/smallest-window-substring-and-array-reversal-s9vns0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/ascii-operators-and-word-frequency-in-string-l7wdnp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/next-biggest-number-with-shuffled-digits-gmenb9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/binary-tree-traversal-without-extra-space-9sm9d7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/smallest-number-by-shuffling-k-digits-knp5dx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/matrix-construction-from-string-array-qbl39z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/most-frequent-element-in-array-6egqwf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/convert-a-binary-tree-into-its-mirror-tree-j03uq9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/swap-linked-list-in-pairs-v1upen</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/print-name-and-age-6zujep</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/shuffle-songs-with-equal-probability-nfe2gz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/arrange-numbers-as-strings-to-form-maximum-number-5iuezo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/implement-queue-using-a-single-stack-h8x660</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/palindrome-of-linked-list-xhsz59</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/synopsys/implement-and-explain-selection-sort-cw16bq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/length-of-the-longest-valid-substring-97oybj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/avl-tree-balance-checking-0kscke</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/median-of-2-sorted-arrays-in-o-log-n-time-and-o-1-space-esa0gn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/strings-anagram-in-o-1-space-complexity-pi2uqx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/level-order-traversal-of-a-tree-using-queue-ot9upz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/bfs-and-dfs-difference-pvqq54</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/product-of-array-elements-except-self-in-o-n-without-c8uegq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/recursively-deleting-linked-list-and-from-end-e8iq15</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/recursively-deleting-tree-fbqjn5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/difference-between-floyd-warshall-and-dijkstra-ejlw3k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/shortest-path-between-2-points-in-2-d-space-in-o-log-n-time-1s5q1s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/longest-subsequence-which-is-a-substring-6lmbt5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/remove-odd-valued-nodes-from-linked-list-q5y8gd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/convert-binary-linked-list-to-decimal-i1hvbm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/remove-a-node-given-only-a-pointer-to-it-bp8tjc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/c-output-and-mac-address-concepts-nj8y3v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/delivery-salary-updates-and-customer-counter-allocations-8n0hh6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/planning-the-street-plot-assignments-dpsm75</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/longest-cheat-way-in-tree-seating-r1exkb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/minimum-digits-removal-for-divisibility-by-3-xtay8i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/recurrence-relation-with-large-constraints-5gv42a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/string-reversal-and-duplicate-removal-3d8hvo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/minimum-insertions-to-ensure-each-bracket-pair-encloses-a-dtvzn4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/maximize-length-of-equal-number-subsequence-with-operations-x3cnza</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-total-negative-integers-in-an-array-qph6pr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-total-occurrences-of-a-number-in-an-array-s4yfet</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/transform-an-integer-by-replacing-each-digit-with-its-8k77zb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/largest-sum-contiguous-subarray-having-unique-elements-rchmo7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/print-nodes-at-distance-k-from-leaf-nodes-in-a-binary-tree-wk6frt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/generate-fibonacci-series-up-to-n-and-print-all-prime-mix7cr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/evaluate-pointer-arithmetic-expressions-on-an-array-pgoxl8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/check-whether-a-given-undirected-graph-is-a-tree-wzqm08</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/maximize-sum-of-k-corner-elements-in-an-array-f2gqee</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/find-an-element-in-a-sorted-infinite-array-u18lcj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/minimum-initial-strength-to-cross-a-dungeon-2svo6n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/pairwise-swap-elements-of-a-one-dimensional-array-mo5r1o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/pairwise-swap-elements-of-a-linked-list-g2yrr6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-the-middle-element-in-a-linked-list-t20cow</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/sum-of-all-nodes-in-a-binary-tree-tjhpl0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-a-pair-in-an-array-with-minimum-difference-vqg9bi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-subarray-with-given-target-sum-cwz60a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/merge-two-arrays-with-nulls-and-find-median-n30cbe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/print-elements-with-frequency-n-2-and-their-count-ma43up</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-iterations-to-pass-information-in-a-tree-gha1fh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-platforms-required-for-a-station-upka00</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/extract-target-substring-from-a-delimited-string-path-a8ftn3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/find-kth-maximum-element-from-an-array-nm5i42</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/reversing-a-linked-list-i2rdjw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/print-natural-numbers-using-recursive-main-call-i4ychg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/format-unsorted-chemical-elements-array-into-sorted-p025n9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/minimum-cost-of-jumping-out-of-an-array-fxke5n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/two-numbers-with-product-n-and-minimum-sum-40onf9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-next-number-in-a-sequence-and-minimum-value-larger-than-422g9g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/java-snippets-output-and-linked-list-reversal-qmbc18</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/sum-of-distances-a8mb55</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/cyber-beacon-detection-c1s0ex</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/potential-attack-vector-1kbum3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/bit-profit-8ygnwd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/find-minimum-number-of-coins-1ze4il</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/sorted-subsequence-of-size-3-4vel9d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/min-distance-between-words-wm4zx7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/horizontal-distance-tree-traversal-2grzyt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/longest-palindrome-delbk0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/max-sum-at-level-7fq806</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/sum-at-horizontal-distance-38seow</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/regex-implementation-voj2wd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/sort-by-set-bits-qie0gr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/slot-machine-max-value-843nca</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/binary-linked-list-to-decimal-02gj5o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/arrange-strings-with-no-consecutive-initials-qf3nna</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/longest-special-subsequences-zl1l7p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/largest-smaller-element-on-left-d4r403</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/company-hierarchy-tree-questions-le3vr8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/check-if-word-can-be-formed-by-removing-characters-do5upb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-adjacent-swaps-to-group-1s-v5pi8d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-defragmentation-in-an-array-w0b8w7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-a-string-tokenizer-without-extra-space-ja227w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/efficient-phone-directory-search-using-file-seek-x1v5n5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/subtract-numbers-from-two-sorted-files-line-by-line-fdqd2g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/sum-of-all-possible-numeric-string-expressions-vjc9g5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/0-1-knapsack-variation-with-long-description-nz2ndd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/minimum-money-to-equalize-wallet-denominations-2i1goh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/sort-select-query-results-without-order-by-cfxs32</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/implement-a-comparator-using-runtime-polymorphism-1g7kb7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/shortest-path-with-at-most-k-edge-weight-reductions-vdxjo8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/least-cost-to-fill-car-petrol-tank-to-capacity-c-mjy0kd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/count-and-display-valid-bracket-expressions-gz4pnv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/word-count-of-the-longest-line-in-a-file-66qc3p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/shortest-palindrome-in-string-array-1cd5o1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/minimum-weight-path-in-3x3-matrix-2fcfx2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/balanced-parentheses-algorithm-nvv1c7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/k-th-largest-element-in-array-7ptkq9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/pattern-existence-in-text-r5b37o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/stack-reordering-with-reaction-times-1vk7r2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/total-directory-size-calculation-nc6yuk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/find-missing-number-in-string-sequence-r4nlw6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/n-ary-tree-insertion-with-millions-of-children-kpw6gn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/closest-city-with-shared-coordinates-pn5q86</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/lca-in-binary-search-tree-btyv1e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/stock-buy-sell-once-a3n3of</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/stack-using-queues-vno9v3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/binary-representation-palindrome-hdwt95</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/linked-list-cycle-ii-c3ixrm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/minimum-operations-to-equalize-integers-5r98bk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/pattern-matching-with-exclusion-8xr13z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/string-reshuffle-check-u8h07w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/merge-n-sorted-arrays-each-of-length-k-2gqid0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/package-distribution-with-minimum-cost-hlc54b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-all-articulation-points-in-an-undirected-graph-q318zs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/pattern-search-in-grid-for-efwa-wui72d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/divisor-queries-on-m-and-r-3lqswz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/count-valid-daily-logins-per-user-tb2e9s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/sort-binary-numbers-represented-by-set-bit-indices-65wbwj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/maximize-upgraded-servers-with-budget-constraints-0j5pns</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/maximum-score-from-selecting-k-edge-players-i5uo2d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/calculate-monthly-cumulative-employee-salary-8o3ex4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/count-employees-per-department-using-inner-join-6ioeqm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/find-infected-city-binary-representation-on-day-n-3vwd7y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/determine-if-two-rectangles-overlap-7xra1a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/design-schema-and-query-for-student-test-scores-7sqgje</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/swapping-nibbles-in-a-byte-x8m1hy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/maximum-profit-from-share-trading-at-most-twice-gqzx62</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/remove-nodes-outside-given-range-in-bst-6j2ez1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-most-frequently-repeated-element-in-place-g9umit</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/count-number-of-pairings-in-an-array-3lkjd1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-second-largest-number-in-array-fobng7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/remove-alternate-digits-from-number-p3u30q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/word-search-in-2d-character-array-d8vxgz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/optimized-search-in-array-with-inserted-1-values-4w1zm2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/maximum-length-subarray-with-equal-0s-and-1s-8yjjbd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/implement-least-recently-used-lru-cache-t1utzl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/form-palindrome-from-string-jv1ndo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/recursive-and-iterative-factorial-49tpb2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-next-greater-permutation-number-tjz2p1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/sorting-and-maximum-increasing-subsequence-h7jhtv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/minimize-fuel-stops-u9iyov</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/minimize-tree-penalties-eyom52</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/paths-in-dag-jmyo2h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/min-stack-jskj25</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/max-root-to-leaf-path-gd7jzy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/power-function-yfoe45</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/perform-union-between-two-linked-lists-81zmte</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/largest-sum-subarray-cfw1ue</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/display-all-sets-of-anagrams-from-string-array-0dyby5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/make-student-class-name-field-immutable-673p9d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/implement-a-singleton-class-in-java-ijiyq7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-if-any-pattern-combination-exists-in-text-x5qaym</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/join-two-tables-and-retrieve-columns-with-min-function-u7en21</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/query-student-details-and-marks-in-a-subject-8ejc8o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-an-array-without-using-stl-xv0w40</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reorder-array-by-odd-indexed-values-then-zeroes-then-even-2bx0pd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/count-numbers-in-range-where-product-has-no-digits-from-n-a85wxo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-initial-money-to-cross-street-safely-xdx0h3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-deque-class-in-java-vt0wgx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/optimize-doubly-linked-list-memory-using-single-pointer-f3ff3z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/print-fibonacci-series-recursively-5nspwo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/calculate-clock-hands-angle-wskd8n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/first-non-repeating-character-in-multi-threaded-environment-ayjxz1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-occurrences-of-all-characters-in-a-string-using-e9gobi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/display-duplicate-values-from-a-table-m164wl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/find-word-occurrences-in-paragraph-acm19l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/reverse-bits-of-a-number-12986t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/min-distance-between-two-nodes-in-binary-tree-rgve0d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/implement-floyd-warshall-algorithm-6oaqrc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/sort-strings-by-custom-alphabetical-order-0k94d6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-rotation-count-in-sorted-rotated-array-kraxc1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/basic-linked-list-implementations-yfwq5d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/copy-list-with-random-pointers-2gd3uf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-ancestor-node-difference-t9oso1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/fibonacci-like-string-partitioning-y20jcb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/character-frequency-in-alphabetical-order-igkrq6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/kth-largest-element-in-a-stream-qs86m0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/smallest-non-constructible-sum-1q1ltq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/longest-subarray-with-sum-k-xjy8wu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/reorder-images-by-frame-numbers-hesw41</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/common-subset-string-to-form-both-strings-06i942</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/minimum-cost-to-reduce-piles-to-smallest-height-6ifug2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/n-meetings-in-one-room-nusue6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/implement-trie-for-prefix-search-09scn3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/nearest-smaller-element-4v38tt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/find-unique-elements-in-an-array-71hqk9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-cost-to-melt-balls-rz3ld9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-largest-or-smallest-elements-in-an-infinite-stream-qkbc5i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/clone-a-linked-list-with-next-and-random-pointer-wmp5iq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/electrostatic-net-charge-from-positive-and-negative-values-2wmgy5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/count-words-unchanged-after-rotation-vec55m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/minimum-depth-of-tree-from-level-order-and-inorder-ndh7hn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/next-lexicographical-string-without-palindromes-j8p8iq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-length-of-a-linked-list-and-sort-it-7puuxj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/sum-of-strings-in-a-custom-alphanumeric-base-36bq0n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/partition-array-into-k-subsets-to-minimize-maximum-subset-t9wwmd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-anagrams-of-a-string-in-a-matrix-52iwzn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/spiral-level-order-traversal-of-a-binary-tree-nycle0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-the-5th-largest-number-among-two-million-numbers-au6evg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/delete-a-node-in-a-doubly-linked-list-given-its-pointer-8brabi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/heap-data-structure-use-cases-and-heap-sort-zuexh1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/convert-a-number-into-words-4keyt0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/minimum-operations-to-convert-all-zero-array-to-target-array-h4zauy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-unique-pairs-in-array-with-target-sum-maeq4z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/count-empty-cells-after-row-and-column-operations-ovcga9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/first-and-last-occurrences-of-x-wbhj04</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/rearrange-array-in-alternating-positive-and-negative-items-0nwdr6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/delete-k-nodes-of-minimum-depth-in-a-binary-tree-l4o8ve</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/longest-substrings-without-repeating-characters-54fkb2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/implement-alt-tab-window-switching-eg50c2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/count-minimum-swaps-to-make-string-palindrome-5f0zbu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/detect-loop-in-linked-list-without-extra-space-5elmu8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/double-zeros-and-shift-elements-in-array-4i7l4l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-element-in-rotated-sorted-array-1uxl6g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/check-name-repetition-eiif5i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/count-numbers-and-characters-in-a-string-8u9fbq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-pairs-that-add-up-to-target-0q35fa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/reverse-bits-of-an-unsigned-char-variable-ftz9t4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/set-a-specific-bit-in-a-number-n4doyk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/lowest-common-ancestor-in-a-binary-tree-with-parent-pointers-lgsp5l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/grid-paths-from-bottom-left-to-top-right-0ews38</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/pattern-creation-with-upper-and-lower-triangles-btpx88</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/transaction-table-sql-query-twyg4k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/oop-concepts-in-python-zll9j4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/racers-grouping-problem-0javwi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/max-1s-in-sorted-matrix-8afyn7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/binary-tree-360-view-5qov86</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/pair-and-triplet-sum-3430ww</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/calculate-total-salaries-of-delivery-persons-based-on-r2xyad</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/minimum-poles-for-greenhouse-plant-cover-y5bknz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/remove-repeated-characters-from-a-given-string-jow01u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/smallest-and-second-smallest-elements-in-the-array-2jjggv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/explain-public-static-void-main-in-java-2uyfr5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/print-subarray-with-the-largest-sum-dzg55y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/swapping-two-numbers-ujc3fz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/k-th-largest-element-in-unsorted-array-fho40h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/count-vowels-in-a-sentence-sjhtd5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/count-words-with-special-symbols-p1dt0z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/prime-numbers-using-sieve-df710f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/subarrays-with-k-different-integers-d3fvd5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/minimum-jumps-in-2d-plane-j32rb6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/valid-words-in-symbol-matrix-oqz8d4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/minimum-stolen-jewels-7dne04</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/count-total-valid-next-chess-moves-on-an-n-m-board-s8l98a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/count-valid-strings-with-matching-first-and-last-characters-1u614n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/find-the-first-pair-of-elements-in-an-array-with-sum-equal-5qwqv7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/solve-josephus-problem-using-a-data-structure-1llg91</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/find-characters-appearing-exactly-once-without-using-a-map-7lp231</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/find-kth-smallest-element-using-multiple-data-structures-8fs9fh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/count-maximum-points-on-the-same-line-cjler2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/minimum-operations-to-transform-string-a-to-string-b-sgkpu7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/count-numbers-in-range-l-r-whose-sum-of-digits-is-prime-lu6s3n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/maximum-bipartite-matching-of-children-to-liked-toys-5u4bu9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/count-unique-elements-in-every-sliding-window-of-size-k-36c2i9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/tree-traversal-alternating-pairs-of-levels-left-to-right-and-43u7xz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/implement-tower-of-hanoi-54yl4w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/implement-a-stack-using-queue-6rrao8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/print-matrix-in-spiral-order-recursively-12hwzm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/validate-parentheses-in-a-string-containing-letters-opu4n8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/simulate-betting-game-with-doubling-losses-and-reset-wins-z4eztw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-contiguous-subarray-with-sum-equal-to-zero-i6t005</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/duplicate-each-node-as-its-leftmost-child-in-generic-tree-i9ua8g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/time-complexity-of-n-queens-problem-3c5b6b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/merge-overlapping-time-intervals-yz1b8w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/determine-if-a-binary-tree-is-height-balanced-o19mlr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-anagrams-of-a-word-in-a-file-poz11z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-two-words-are-anagrams-and-support-unicode-dxw3cr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/rotate-an-array-clockwise-n-times-rze2rh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/count-pairs-x-y-such-that-x-y-y-x-f4iim5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-missing-number-in-an-arithmetic-progression-in-o-log-n-ih0bw9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/reverse-sorted-inorder-traversal-of-bst-with-constraints-67q1g9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/matrix-path-from-0-0-to-m-n-moving-only-right-and-down-k17yji</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/implement-a-min-stack-with-o-1-operations-zpz3cr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-duplicate-occurrences-in-a-telephone-directory-5gbifg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/lexicographically-smallest-string-by-removing-at-most-one-d8t5pf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-entry-with-highest-priority-from-linked-tables-3he2f1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/search-for-a-word-using-trie-c8aqw7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/calculate-number-of-students-unable-to-get-desired-6ubzov</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-longest-common-substring-202uu3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-tree-diameter-and-distance-between-two-tree-nodes-7u3cfj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-largest-cross-or-plus-sign-in-a-matrix-70qnrd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximize-array-sum-with-adjacent-multiplication-rules-dn6z1s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/code-backend-for-excel-cell-formulas-resolution-sq1knl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/rotate-matrix-90-degrees-anti-clockwise-a6pjqr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/convert-string-to-binary-tree-and-find-largest-root-to-leaf-cb03gt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-first-duplicate-element-in-a-string-qzu8hl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/explain-oops-concept-and-difference-between-data-hiding-and-mvc7ko</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/binary-search-bubble-sort-and-linked-lists-vs-arrays-whhbo7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/longest-path-in-matrix-morris-traversal-max-number-by-pmb6xd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/bst-check-string-decryption-max-number-after-deleting-k-zsl3lh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/text-justification-majority-element-max-leaf-to-leaf-path-onoo23</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/identify-student-s-bench-in-a-classroom-sokdo3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/insert-element-at-bottom-of-stack-and-find-lca-in-binary-2bov4w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/design-frontmiddleback-queue-jc40ly</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/music-player-shuffle-with-cooldown-lu2rl6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/string-encoding-iterator-and-genetic-relationship-checker-j10o7x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/island-maximum-area-and-continent-lake-analysis-v4pr11</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/linked-list-loop-detection-os-concepts-and-box-puzzle-7wuxje</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/maximum-subarray-sum-optimization-42bbn6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/rearrange-array-in-alternating-increasing-decreasing-order-2o131c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/meeting-time-of-two-circular-runners-f1q875</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-clicks-to-navigate-channel-array-on-remote-k9mk4i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-stack-using-arraylist-yi5b77</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/find-element-repeated-thrice-in-sorted-array-2cg4c5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/find-row-with-maximum-1s-in-sorted-boolean-matrix-aq9vxu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/reverse-doubly-linked-list-in-groups-of-given-size-ns493a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/print-hello-world-without-semicolon-2qb5ev</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/swap-two-numbers-without-third-variable-sc7s8m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/boundary-traversal-of-binary-tree-p63739</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-string-permutations-by-placing-spaces-wfn362</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-character-ordering-in-alien-language-dictionary-fjs0hh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-millions-of-people-by-age-jay1pv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-closest-1-million-stars-to-the-sun-spr0rq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/distance-between-two-keys-in-binary-tree-yz6dfv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/word-transformation-via-valid-dictionary-words-jhv1ds</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-minimum-depth-of-a-binary-tree-iwyc1c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/maximum-sum-with-no-two-elements-adjacent-qp8eze</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-deletions-so-array-min-is-at-least-twice-max-19pnba</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-product-of-two-numbers-with-minimized-comparisons-86agv5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/code-and-optimize-a-circular-buffer-7ihkzj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/last-system-destroyed-by-virus-in-ring-network-j5q4y9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/minimum-straight-lines-to-cover-all-2d-coordinates-57rtd2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/next-5-digit-palindrome-number-oki925</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/matrix-maze-problem-count-ways-to-destination-kwm5hy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/consecutive-integer-sets-summing-to-n-3esnvx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/convert-decimal-number-to-roman-number-sa9tmv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/swap-numbers-function-with-specific-mapping-q1t2ax</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/check-string-abbreviation-equivalence-yo0h1d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/bst-traversals-and-key-search-rc7dxy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/string-permutations-and-prime-numbers-w8kpa8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/sql-and-oops-fundamentals-kgog36</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sql-queries-and-dynamic-linked-lists-lng4ts</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/deadlocks-and-banker-s-algorithm-q011q9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-character-occurrences-in-string-4ixudw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/add-two-numbers-represented-by-two-arrays-5jlr5x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/find-level-with-maximum-sum-in-binary-tree-2ggo41</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/infix-expression-evaluation-and-database-schema-design-g7z2cv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/banker-s-algorithm-for-deadlock-avoidance-6yjkz2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/shortest-path-and-reverse-linked-list-in-pairs-4ch89l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/java-multithreading-and-os-process-synchronization-oi049a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-adjacent-word-pairs-in-string-y0jng4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/generate-alternate-binary-and-alphabet-strings-bfhb9j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/check-overflow-in-addition-cujk2x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/delete-nodes-greater-than-x-in-linked-list-ye9svk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/shortest-source-to-destination-path-in-maze-0dr79o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/count-reachable-array-elements-via-addition-and-subtraction-86o3oc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/sort-array-of-0s-1s-and-2s-in-single-traversal-haa23x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/paint-and-unpaint-nodes-in-binary-tree-l458cj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/hotel-room-allocation-optimization-euxo7p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/count-mismatches-between-two-binary-strings-uwqe1i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-the-nth-good-number-469nls</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/check-if-one-array-is-a-rotated-version-of-another-f68inx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/extract-valid-email-addresses-from-a-string-c4tmmz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/bulls-and-cows-4-digit-code-guessing-algorithm-k1yg51</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/maximize-alternating-partition-sum-wwto38</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/largest-prime-formed-by-subsequence-of-a-binary-string-96kmhr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/find-intersection-point-of-two-linked-lists-jvwoh6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-steps-to-transform-a-4-digit-number-avoiding-kmh02e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/construct-a-tree-and-print-level-wise-strings-nb990v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/print-a-right-angled-numeric-pattern-0g752h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/swap-two-numbers-using-three-different-methods-tn5f1t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/sub-sequences-of-a-string-in-ascending-order-o6ib07</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/shift-all-zeros-to-the-end-1a7whm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/delete-repetitive-occurrences-in-a-linked-list-l1xgcr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/breadth-first-search-in-a-graph-l5uvp2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/determine-error-location-in-code-without-line-numbers-tkqu7g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/find-repeated-letter-in-a-string-ps44un</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/spiral-matrix-traversal-from-pivot-pdxn0i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/remove-n-digits-for-lowest-number-r2g9ma</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/replace-spaces-with-20-07fx5k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/top-10-stocks-stream-cfxaz1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/maximum-movies-8auvnp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/bank-robbery-optimization-a3bohw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/find-unique-element-0s3mc7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-first-index-of-a-special-substring-of-length-k-7biehz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/real-life-applications-of-dp-and-greedy-algorithms-and-monty-kly3mo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/three-coding-problems-lca-in-binary-tree-reverse-linked-list-43vfkh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/largest-contiguous-subarray-sum-tbr66v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-number-of-employees-under-every-manager-95og42</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/zigzag-level-order-traversal-of-binary-tree-gru8c3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/generate-target-number-using-multiply-by-3-or-add-5-tq5qwi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/maximum-sum-path-from-root-to-leaf-n5opdu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/count-occurrences-of-word-in-sentence-yq29on</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/calculate-polygon-perimeter-from-side-lengths-2w4tk3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/check-if-list-1-is-a-subset-of-list-2-4az6aw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/students-with-consistent-scores-lm9enx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/rooms-occupied-on-monday-morning-6znpfg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/print-odd-numbers-in-reverse-and-calculate-sum-thsv4p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/knapsack-problem-ieey7p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/find-first-occurrence-of-elements-in-an-array-x4415o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/balanced-parentheses-with-single-type-of-bracket-no6dqe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/debug-code-involving-multilevel-inheritance-txp5oy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/unique-number-of-occurrences-hzzib9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/word-break-problem-wn75j6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-path-between-two-nodes-in-a-binary-tree-zq1gcp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/alternate-primes-till-n-26asrz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/sieve-of-eratosthenes-wfnq46</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/check-if-an-array-of-strings-is-circular-in-nature-2x907w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/left-join-and-count-matching-records-between-two-tables-10qqiz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/reverse-linked-list-without-changing-links-i3quu4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/k-th-largest-element-using-bst-udtz45</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-whitespaces-and-special-characters-4xfsi2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/sort-list-by-frequency-of-elements-0s7fou</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-vowels-and-whitespaces-in-string-zmz6kc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-largest-number-in-array-o2fdyj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/candies-distribution-problem-uv7dr3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/water-trapping-problem-c07adi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/maximize-adjacent-land-purchases-within-budget-83ns6p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/form-minimum-number-from-given-sequence-za7pbd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-local-minima-in-array-uerrs7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/check-if-string-is-k-palindrome-uztwv5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/split-even-length-words-from-middle-n0mceu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/combination-sum-variation-xg6qf4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/min-stack-in-o-1-k1g33h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/maximize-consecutive-1s-g2p6g5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/data-structure-for-versioning-lggyp1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/stack-and-queue-in-1d-array-wk5cdi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/bfs-vs-dfs-5uyu71</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sorting-and-searching-p3qxmh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/min-cost-path-4juf3v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/rod-cutting-r9ibgj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/sudoku-game-problem-w60r4g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/factorial-of-a-big-number-g1c0py</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/egg-dropping-puzzle-and-generalization-6e1gun</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/water-jug-problem-condition-check-upp92t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/maximum-difference-between-two-array-elements-rjzhr4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/determine-number-of-friend-circles-from-matrix-6k8qvq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/three-sum-problem-qt6no6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/maximum-path-sum-from-a-binary-search-tree-t688ws</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-duplicate-numbers-in-an-array-in-o-1-space-qgx412</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-square-sub-matrix-with-maximum-sum-oxv3kb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/sort-array-elements-based-on-dictionary-order-mgw3c5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/count-word-frequency-in-paragraph-18ql3y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-two-numbers-with-sum-closest-to-n-p8bj7z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/merge-array-of-size-n-into-array-of-size-m-n-b053jr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/check-character-subsequence-order-in-text-9hydax</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-the-missing-number-in-array-from-1-to-n-kn36bz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/maximum-profit-from-stock-trading-with-at-most-k-zq79kg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/flatten-a-multilevel-linked-list-level-by-level-2ujvc0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/smallest-number-with-given-digit-sum-and-sum-of-squares-jmway0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/max-absolute-difference-between-nearest-left-and-right-dm1a50</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/minimum-platforms-needed-for-train-schedule-vh3ign</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/count-frequency-of-each-character-in-a-string-mf1suk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/sql-query-to-find-employee-with-highest-salary-enjg2a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/square-root-of-a-number-using-binary-search-9ivv9e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/rearrange-array-elements-such-that-a-i-i-irqo7z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/connect-left-nodes-of-a-binary-tree-to-immediate-right-iss5m7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/approach-to-solve-n-queens-problem-7lvtnj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-elements-to-reach-target-sum-lpcar3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-matrix-in-zig-zag-order-lb0fqp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/convert-series-of-strings-to-integer-ops0ng</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/maximum-sum-non-adjacent-subsequence-y4osj8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/move-all-zeroes-to-end-of-array-while-maintaining-relative-7kqghe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/rearrange-array-into-alternating-negative-and-non-negative-7fxpld</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-even-length-contiguous-subarrays-with-equal-left-and-89yutx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/largest-sub-square-matrix-containing-all-1s-nghm58</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/reverse-a-linked-list-in-groups-of-size-k-pgdt6x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/range-update-and-range-sum-queries-on-an-array-ssaf94</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/lexicographically-greatest-string-represented-as-linked-ru9l6q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/count-elements-that-are-greater-than-all-elements-to-their-xhr7mc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/fetch-data-from-two-apis-and-store-into-database-table-dd4bfp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/print-inverted-and-right-angled-triangles-using-asterisks-bpf6tq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/write-an-inner-join-query-in-sql-vfe9rt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-the-third-largest-distinct-element-in-an-array-l5ocwz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/count-number-of-instances-created-for-a-class-8b3ewl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/explain-and-implement-favorite-algorithm-graph-traversals-ad1uij</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/calculate-employee-salary-per-department-mjqtv0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/maximum-distance-to-closest-occupied-seat-ctkm4e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/convert-string-to-palindrome-containing-given-substring-f4twfh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/count-occurrences-of-one-string-in-another-nhd76u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/macro-to-set-or-unset-a-bit-at-position-k-k9nrfd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/implement-custom-memcpy-handling-corner-cases-96tnpc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/swap-two-variables-without-using-a-third-variable-hutr5y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/extract-k-bits-given-position-and-number-0rc7tq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/delete-all-nodes-with-target-value-in-linked-list-y5w21s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/construct-bst-from-sorted-array-with-shortest-height-41g94w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-precedence-of-characters-from-alien-dictionary-zdpk4e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/distribute-k-people-on-n-stalls-farthest-apart-ljhn8r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/paint-house-minimum-cost-with-no-adjacent-same-colors-gm0d4j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/create-an-immutable-stack-with-space-optimization-kgs1q8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/count-numbers-of-length-n-on-numeric-keypad-with-valid-moves-qz4j9r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-teams-for-group-photo-under-height-constraints-60hht9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-median-in-a-stream-of-running-integers-x3bjbs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/largest-number-divisible-by-3-from-array-of-digits-0-9-lgmg8s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/singleton-linked-list-and-array-sorting-0p1hcd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/array-transformation-by-character-index-4ofbac</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/dsa-and-computer-fundamentals-interview-0onsai</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/count-pairs-with-difference-equal-to-k-za8s1t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/maximum-sum-of-node-values-in-connected-components-t6gl73</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/n-queens-problem-ohudx5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/kth-smallest-and-largest-in-bst-4iilit</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/number-of-handshakes-m57b0r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/convert-decimal-number-to-hexadecimal-q39blu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/count-word-occurrences-and-sort-by-frequency-t9qkws</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/check-if-array-can-be-split-into-identical-halves-cj5gyh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/kth-largest-element-after-pairwise-absolute-difference-13mkmj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/product-of-minimum-k-numbers-in-an-array-47dt2g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-number-of-islands-in-a-2d-array-0fd87g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/optum-unitedhealth-group/display-middle-character-or-characters-of-a-string-hdr3xe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/print-pairs-of-anagrams-in-an-array-of-strings-r98nhk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/digits-whose-alphabetic-representations-are-jumbled-in-a-a5j6sy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/remove-zero-sum-consecutive-nodes-from-linked-list-0trusd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/date-range-with-maximum-visitors-using-spark-g5y7j3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/nth-highest-salary-department-wise-d5m210</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/nearest-palindrome-number-with-minimum-absolute-difference-2pgxwn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/longest-palindromic-substring-with-constant-extra-space-08szo3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/servicenow/first-and-last-index-of-an-element-in-a-sorted-array-2pbuig</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/maximum-sum-of-non-adjacent-elements-in-a-circular-array-croro5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/determine-firing-direction-for-tanks-without-hitting-qc6uny</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/implement-build-heap-and-analyze-its-time-complexity-hj29q0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-the-k-largest-elements-in-an-array-43560c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/design-a-data-structure-with-o-1-insert-delete-and-getrandom-t849yp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/remove-duplicates-from-an-array-in-java-hn3bc4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/remove-a-given-character-from-a-string-bo3d8c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-umbrellas-to-cover-people-8m2zs2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/spiral-traversal-pseudo-code-c5ujgn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/write-database-queries-for-duplication-and-merging-kv65ak</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/find-median-of-incoming-integer-stream-lr7cio</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/find-top-k-repeating-elements-in-a-file-fc9wlu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/convert-string-entuet-to-intuit-v8a5jw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/list-repeated-keywords-from-a-file-in-descending-order-2zz6kv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/path-and-minimum-moves-in-a-grid-with-obstacles-is083s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/zig-zag-print-of-binary-tree-nodes-by-horizontal-distance-gj0b88</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/n-queens-problem-variation-k1lqci</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/heap-sort-variation-j0tgbb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/dutch-national-flag-zn7trg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/string-rotation-b0y41d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/max-path-value-in-graph-vux6jx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/kmp-algorithm-027d7a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/subset-sum-oq1hto</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/stack-using-queue-5kdqo2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/bfs-on-2d-array-1sxlgq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/dijkstra-s-algorithm-g7omte</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/ceiling-and-floor-in-sorted-array-6uzmf7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-indices-where-left-sum-equals-right-sum-y2oy80</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-palindrome-excluding-vowels-with-no-extra-space-7a3frq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-value-in-every-window-of-size-k-chc3ny</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/preorder-traversal-without-recursion-parb3b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/lexicographical-ordering-of-strings-x25tuo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/minimum-steps-to-climb-a-staircase-t3wgy0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-length-subarray-with-sum-x-s0vox0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-strings-with-prefix-x-6t6w9m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-k-closest-dates-to-a-given-temperature-rte2hh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/closest-number-to-n-divisible-by-m-e1p647</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/evaluate-binary-logic-string-strictly-left-to-right-bxr8al</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/shortest-root-to-leaf-path-matching-target-sum-awfiy1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-product-subarray-krl0w4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/populate-next-right-pointers-in-a-binary-tree-b5odjj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-lru-cache-with-custom-lookup-signatures-l4k5fy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/flipkart-employee-cab-system-ppfto2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/numpy-and-pandas-functionalities-d54iyq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/project-review-and-technical-skills-discussion-x5pcun</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-max-frequency-element-loopless-counting-and-sorting-567h14</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/bottom-view-of-binary-tree-lps-and-house-robber-s3f91c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/carries-during-addition-triplets-with-product-m-and-array-lgzsk6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/compare-two-strings-based-on-an-arbitrary-alphabet-order-32o5nm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/bubble-breaker-hint-function-and-sudoku-solver-1n23hj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/nth-node-from-the-end-in-a-linked-list-e4to4k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/custom-letter-value-sum-and-excel-column-name-6uj6ta</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/sql-vs-nosql-and-sql-queries-66xlp0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/lca-in-a-binary-tree-with-parent-pointers-9xrb7x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/level-order-traversal-of-a-binary-tree-np1zic</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/count-substrings-starting-and-ending-with-1-v5e5xh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/print-all-combinations-of-a-number-mapping-hn4i9d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/string-compression-algorithm-pie3rv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/binary-search-and-stack-problems-6yghqg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/permutation-of-pattern-in-string-lsmt1g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/smallest-non-negative-integer-not-in-array-707jsk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/max-path-in-grid-h7qyo4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/nearest-pantry-in-grid-kc04cx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/split-string-by-delimiter-1au3bd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/implement-lfu-cache-487uxi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/snake-and-ladder-minimum-rolls-mgm7r4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/populate-binary-tree-coordinates-ur4hw7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/bfs-traversal-on-a-matrix-660g8a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/minimum-changes-for-number-equality-2ap5x7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/frequent-characters-in-string-s377c9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/fibonacci-series-using-recursion-d4yhp5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/depth-of-binary-tree-yq7q9i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/sorting-method-implementation-and-comparison-gul0pt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/sql-query-for-highest-id-gilj8r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/insert-array-elements-into-bst-wj3mga</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/print-unique-numbers-in-a-large-number-stream-0y45iq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/word-frequency-in-a-paragraph-gjfzn6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/producer-consumer-problem-using-threads-7r638t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-two-non-repeating-numbers-in-an-array-75kwb4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/clone-a-linked-list-with-next-and-arbitrary-pointers-rjg6hu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/vertical-level-order-traversal-of-a-tree-hag659</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-the-merging-point-of-two-linked-lists-7mld1r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/generate-all-possible-n-pairs-of-balanced-parentheses-6c1c5n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/bfs-and-dfs-data-structures-p418mh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/basic-programming-challenges-vwq19q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/technical-round-1-problems-f4gnq5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/pillow-passing-game-winner-o5zv43</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/rearrange-alphanumeric-string-without-adjacent-duplicates-50j372</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/generate-pascal-s-triangle-and-basic-array-linked-list-htoei0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-diameter-of-a-tree-given-parent-child-relationships-1jc17n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-path-with-consecutive-increasing-integers-in-n-ary-60v26t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-next-right-element-in-tree-tl72iz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-all-possible-distinct-sums-in-a-binary-tree-5vl5az</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-sum-rectangle-in-a-2d-matrix-6ewnks</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-tree-a-contains-tree-b-with-matching-orientation-mio0uh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/calculate-expression-sum-from-embedded-word-string-bir7ev</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/perfect-cube-roots-count-zi8ehm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/non-repeatable-characters-yo2xn3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/ds-and-algo-problems-zl6rio</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/versioned-stack-design-co6kb4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/lexicographical-string-reduction-8ipf9c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/pendulum-array-arrangement-ag0r1o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/mountain-subarray-and-range-addition-vv4teh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/advanced-ds-and-algo-problems-pnvl9o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/design-a-buffer-with-specific-operations-aq17cv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/replace-array-elements-with-their-ranks-7hdrfw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/coding-assessment-problems-38z724</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-distance-of-all-pairs-of-points-epr6d6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/mean-median-and-mode-of-an-array-p8krjg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/alternate-nodes-in-boundary-traversal-d7icf2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-number-of-squares-summing-to-n-2bgu33</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/search-in-row-wise-and-column-wise-sorted-2d-array-223zq7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/nearest-multiple-fn47bq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/sort-a-2d-matrix-by-row-iul226</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/implement-quick-sort-on-paper-o8zsz2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/static-methods-in-java-5r3gga</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/maximum-height-of-new-towers-cwcd0w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/count-triplets-forming-a-triangle-9l84xb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/length-of-largest-region-of-1s-92kjn9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/reverse-only-the-nodes-at-odd-positions-in-a-linked-list-0okr94</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/topological-sorting-in-a-directed-graph-5gnwog</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/generate-coupons-from-large-csv-file-hj38g5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-nearest-mechanic-zqjx5l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/array-and-string-coding-problems-njlai2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/mirror-of-a-binary-tree-algorithm-h9kb7w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/count-character-types-in-string-0jwks2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/dictionary-from-lists-n3zpzg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/remove-duplicates-from-list-nhd42a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/linked-list-operations-dk0vr7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-indices-in-sorted-arrays-h9w2wp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/rotten-tomatoes-50ang6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/anagram-check-nc3059</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/word-replacement-in-paragraph-eaier6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/character-frequency-8bx52n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pair-product-from-sorted-arrays-frn9fc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-number-of-cycles-in-a-directed-graph-5go3cp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/print-nodes-in-a-zig-zag-form-of-a-given-binary-tree-hl55ke</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-postorder-traversal-from-preorder-and-inorder-ppq8lr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/compare-old-and-new-library-catalogs-for-position-changes-b2a86v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/determine-monotonicity-pattern-of-an-array-the3nq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/find-duplicate-element-in-an-array-vigw6v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/spiral-level-order-traversal-and-median-in-a-stream-5jz9lb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/maximum-tree-height-with-divisor-nodes-and-array-partition-0o1pt3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/inorder-traversal-graph-traversal-and-parenthesis-validation-ms6y97</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/sum-of-odd-numbers-in-range-13pi5j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/detect-and-remove-loop-in-linked-list-mwxpr1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-duplicate-substrings-hxot30</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/insert-element-in-linked-list-qf46ge</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/evaluate-division-expressions-using-given-relations-keg614</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-cost-for-house-repairs-3zrkcr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-all-common-subtrees-i3ry7r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/chocolate-distribution-based-on-age-514xkz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/smallest-number-with-digits-0-and-9-divisible-by-n-yi7qud</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/minimum-number-of-jumps-to-reach-end-a08a3d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/generate-binary-numbers-from-1-to-n-1np2r2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-pair-to-swap-to-make-two-array-sums-equal-kva327</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/set-or-unset-the-kth-bit-of-a-number-4www87</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/check-if-s2-is-a-substring-of-s1-007kok</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/remove-duplicates-from-an-unsorted-singly-linked-list-t63at1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/print-all-triplets-with-sum-equal-to-k-0x71ts</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/in-place-string-compression-run-length-encoding-c19ai1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/lca-and-distance-calculations-between-nodes-ohv7sh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/string-matching-and-sliding-window-search-wdg7jy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/maximum-sum-rectangle-in-a-2d-array-na9jzj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/apply-dfs-on-a-graph-732pkf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/largest-sinusoidal-sequence-in-an-array-bwa0hf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/smallest-substring-containing-all-alphabets-aocb28</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/insertion-and-deletion-in-a-bst-nvkq9c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/modify-linked-list-with-max-value-pointer-to-the-right-9l1iuu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/job-scheduling-algorithm-0f6h9x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/convert-palindromic-string-to-non-palindromic-pgqv32</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/divide-n-in-k-groups-incrementally-gjzr0e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/check-if-linked-list-is-palindromic-mbed3b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/delete-node-from-linked-list-without-head-pointer-5mwy5a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/custom-data-structure-with-o-1-add-remove-and-o-n-getall-j2b9d6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/technical-concepts-in-c-and-java-t8nilt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/count-characters-in-a-string-ag2yrt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/sql-string-manipulation-h04rz2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/sql-concepts-and-queries-jn8xeu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/mixed-fraction-to-improper-fraction-conversion-2bourt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/calculate-total-mean-normalized-scores-for-student-marks-knz53g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/filter-and-aggregate-international-event-participants-9egrlv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/reverse-a-string-without-built-in-function-in-java-i3s7gr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/maximum-subarray-sum-using-kadane-s-algorithm-psn9gz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/smallest-square-submatrix-with-target-sum-8tgtfn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/subsequence-of-given-size-with-target-sum-yn5nof</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/median-of-two-sorted-arrays-of-same-size-5wrqjd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/check-if-a-number-is-power-of-2-using-bitwise-operators-6mgj89</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/searching-in-a-matrix-sorted-by-row-33coms</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/remove-consecutive-characters-in-a-string-08en2w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/stack-operations-sequence-gt0hcb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/reverse-a-singly-linked-list-9svstq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-the-missing-number-in-the-array-and-binary-search-c8jzzx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/print-odd-numbers-first-then-even-numbers-from-an-array-n1wlsl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/basic-programming-and-oop-concepts-24crnr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/index-of-maximum-element-after-rotations-qh0wxa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/minimum-coin-exchange-problem-pkkwv3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/check-if-a-sequence-of-moves-for-a-robot-is-circular-1130oi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/pairs-with-product-less-than-or-equal-to-a-value-in-o-n-dxxxc7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/replace-all-0-s-with-5-s-without-extra-space-8mo2tn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/move-all-zeroes-to-the-end-of-the-array-t49jxe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-subarray-of-size-k-with-mean-equal-to-m-hl6eg4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/generate-all-clockwise-cyclic-permutations-of-a-string-cu43wm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-all-nodes-bounded-by-boundary-traversal-of-a-binary-n1j7ni</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-the-pivot-element-in-a-rotated-sorted-array-in-o-log-n-e92wr6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/two-sum-problem-using-hash-tables-4cw73k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/next-smallest-palindrome-larger-than-given-number-21z40y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/power-function-in-o-log-n-l4mkh7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-all-duplicate-elements-in-an-array-a50m75</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/identify-sequence-type-and-find-next-term-9bngtm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/top-10-users-by-button-press-count-up1ryb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/lfu-cache-implementation-an576n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/sort-array-to-maximize-query-sums-5ey0i4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/print-linked-list-with-down-and-next-pointers-l19doz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/print-all-nodes-at-a-given-distance-in-a-tree-afgz8c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/flight-travel-feasibility-using-bfs-6oex96</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/k-th-smallest-largest-element-in-unsorted-array-ezi6hj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/construct-full-binary-tree-from-preorder-and-postorder-byimq4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/maximum-diameter-of-a-binary-tree-hotxn3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/sum-of-digits-and-max-path-sum-i9c6hw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/group-anagrams-and-search-2d-matrix-dcb1fx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/vertex-cover-and-queue-implementation-xcg2r3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-path-between-two-nodes-in-a-bst-6a9n4f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/heapify-an-array-c2xiq4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/min-modifications-to-sort-array-kpok19</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/design-data-structure-with-o-1-insert-delete-search-7pmpew</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-k-frequent-words-in-huge-file-ts2zjf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-index-of-distortion-in-sorted-array-yrk7w4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/first-non-repeated-character-in-character-stream-g8iv32</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/island-problem-in-mxn-matrix-8mfjgv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/check-if-one-tree-is-a-mirror-of-another-8jqbd9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/water-in-3-jars-puzzle-wxfpg7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/build-your-own-hash-table-and-collision-resolution-4c77t7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/help-n-people-cross-a-bridge-puzzle-j8ef7v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/9-balls-puzzle-v2hsiz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/key-and-lock-problem-51mm77</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/longest-sub-string-with-all-distinct-characters-ivi8ke</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-all-common-elements-in-3-sorted-arrays-cpxlh6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/print-given-matrix-in-a-spiral-form-7wa7us</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/print-a-specific-number-pattern-for-n-lzj8v3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/inplace-rotate-square-matrix-by-90-degrees-bdu8l5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/maximum-size-sub-matrix-with-all-1s-in-a-binary-matrix-r9qa0s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/program-to-find-lcm-of-two-numbers-bng69g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/fibonacci-series-recursive-and-iterative-g4j2wy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/implement-a-heap-data-structure-and-heapify-v18w75</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/print-fibonacci-sequence-in-c-rbe7mi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/zeros-partitioning-in-o-n-and-o-1-space-9nrjjk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/max-subarray-sum-of-k-elements-sc7hs7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/polymorphism-output-prediction-8s0mbo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/remove-palindromic-substrings-repeatedly-w68w1e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-swaps-using-selection-sort-g24t01</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/technical-problem-solving-f7q1kq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/find-missing-number-in-an-ap-in-o-logn-time-tz0jpv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/print-non-boundary-elements-of-a-binary-tree-illdr1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/sort-a-linked-list-and-find-the-middle-node-mj8tkj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/minimum-jumps-in-2d-grid-from-s-to-r-with-fixed-jump-size-hao6j7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/determine-number-of-stolen-jewels-from-range-and-array-17qt1a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/intuit/lexicographically-smallest-line-of-tanks-maximizing-distinct-gpy74f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-the-leader-in-an-array-2g41xn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/count-ways-to-cover-a-distance-v97imd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/bubble-sort-logic-3ru48e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/rotation-of-a-1d-array-0jetqt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/factorial-of-a-number-using-recursion-hx4595</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/find-nth-fibonacci-number-using-recursion-6uh0nw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-number-of-distinct-years-in-a-paragraph-b5j3ie</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/reverse-a-sentence-and-check-equality-kh6lnx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/compile-time-vs-run-time-polymorphism-in-java-81mvke</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-two-missing-elements-in-range-1-to-n-yztg0k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-the-single-missing-element-in-array-oflq79</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/compute-p-k-efficiently-k3v9va</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/express-n-as-sum-of-consecutive-natural-numbers-5qj7ch</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/check-if-string-consists-only-of-y-poz2ud</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/minimum-length-circular-substring-to-form-target-string-ff1e3r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/decode-string-using-26-character-index-mapping-ivf64r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/zig-zag-traversal-of-tree-cc8anb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/merge-two-sorted-linked-lists-without-extra-space-luwd0w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/reverse-linked-list-using-recursion-pcsnj7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/fibonacci-min-jumps-e88z5o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/merge-sorted-intervals-y73l4b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-fourth-point-of-parallelogram-uw4u3i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-minimum-element-in-unsorted-circular-linked-list-m7p3sw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/implement-forward-and-backward-browser-buttons-3erd8o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/check-if-binary-tree-is-subtree-of-another-mwgum6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/check-if-number-is-perfect-square-0xjc9n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/pattern-matching-using-regex-fi7983</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/smallest-common-substring-pairs-i1lzgo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/minimum-cost-to-reach-position-n-with-jumps-g0wroa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/convert-unordered-set-to-ordered-set-without-sorting-51sasv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-repeating-number-in-sorted-array-ua9a0u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/validate-bst-from-level-order-traversal-kim74z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/decode-string-to-alphabets-kook5n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/detect-duplicates-in-array-6tzupu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/atm-minimum-note-dispenser-7jasym</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/extract-endpoints-from-swagger-file-36vb3i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/pizza-price-optimization-141jy1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/minimum-time-to-color-pencils-ou8ka9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/minimum-toggles-for-grid-of-bulbs-6t2xs6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/distinct-strings-after-rotation-ruhsk1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/pathfinding-with-cost-and-constraints-a40cvc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-palindrome-sub-strings-p94wj9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/print-prime-numbers-in-a-range-efficiently-kcq375</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/efficiently-reverse-a-linked-list-q0bljp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/maximize-electricity-power-load-from-different-company-1gk2ax</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/minimum-extra-charge-stops-to-reach-destination-distance-l0jriu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/reverse-a-string-recursively-5kv880</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/minimum-problems-to-solve-for-happiness-threshold-3fg70r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/evaluate-bracketed-arithmetic-expression-indices-on-array-stlpb6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/count-board-configurations-with-x-solved-characters-rujq2m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/sliding-tile-puzzle-transformation-a0czty</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/count-occurrences-of-pattern-in-character-array-i2u9dv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/find-triplet-summing-to-k-in-original-ascending-order-0lqjsm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/maximum-xor-using-k-numbers-from-1-to-n-r5gncz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-sum-of-squared-radii-covering-points-tjdj8p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/reverse-linked-list-and-find-k-max-elements-in-stream-eej6xd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/submatrix-with-at-most-k-zeros-kmu2li</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/sort-a-2d-array-9gbnrc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/array-versus-set-usage-in-real-life-scenarios-t72hsj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/range-threshold-query-with-index-updates-3b338o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/minimum-weight-bipartite-matching-for-point-sets-gm5x85</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/find-most-frequent-words-in-a-massive-log-file-q8j71h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-bit-flips-to-convert-integer-a-to-b-cy4g0t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-page-faults-in-lru-cache-management-15h9pl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/basic-string-and-linked-list-operations-ajnt0m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/game-of-choosing-pairs-with-non-existing-differences-1evnha</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/convert-string-to-all-vowels-using-prefix-shifts-ib33vy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/find-replaced-and-missing-number-in-consecutive-array-ec3k9b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/check-if-array-b-is-a-subarray-of-a-t5syr5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/find-the-missing-value-in-a-sorted-array-x9loh0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/reverse-bits-from-l-to-r-in-a-32-bit-integer-0p4lso</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-all-files-in-a-root-directory-structure-6m297y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/generate-a-mirror-image-of-a-tree-s3bjx7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-a-dictionary-ogq69w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/convert-a-tree-to-a-doubly-linked-list-2oz49m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/largest-increasing-subsequence-1rdvvd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/count-pairs-with-a-given-sum-zy1n7t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/count-prime-valued-substrings-from-a-large-string-oh99id</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/shortest-cyclic-subsequence-containing-all-pattern-3e8mkk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/find-city-with-maximum-distance-to-nearest-station-ea3gs1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-leaders-in-an-array-syx8qo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-length-of-common-suffix-and-prefix-7hzzxv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-parts-of-a-mathematical-expression-string-7htxf8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/length-of-longest-increasing-subsequence-path-in-2d-matrix-0l3mbd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/find-maximum-houses-in-a-village-in-a-binary-matrix-sic90i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/replace-each-element-with-leftmost-greater-frequency-element-w81ild</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/multiply-modified-3d-matrices-a6g5ws</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/rearrange-characters-in-a-string-without-adjacent-duplicates-ey9xd8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/find-maximum-length-word-chain-by-removing-characters-j29ipo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/divide-two-very-large-numbers-represented-as-linked-lists-3ovwcr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/xml-tag-intersecting-intervals-and-free-slot-size-suh7jr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/c-cpp-code-review-and-array-digit-addition-2gs6k1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/html-frontend-code-and-java-vs-c-comparison-ko1buo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/linked-list-intersection-and-array-triplet-sum-2tkgsh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/prime-number-check-and-circular-linked-list-implementation-w296ic</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximize-longest-time-period-without-presentations-by-bq9f2n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-of-a-i-a-j-where-i-j-1-4xfj97</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/search-for-an-element-in-a-complete-binary-tree-with-sorted-9qjnh3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/simple-recursive-sequence-xzhf5p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-path-to-the-end-of-a-maze-with-doors-and-walls-using-4pwn4u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-optimal-floor-in-parallel-building-to-minimize-wire-q3swmb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/check-if-a-binary-tree-is-a-binary-search-tree-isbst-to31wv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/construct-tree-and-print-inorder-traversal-v8walp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/replace-bst-node-values-with-sum-of-greater-nodes-92xe2h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/reverse-linked-list-between-two-node-values-qs3paj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-sum-path-in-matrix-from-bottom-right-to-top-left-37twrb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-median-from-two-sorted-arrays-lgmoe1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/vector-implementation-from-scratch-95s20w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reverse-k-nodes-in-linked-list-and-extract-first-letters-of-sn1oqu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-binary-tree-is-a-subtree-gl8tb2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/stock-market-range-minimum-query-using-segment-tree-755p1s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-moves-to-transport-items-with-bag-capacity-hvut97</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-initial-value-for-cumulative-sum-to-stay-positive-mbic3r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimize-the-maximum-difference-between-heights-uiut61</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/search-in-a-row-wise-and-column-wise-sorted-matrix-zg5inz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/largest-bst-subtree-sum-cpowb0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/maximize-sum-of-selected-numbers-njhbf6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-precedence-of-characters-in-a-sorted-dictionary-lgd09v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-top-10-elements-from-an-array-or-stream-d5ghg3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/smallest-number-from-digits-without-leading-zero-ps6ggv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/breadth-first-traversal-of-a-tree-djx90l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/parenthesis-checker-with-multiple-bracket-types-gcq6bj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/permutations-of-words-from-phone-digits-vfmn5k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/check-if-a-number-is-a-round-number-eg9faf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/merge-intersecting-intervals-with-xml-tags-m86ni0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-contiguous-free-slot-size-for-two-people-lxkw2p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/next-greater-frequency-element-8dh2kh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/find-the-size-of-the-largest-island-in-a-2-d-matrix-yjnrb1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/multiply-top-and-bottom-axes-of-two-3-d-matrices-aon9pt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/remove-transitive-relations-from-a-hashmap-au12tl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/evaluate-mathematical-expressions-from-string-m7shji</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/check-if-a-number-is-divisible-only-by-prime-numbers-3iqkmu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/calculate-minimum-distance-between-two-strings-in-a-ph8v8r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/compare-strings-in-two-files-using-exact-counts-8nsutu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/merge-multiple-sorted-lists-containing-duplicate-elements-65a6sy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/gas-station-problem-euy2mj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-combinations-from-a-sorted-array-that-add-up-to-n-l89u5o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/merge-two-sorted-arrays-into-the-second-array-k4qbso</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-first-100-prime-numbers-1o60sf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-strings-that-can-be-formed-by-combining-other-strings-g6ni62</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/implement-strstr-function-3emy2x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/convert-a-singly-linked-list-to-bst-y3g3h9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/design-a-timer-module-for-timeout-handling-0bcr0q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/join-two-linked-lists-gveo97</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/count-students-per-state-xx10wi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/path-finder-in-maze-project-questions-hh9n17</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/dijkstra-shortest-path-pseudo-code-zgad1t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/design-calculator-using-oop-concepts-2d1dux</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/delivery-partner-salary-and-distance-query-system-1jrrfc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/maximum-data-packets-transfer-in-a-computer-network-tree-nj6ru7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/implement-quick-sort-and-merge-sort-q90fdi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/kth-maximum-element-of-an-array-5z3s4z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/binary-search-implementation-and-variations-v27nze</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/maximum-moves-by-removing-coin-x-and-neighbors-x-1-x-1-75fvtw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/max-score-for-substring-starting-and-ending-with-same-letter-4h3yy4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/implement-a-queue-of-max-length-n-using-two-stacks-v1dtnc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/sql-query-with-join-group-by-and-where-vs-having-d24h84</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/generate-number-pattern-based-on-input-n-ayzti6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/nth-fibonacci-number-and-prime-numbers-c97x9y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/shortest-route-between-cities-with-k-edge-weight-65yw0i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/smallest-missing-positive-integer-in-an-array-6c5565</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-discount-from-non-consecutive-coupons-7uuehi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/design-array-shuffle-and-reset-operations-0ct0hz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/divide-array-into-two-subsequences-with-equal-average-jne4hu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-frequency-of-element-k-in-a-sorted-array-7932r2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-maximum-path-sum-in-a-binary-tree-68exq1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-three-elements-whose-sum-is-closest-to-x-5t4ah3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/number-of-subarrays-with-maximum-consecutive-ones-m2s7l7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-highest-five-flushes-in-a-custom-card-deck-8wvjwg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/change-delayed-clock-time-to-current-time-in-minimum-steps-nz19x7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/print-all-even-numbers-before-odd-numbers-in-an-array-1efvg4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/evaluate-power-and-modulo-expression-using-fast-power-134kyk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/lowest-common-ancestor-and-linked-list-reversal-87epge</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/check-if-singly-linked-list-is-palindrome-and-search-in-7ma4fp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/rotate-submatrix-clockwise-90-degrees-0vq4mv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-pair-with-sum-closest-to-target-z6laz0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/print-frequency-of-each-word-in-a-string-21zfmc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/maximize-remaining-day-time-by-arranging-event-slots-g8l5th</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/round-trip-gold-mine-problem-on-grid-pw8s4h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/find-missing-invoices-for-companies-9xeyse</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/end-to-end-request-handling-code-for-driver-location-ttgy2l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/javascript-login-form-code-q94bko</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/read-data-from-specific-chromebook-memory-address-q2suyi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/positive-difference-number-placement-game-39hnpv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/minimum-operations-to-include-all-vowels-in-string-feuhr7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/print-nth-element-of-a-given-series-9nrkuz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/clear-last-4-bits-in-a-single-line-06r356</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/find-three-numbers-where-sum-of-two-equals-the-third-yzl1ls</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/pass-by-value-vs-pass-by-reference-in-java-a3d406</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/shortest-path-to-print-a-string-on-screen-h3x4ux</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/maximize-consecutive-1s-by-flipping-zeroes-0wihr1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/zig-zag-level-order-traversal-spiral-form-7bifm3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-k-th-character-in-encoded-string-without-decoding-2jtdt5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/parse-socket-stream-data-with-http-header-and-delimiter-9lueph</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/rotate-linked-list-by-k-c3h085</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-best-flight-path-from-chennai-to-paris-13klla</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/football-match-scores-and-maximum-points-team-67x8aq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/minimize-cost-of-required-items-production-and-import-mm7ycr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-least-positive-missing-element-from-sorted-array-c4ak4k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-second-highest-element-from-array-dqf4x8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/determine-height-of-a-tree-e7lp1s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/josephus-problem-and-string-rearrangement-gr4h10</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/simple-login-form-javascript-code-2ymfe3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/generate-permutations-of-a-given-string-0pgxcc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/check-if-a-number-is-fibonacci-ez20ts</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/convert-number-to-binary-form-q6y6h9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/sum-of-other-numbers-in-comma-separated-string-50ia50</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/check-permutation-divisible-by-8-woqi4b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/string-compression-code-1tozo0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-all-palindromic-substrings-lvh7oc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/check-if-binary-tree-is-subtree-66txk8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-k-numbers-with-most-occurrences-dhyw0x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-single-element-two-single-elements-in-array-qx7dau</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/minimum-length-subarray-with-sum-greater-than-given-value-fgtd3r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/collect-maximum-value-coins-from-matrix-kef4tz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-size-of-non-increasing-sublist-in-singly-linked-list-qf9p1b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimize-steps-to-reach-target-from-1-by-adding-1-or-r7wxjd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/dynamic-programming-and-graph-dsa-questions-zcqv4a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/minimize-array-sum-after-repeated-transformations-e82mog</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/variant-of-rotten-oranges-uiq9t8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/rearrange-linked-list-nodes-r6wcky</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/alternate-level-order-sum-in-binary-tree-u0gyl0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/reverse-an-n-ary-tree-7k7g3q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-missing-number-in-arithmetic-progression-hm3oxd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/check-if-right-half-of-string-can-be-rearranged-into-c7j5rn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-nodes-with-even-and-odd-subtree-sums-on-children-e0ho4m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/shortest-path-in-a-graph-collecting-all-flower-types-l5kfnc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/adding-two-fractions-1avuvf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-most-recently-used-k-integers-in-a-running-stream-1gsrz5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/check-if-string-is-an-interleaving-of-two-other-strings-5jk6ni</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-array-with-even-numbers-ascending-and-odd-descending-cd49hs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-subset-of-playing-cards-by-color-and-value-7fimhy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-if-all-characters-of-a-word-are-present-in-4x4-matrix-m9cfg4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-missing-number-in-a-concatenated-number-string-hzc9gq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/convert-array-of-integers-into-zig-zag-fashion-1fge9b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/maximize-value-by-parenthesizing-expression-opzg2x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/data-structures-and-use-cases-9tjbmh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sort-tuples-and-two-pointers-target-sum-gi9jyu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/check-string-reverse-existence-n73wce</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/reverse-a-number-without-multiplication-k7te9m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/track-number-of-object-instances-2mgpov</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/insert-character-in-singly-linked-list-xhotc2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/split-string-around-character-r2xvye</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/prime-range-queries-with-sub-o-p-time-y2yqi5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/modified-towers-of-hanoi-k1zt9j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/robot-step-counting-4rmh13</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-even-length-word-of-maximum-length-apspe5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/reverse-linked-list-recursively-and-iteratively-7klv2p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/delete-a-node-from-a-bst-xsdj1h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-min-stack-r2yavw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-difference-between-starting-indices-of-word-pairs-vy1v7o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/fix-corrupted-bst-with-two-parents-s7sx6l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-possible-triangles-from-an-array-l57pst</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sorted-array-to-balanced-bst-nnuc38</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-bst-to-sorted-circular-doubly-linked-list-q9xqcz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-for-pair-with-given-sum-in-array-zf1eqj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/diameter-of-a-binary-tree-with-at-most-one-turn-mq9bzv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/maximize-the-minimum-element-in-array-with-range-increments-j7dfq6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/ways-to-convert-string-to-as-using-range-flips-6glrfi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-maximum-occurring-number-in-an-array-jty9u6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/write-code-demonstrating-runtime-polymorphism-e8i1xr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/print-highest-salary-in-each-department-6x553m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-a-pattern-without-using-loops-0t9vo4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reach-a-given-score-order-does-not-matter-vvc2hv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/length-of-smallest-substring-with-maximum-distinct-6c5ugk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/form-m-digit-number-with-digit-constraints-g3e6q4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/express-n-in-terms-of-powers-sum-yb422q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximize-minimum-distance-when-placing-boxes-on-points-9ls4gc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shuffle-a-given-array-using-fisher-yates-algorithm-0aopb8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-next-greater-number-with-same-set-of-digits-ckca5e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/wildcard-pattern-matching-5b23jy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-first-and-last-positions-of-an-element-in-a-sorted-9m316w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/check-if-two-elements-sum-equals-the-rest-fyw7lz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-the-most-frequent-element-in-an-array-d1j37k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/generate-random-value-at-different-timestamps-q4yn8d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/moving-trains-and-bird-distance-problem-gz8tl1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/largest-palindromic-substring-b1ciyq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-finger-for-nth-term-in-repeating-sequence-iy0lbf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/segregate-even-and-odd-numbers-in-an-array-50p1jp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-missing-numbers-and-implement-lru-cache-4l7rrm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/implement-conditional-logic-in-custom-language-without-if-t9s30b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/generate-non-repeating-random-numbers-from-array-38d163</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/cpp-outputs-linked-list-string-comparison-and-tree-min-depth-wi1rxa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/implement-two-stacks-in-a-single-array-and-folder-size-c55tmq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/minimum-jumps-and-pair-sum-in-array-81k8se</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/tree-height-linked-list-insertion-and-array-sorting-71ob4r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/maximum-element-in-sliding-window-and-lca-in-bst-h8wn7v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/linked-list-of-binary-tree-leaves-in-constant-memory-1hd06d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sum-of-count-of-unique-elements-in-sliding-windows-wxpyp9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-index-up-to-which-rotated-array-is-sorted-mx960j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/largest-product-of-three-numbers-in-an-array-mr106c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/generate-balanced-and-symmetric-binary-tree-from-array-0xmqo7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-a-specific-number-pattern-without-loops-or-variables-uwr2cg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/merge-two-sorted-arrays-in-place-in-linear-time-z9p5xd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-all-sets-of-anagrams-together-flqvg1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/sort-an-array-of-size-n-containing-numbers-1-to-n-1-3duocb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/sql-query-for-employees-with-salary-greater-than-department-vbt6mq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-the-fourth-largest-element-in-an-unsorted-array-pwva90</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/longest-substring-with-at-most-2-unique-characters-3nyryo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/build-a-chess-like-game-using-html-css-and-vanilla-js-cb7ncq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/curried-sum-function-using-closures-and-recursion-lz7s34</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/implement-debouncing-and-throttling-q9fmvm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-loop-in-linked-list-and-balanced-parentheses-c0lfxx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/write-polyfills-using-core-js-and-prototypes-yi68ih</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/counter-function-using-closures-m64t9v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/generate-all-binary-strings-of-length-n-421gn8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-if-an-array-contains-duplicates-0juivu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/implement-a-queue-using-stacks-and-pop-the-k-th-last-element-er0j4j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/largest-square-of-1s-in-binary-matrix-97nryw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/find-tree-diameter-pl3vv1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/make-array-zig-zag-gdyh7a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/matrix-paths-with-no-repeating-nodes-bmmiv9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/keypad-mobile-number-permutations-9zppgn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/smallest-divisor-of-a-number-yz877l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/print-string-subsequences-jda7bl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/calculate-sum-of-qualifying-substrings-ndt8ba</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/factset/insert-phones-in-priority-order-wwss11</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/positional-elements-in-a-matrix-ejf4r0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/0-1-knapsack-with-item-tracking-7994ia</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/longest-anagrams-in-a-dictionary-rtx1qu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/dijkstra-s-shortest-path-4nxj2x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/currency-conversion-error-minimization-vd658u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/data-recovery-across-pen-drives-2k6zej</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/valid-chess-moves-on-board-with-pieces-r4p0bd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/string-permutations-with-wildcard-question-marks-rxzq83</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/mutual-friends-with-weighted-interests-iiimo2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/print-anagrams-together-evn1o9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/find-quotient-without-division-or-multiplication-operators-6gkv03</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/burst-maximum-balloons-with-an-arrow-k758ui</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/maximum-subarray-sum-with-positive-and-negative-numbers-0hdlxq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/k-greatest-elements-4vrv38</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/subsequences-with-product-less-than-k-xh68yp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/island-counting-using-dfs-bfs-flp1em</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/sort-an-array-in-decreasing-order-ypm04d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/sum-of-squares-of-first-n-natural-numbers-zj4cir</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-kth-smallest-and-largest-element-in-array-5o0tg5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/rotate-matrix-right-k-times-cb0xzl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/check-balanced-expression-lfr0tb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/minimum-number-with-given-digits-and-sum-ax1aip</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/maximum-cost-path-in-grid-jb7j4t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/iterative-inorder-traversal-of-tree-9397nu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/process-ids-reader-writer-thread-synchronization-and-tf8ylu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-an-almost-sorted-array-and-find-the-smallest-number-dwn68a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/project-discussion-oop-in-java-c-basics-and-recursive-linked-4bqk3q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/python-language-features-data-types-and-comparison-with-java-d2fyzx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/discussion-on-machine-learning-projects-and-basic-java-n6qus4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-kth-largest-element-in-an-unsorted-array-lzbd97</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/minimum-number-of-laptops-required-for-jobs-ms7zu0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/time-calculation-after-adding-seconds-9sn2qe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/substrings-with-only-and-all-vowels-mwh6b5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/convert-binary-tree-to-doubly-linked-list-during-inorder-g8p5la</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/string-subsequence-problem-01hohf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/deloitte-personal-interview-on-oops-python-and-rdbms-7e9j97</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/morgan-stanley-pen-paper-assessment-r91vmc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/morgan-stanley-in-depth-java-technical-round-w0vssv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/employee-tree-hierarchy-recursion-and-string-optimization-a89gmg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/check-palindrome-with-recursion-5c07xw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/armstrong-number-using-loops-2dgb76</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-second-maximum-salary-r4yqe8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/debugging-and-algorithm-coding-section-b0nang</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-10th-highest-salary-b86zv9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/sort-binary-array-and-swap-variables-32zt3d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/reverse-linked-list-and-nth-highest-salary-y3zw4v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/database-insert-update-and-orm-code-8yyrdn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/staircase-matrix-traversal-qwlsd1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/magic-square-puzzle-and-code-smq03w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/java-object-oriented-concepts-and-multi-threading-igr3yw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/pick-maximum-stones-under-weight-limit-3mhh5h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-depth-of-json-object-w9h3rb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/ways-to-add-up-to-sum-n-using-first-n-natural-numbers-g570wx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/validate-bst-and-find-root-to-node-path-tn9fkj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/shortest-interval-containing-0-1-and-2-julmc2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/print-strings-matching-search-query-13ou8c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/minimum-value-from-floor-of-array-divisions-yc0rwj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/print-triplets-where-a-b-c-xomd3f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/word-break-problem-with-dissection-check-h8k96y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/maximize-final-volume-with-constraints-5blrie</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-changes-so-no-adjacent-numbers-are-same-7835tc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-hash-map-6s2hwe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-least-recently-used-cache-znyt0n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/count-ways-for-rat-in-a-maze-87bapi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-pair-with-given-sum-in-balanced-bst-eksks5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/gcd-calculation-2589ee</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/bfs-traversal-z47yg7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/water-tapping-problem-e4f94h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/maximum-cost-bag-with-item-quantities-ndch5x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/print-sum-of-nodes-at-same-vertical-level-b13jc0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-single-non-paired-value-in-sorted-array-q9ql7g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/social-network-book-recommendation-and-top-k-likes-lxen6g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/substrings-of-length-3-containing-a-vowel-75iexg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/remove-smallest-peak-repeatedly-until-empty-4of59p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/grid-cells-with-identical-row-and-column-elements-cx2kqt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/insertion-sort-using-linked-list-4lnz9e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/sliding-window-average-riqug2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/implement-a-trie-wsmz9c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/count-all-perfect-numbers-in-a-given-range-p3kj28</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/count-weekdays-or-fridays-between-two-dates-t8z532</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/factorial-recursion-and-count-negative-numbers-in-sorted-uqems4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/implement-stack-bubble-sort-fibonacci-and-file-word-count-hn63c0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/channel-selection-algorithm-for-wifi-access-point-wsk2kh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/array-strings-linked-list-loops-and-sql-queries-1yh3tr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/random-matrix-game-and-string-permutations-eaze49</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/matrix-path-coin-collection-and-seating-arrangement-jpd80v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/merge-sorted-arrays-median-and-mean-calculation-ksfg5h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/maximum-chocolates-with-money-and-wrappers-2xyrk4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/heroes-and-monsters-coin-collection-jwpq5a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-combinations-satisfying-a-i1-b-i2-b-i3-c-i4-8c1zfk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/copy-linked-list-with-next-and-random-pointers-x6jqsc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/check-and-fix-bst-with-two-swapped-nodes-cncc22</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/maximize-stock-profit-with-o-1-space-0suatn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/print-boundary-of-a-general-tree-clockwise-p6hsya</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/quick-sort-implementation-and-thread-optimization-6tsfzg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/pick-best-two-values-and-add-sum-to-cost-1nkggk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/minimum-number-of-platforms-required-for-a-railway-bus-yo0yke</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-the-number-of-rotations-in-a-sorted-and-rotated-array-mb2c8r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rotate-an-n-n-array-right-by-90-degrees-p6ym4x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sort-a-linked-list-containing-0s-1s-or-2s-9vauam</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/restore-a-bst-with-two-swapped-elements-56tasv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-left-node-data-is-greater-than-right-node-data-uhz21r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-inorder-successor-in-a-binary-tree-p15g7a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/design-a-stack-with-o-1-getmin-jxarf0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-10-most-frequent-words-from-a-file-7244wv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-every-kth-node-of-a-linked-list-csy174</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/write-a-case-insensitive-modified-strcmp-function-0a0yk7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-a-binary-tree-is-height-balanced-z56f2a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/closest-pair-of-points-in-a-2d-plane-epgn2o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/sort-strings-based-on-derived-binary-numbers-k8frs6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/maximize-best-fit-for-k-machines-77a66x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/sort-processes-based-on-id-and-run-time-cltl8a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/print-all-possible-palindromes-in-a-given-string-x6lae6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/minimize-internal-energy-by-student-arrangement-order-9h8cf6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/cross-a-river-with-stone-positions-and-jump-constraints-m46p9f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/maximum-length-substring-with-consecutive-letters-6sy8z0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/store-telephone-directory-with-multi-field-search-74pe3b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/count-words-remaining-same-after-left-rotation-vfdn86</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/detect-loop-in-linked-list-and-set-k-th-bit-n206w6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/sort-alphanumeric-string-lx0lxu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/sort-string-characters-rtbr3w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/first-n-fibonacci-numbers-oic680</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/depth-first-search-dfs-implementation-2lij84</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/shift-array-left-by-d-positions-ik61pl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/optimized-triplet-sum-3zrgks</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/n-th-palindrome-of-k-digits-h46s98</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/palindrome-by-swapping-only-one-character-ace4q1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/smallest-positive-integer-value-that-cannot-be-represented-4yu80v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/find-the-length-of-the-largest-region-in-a-boolean-matrix-bvk8x3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/convert-a-binary-tree-to-dll-hh2xc5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/print-a-few-patterns-b1tfp1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/move-all-zeros-to-the-right-in-an-array-gnxh0t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-all-valid-dictionary-words-in-a-character-matrix-630v39</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/number-of-strongly-connected-components-d5pi37</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/bursting-bubbles-simulation-qojqv5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/minimum-number-of-platforms-or-train-stations-bouc9k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/most-occurring-word-and-first-non-repeating-character-lp64vw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/itinerary-travel-tickets-ordering-en6vo7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/reverse-a-line-word-wise-yytx04</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-all-anagrams-from-a-dictionary-biqvj4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-maximum-co-linear-points-in-2d-and-3d-plane-81o7uh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-a-32-bit-integer-z7mm85</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/top-k-frequent-words-in-a-massive-file-1vicz7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reconstruct-text-by-inserting-spaces-with-dictionary-3zo059</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-length-path-from-root-to-leaf-with-sum-s-in-bst-i92shx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/string-operations-based-on-length-xc9mqy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/replace-consecutive-equal-digits-g69m27</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/simulate-water-flow-in-2d-array-5qapje</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/count-unique-triplets-with-difference-y337k1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/open-locks-after-n-passes-nkqz68</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/level-order-traversal-with-alternate-levels-reversed-hmxhw0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/find-n-th-biggest-number-in-an-array-kfti1p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/remove-characters-not-in-second-string-x6dwgi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/check-valid-parentheses-without-stack-tpkcm2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/check-armstrong-number-in-string-06em4y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/calculate-number-of-islands-06da7t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/in-place-sorting-algorithm-n3z80w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/implement-queue-using-stack-752czy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/topological-sort-in-a-graph-1txk7f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/hashmap-implementation-4uw03l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-3-largest-elements-in-an-array-c2h03n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/collect-maximum-diamonds-in-matrix-i7r7cw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/lexicographically-smallest-range-for-bitwise-and-rj0vsc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/median-from-a-data-stream-qqs3ux</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-profit-stock-buy-and-sell-rrqzo7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/count-total-islands-in-a-2d-grid-m65kgr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/disjoint-set-for-documents-with-identical-words-qywp7k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/print-outer-boundary-of-a-binary-tree-4c0s9t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/strictly-increasing-array-by-modifying-one-element-oi6g9s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/check-pangram-and-longest-palindromic-substring-7nl4nt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/recursive-linked-list-implementation-and-call-stack-6yfcdz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/rotting-oranges-minimum-time-80bhig</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/find-rotation-count-in-a-sorted-rotated-array-myw0ti</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-duplicates-in-constant-array-with-elements-0-to-n-1-geucq9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/maximum-cost-path-in-an-undirected-graph-dt9bc9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/printing-longest-common-subsequence-80lk7l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/minimize-subtree-sum-difference-by-breaking-an-edge-dk7ora</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-max-and-min-in-o-1-time-using-queue-xzl4vf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/reverse-a-string-using-all-known-algorithms-1lnrdb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/swap-two-numbers-without-using-extra-variable-7jzq84</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/implement-longest-common-subsequence-xsb97t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/check-palindrome-linked-list-and-kth-largest-element-in-a-arist2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/sort-1gb-unordered-data-using-100mb-memory-and-employee-r3t8sk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/sequence-sum-from-mapped-string-and-2d-sorting-feg9us</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/sql-queries-missing-number-in-array-and-2-eggs-100-floors-xon36l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/longest-palindromic-substring-and-vector-searching-a1me02</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/linked-list-operations-stack-implementation-lru-cache-and-uov2wu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/smallest-missing-id-stream-processing-rgy5s9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/happy-number-fu417u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/circular-prime-check-string-rank-and-array-permutation-j7sn3a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-missing-repeated-number-detect-loop-and-level-order-ub7is7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/check-palindrome-string-and-convert-number-to-words-qrgqt0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-umbrellas-to-save-people-and-spiral-matrix-pseudo-l6mglk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/fibonacci-complexity-infinite-sorted-array-search-y-linked-zh0fnb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/core-oop-concepts-and-java-collections-api-w6dg5a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/hello-world-in-c-and-printf-internal-storage-gxq841</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/connect-nodes-at-same-level-without-extra-space-k3s2pi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/reverse-a-string-and-a-paragraph-word-wise-31c5ol</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/inorder-and-level-order-traversal-complexity-ckx8xw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/number-of-ways-a-frog-can-reach-nth-step-ej7fdk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/replace-a-string-with-another-string-in-a-paragraph-im5k6b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/sort-balls-of-red-blue-and-green-color-hxldv7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-a-generic-swap-function-for-memory-blocks-m58kir</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-contiguous-2d-matrix-dynamically-in-c-and-spiral-177j8v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/calculate-fibonacci-for-nth-term-with-optimization-1k5eu2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/conditional-return-function-and-missing-number-in-array-1maxqy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/find-numbers-in-a-range-that-are-divisors-of-n-ld4vfp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/remove-duplicates-and-quicksort-y00vp4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/maximum-path-sum-between-two-nodes-of-a-tree-d1sl5k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/majority-element-in-an-array-nx2hce</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-kth-smallest-element-from-the-last-in-a-linked-list-39nm8y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/put-even-numbers-at-even-places-and-odd-at-odd-places-5xtyci</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/design-lowest-common-ancestor-lca-in-an-n-ary-generic-tree-v7mxy2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/array-manipulation-using-two-pointer-technique-e3n8c3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/dynamic-programming-problem-on-lcs-or-knapsack-variant-d8xbiw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/shortest-path-graph-problem-with-constraints-laf5o0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/decode-integer-to-character-string-ways-2dmj5g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/implement-stack-using-two-queues-with-multithreading-6k58wr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/number-of-ways-to-climb-staircase-6ntq06</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/egg-breaking-puzzle-strategy-efmy5k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/iterative-inorder-traversal-in-a-binary-tree-f5te2f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/longest-root-to-leaf-path-in-a-tree-73mefp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/implement-blocking-queue-using-semaphore-fen0go</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/minimum-steps-on-cartesian-plane-grid-game-8srgtz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/find-kth-largest-number-in-an-array-58lcqr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/n-ary-tree-preorder-traversal-and-reconstruction-20xb4b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-repeating-elements-in-an-array-5i4dit</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-common-elements-between-two-arrays-vqs5f9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/common-elements-in-row-wise-sorted-matrix-fm1sfi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-duplicate-elements-and-frequency-c15vpn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/reverse-sentence-by-word-cwqxf0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/swap-two-variables-using-various-methods-jv8bvw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/reverse-a-linked-list-and-delete-node-in-circular-list-mw93bd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/binary-search-implementation-and-complexity-4ct451</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/avl-tree-balancing-and-implementation-0ilimh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/max-length-edge-from-index-array-1vdpjk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/minimum-subarray-with-sum-k-2vgufz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/static-vs-dynamic-memory-allocation-77kzbs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/data-structures-for-scenarios-and-red-black-trees-n0if7d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/triplet-sum-in-array-5daxzo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/shuffle-2n-integers-in-place-sxqt46</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/operations-on-very-large-numbers-thk5l3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/stock-span-max-profit-problem-87kr13</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/construct-tree-from-traversals-ti62rv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/find-two-missing-numbers-replaced-with-zero-vjx6y8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/maximum-occurring-character-in-a-string-4klxvx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/factorial-of-a-given-number-jxj9yn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/top-three-frequent-words-and-longest-common-prefix-3i04r5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/missing-number-in-sorted-array-i63rg4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-ip-address-and-host-name-ah99xj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/unit-digit-of-power-and-deck-of-cards-sum-6jbwc2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/oop-pillars-and-recursion-program-xje9rx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/verilog-code-for-and-gate-using-mux-j49s95</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-first-unique-element-from-left-in-an-array-ttr7v0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/maximum-number-from-digit-rearrangement-mvc7zf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/spiral-matrix-problem-nzkk02</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-mirror-image-of-a-string-b55dzr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/rotate-string-with-given-value-l04q5w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/remove-duplicates-and-sort-array-5vnsug</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/add-and-delete-elements-from-an-array-7b30n2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/remove-alternate-characters-parity-indexing-and-word-search-4zjz9x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/knight-tour-min-moves-minimum-heap-implementation-reverse-vtc5mx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/optimal-strategy-for-a-game-and-wildcard-pattern-matching-97ch1p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-m-nodes-after-n-sum-logic-infix-expression-trim-bst-88yssv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/resolve-unix-path-and-count-encodings-maz6we</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/min-depth-tree-merging-and-minimum-index-stream-matching-cbvaa1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-platforms-largest-smaller-number-from-digits-reverse-2tg9t1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/kth-neighbor-in-binary-tree-and-excel-column-number-3tfncb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/max-sum-non-adjacent-function-overriding-snake-and-ladder-n-4yqtml</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/decode-running-string-and-remove-adjacent-duplicates-via-f79sg0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/print-matrix-in-spiral-order-and-snake-ladder-problem-zqwp3b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/detect-loop-in-linked-list-count-digit-7-occurrences-reverse-0hxruf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/print-string-permutations-and-serialize-deserialize-binary-smu22c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/group-anagrams-and-edit-distance-one-ap277n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/find-path-between-two-vertices-in-directed-graph-eqo24d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/min-element-in-sorted-and-rotated-array-and-median-of-two-vn7f2i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/valid-compressed-string-and-container-with-most-water-k5w67n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/singleton-pattern-missing-repeating-number-loop-detection-364yhm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/longest-palindromic-substring-average-salary-puzzle-and-3xsyoe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/optimal-strategy-for-a-game-and-total-decoding-messages-v125gq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/balanced-parentheses-virtual-functions-and-hashtable-4u9dc8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/range-count-queries-and-segment-tree-range-minimum-query-admw8i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/next-permutations-matrix-paths-and-min-jumps-xj3ten</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/paint-house-minimum-cost-and-max-sum-subarray-variation-sdv5zi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/modified-sieve-of-eratosthenes-and-cliff-probability-gb3nil</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/bracket-reversals-and-candies-distribution-n80z2p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/unique-duplicate-array-element-max-sum-stream-and-0-1-2-sort-54rre8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/find-number-of-isomorphic-elements-5s6c7v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/maximize-stock-profit-5ozt1n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/nuts-and-bolts-matching-problem-q7l1tm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/minimum-total-marks-with-distinct-marks-constraint-wmbmf2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/implement-a-linkedhashmap-with-access-order-937i53</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/count-palindromes-and-find-longest-palindromic-substring-jap4qg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-missing-number-in-array-where-elements-appear-twice-kkit0m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/burn-a-binary-tree-1b8k1g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/count-character-and-word-occurrences-z5vwd9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-hash-table-and-hashmap-1dngq2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/check-if-two-tree-nodes-are-siblings-josd97</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/delete-linked-list-node-given-only-pointer-to-it-1tap4e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/sql-query-for-cheapest-mobile-price-c9byg3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-heap-and-tree-array-representation-e6gpxe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/basic-sql-queries-and-dbms-concepts-7xum2n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/minimum-points-to-reach-destination-coding-question-rvkfi1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/check-circular-linked-list-w4bbkc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/tree-height-and-order-jfwe68</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/implement-queues-using-two-stacks-id9o3w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/two-sum-problem-j8tq6l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/balanced-parentheses-problem-acef21</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/palindrome-number-with-iterative-and-recursive-approaches-h2kq51</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/detect-cycle-in-linked-list-and-start-node-xvy2bm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/coin-change-problem-using-dynamic-programming-1521zm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-size-of-array-using-sizeof-b05ie7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-the-frequency-of-character-in-a-string-iid0xp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/minimum-shipping-containers-g4cv85</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/matrix-half-diagonals-sum-i41iv8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/print-number-table-in-c-szjim7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/functions-arrays-and-structures-j9smq0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/inheritance-in-cpp-sts9x4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/friend-class-and-friend-function-in-cpp-bbur1c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/pow-x-y-using-dp-and-recursion-4ieei6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/traffic-light-synchronization-lz0cqi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/maximize-elements-divisible-by-m-0u3vou</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/maximum-fruits-harvested-after-k-steps-jgi4gz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/number-of-pairs-in-an-array-whose-sum-is-divisible-by-60-g56fa4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/print-ascii-values-and-find-character-frequency-in-a-string-27f7zy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/elements-present-in-only-one-of-two-sorted-arrays-gafs2s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/implement-cycle-detection-first-node-and-length-of-loop-in-5gzkid</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/string-palindrome-and-fibonacci-6ec84w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/doubly-linked-list-and-pointers-221spc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/create-a-rectangular-box-with-red-text-in-html-and-css-yu7n3a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/string-palindrome-checking-pl3waa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/minimum-cost-path-in-a-matrix-0psg1u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/merge-two-linked-lists-cvx3qk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/add-two-numbers-recursively-z8zhf1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/factorial-of-large-numbers-concept-h846sm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/word-frequency-for-huge-data-b210b0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-linked-list-has-a-loop-rklmh1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-sum-of-a-contiguous-subarray-8l0q3i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/ways-to-decode-a-numeric-string-b81wwr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/max-chunks-to-sort-array-tetth5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/split-binary-tree-into-equal-sum-parts-3ske6n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/anagram-implementation-problem-0y6j0v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-duplicates-in-an-array-in-o-n-time-and-o-1-space-67ju8h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/data-structure-supporting-insert-remove-contains-and-get-sfin6p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/convert-an-array-into-zig-zag-fashion-eps9e7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/print-a-binary-tree-in-sine-wave-form-vertical-order-304t41</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/iteratively-print-and-remove-leaf-nodes-of-a-binary-tree-ss0lg7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/sql-queries-procedures-triggers-and-indexes-z3ipz1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/basic-programming-tasks-in-java-cpp-y7r1mz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/add-all-odd-numbers-from-1-to-n-3ukm77</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/stack-and-queue-implementation-and-real-life-applications-zqx1jm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/perform-all-sql-joins-on-two-given-tables-1ccdyo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/python-syntax-sql-query-optimization-and-algorithm-design-6z3jyk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/print-odd-and-even-numbers-using-two-threads-in-order-1a5vh3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/connect-every-node-to-next-right-node-in-a-tree-dzckc4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-pairs-for-given-sum-in-a-sorted-singly-linked-list-3js4g0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/correct-a-bst-with-two-swapped-nodes-2t2ltj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-n-nodes-after-m-nodes-of-a-linked-list-izg13b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/minimum-time-required-so-that-all-oranges-become-rotten-1ze89g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/remove-duplicate-elements-in-a-given-array-w1gn3x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/sum-of-elements-in-linked-lists-i7v7f8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/c-program-output-prediction-and-core-cs-multiple-choice-4ejp9t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/insert-node-in-sorted-linked-list-5s7nih</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/lowest-common-ancestor-in-bst-ikk55j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/c-vs-cpp-python-data-types-sql-queries-and-code-verification-yaiu6v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/prime-number-check-and-string-formatting-ys7gjz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/sorting-algorithm-coding-problem-dd6uxr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/building-bridges-across-cities-vsbp9i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/store-mirrored-matrix-efficiently-110xui</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rotate-array-wpt893</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-frequencies-of-elements-in-array-fazy9p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/boggle-find-possible-words-in-board-399vag</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/chocolate-wrapper-puzzle-lo1271</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/javascript-dom-manipulation-efy5dk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/arrange-4-coins-in-contact-5t1lj6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/check-prime-number-and-optimize-uhqb6i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/nibble-wise-swap-in-a-byte-3o7tuo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/decimal-string-to-binary-representation-9lky5n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/sector-wise-write-to-flash-memory-o6ef1n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/find-middle-and-kth-from-last-node-in-linked-list-0jt6ut</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/trailing-zeros-in-factorial-4nfy0b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/range-update-and-print-array-using-segment-tree-bp9rru</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/25-horses-problem-dh74ai</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/find-index-of-max-element-in-rotated-array-dysr4r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/minimum-umbrellas-needed-for-k-people-wrb771</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/remove-all-duplicates-from-a-given-string-nxvz3b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/swap-two-strings-f2mcr8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/chocolate-and-wrapper-puzzle-30hbd5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-k-frequent-words-in-a-file-oelk2r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/delete-a-string-in-a-trie-wrx93i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-lowest-common-ancestor-in-a-tree-fmbc1t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/form-the-largest-number-from-array-elements-mf7vcq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/sort-an-array-larger-than-ram-3lexy1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/max-area-quadrilateral-of-given-length-1b5sna</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/minimum-platforms-required-for-railway-station-7bhmm0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/mirror-tree-for-n-ary-tree-sp9pid</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/two-elements-with-sum-equal-to-s-3auosf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/print-number-pyramid-pattern-48ilkz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/arithmetic-expression-evaluation-data-structure-mcq-6g43ng</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/reachable-nodes-with-restrictions-jg5hoz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/longest-ideal-subsequence-juvq20</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/finding-loop-in-linked-list-lmr92q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/find-k-largest-elements-of-an-array-t3a11h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/merge-two-sorted-linked-lists-in-reverse-order-zeosr4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-average-of-elements-in-window-of-size-k-4km6qk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-a-string-and-print-character-frequencies-b5jd9v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-palindromic-substring-and-spiral-matrix-traversal-0qynww</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/build-max-and-min-heap-from-array-uo3pqv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/search-in-rotated-sorted-array-63msar</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/word-count-in-a-big-file-4y1v7d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/insert-element-into-complete-binary-tree-y4d8r6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/build-various-trees-from-array-of-elements-e0o5jf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-queue-without-using-any-data-structure-hyi7tx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/count-specific-letter-in-a-string-9jbazm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/difference-between-c-and-python-bcrjv3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/measure-execution-time-in-c-and-python-ttqz9n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/find-the-row-with-maximum-number-of-1s-6nzqcq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/minimum-cost-path-with-blocked-cells-e0wpv6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/develop-custom-hashing-function-hh4nr9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-number-of-objects-created-by-a-class-7ilyhb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/reverse-the-string-and-palindrome-number-d0ti6f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/isolate-the-array-s-penultimate-element-8wcopm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/longest-chain-of-uninterrupted-1s-lcd4op</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/verify-anagrams-v6amx8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/insertion-and-excision-in-doubly-linked-list-1ulloh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/print-name-in-vertical-order-k7ulda</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/count-word-occurrence-in-pdf-qzudm2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/bubble-sort-complexity-and-optimization-70cn3b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/reverse-string-and-alternate-words-39py84</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/print-prime-numbers-alternatively-2s1les</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/ropes-subarray-and-quadruplet-sum-dycm5n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-ip-address-and-hostname-via-java-program-9phsof</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/largest-sum-subarray-anagram-sets-and-longest-palindromic-9tcqn5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/variable-sequence-satisfaction-using-graph-cycles-5mn5yx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/optimal-strategy-for-a-game-with-move-limit-yiu5ls</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/total-number-of-sub-arrays-of-zeros-e5caku</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-number-with-specific-remainders-0qf4ea</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-k-n-th-node-in-a-linked-list-c1euon</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/reverse-words-in-a-string-based-on-fibonacci-indices-sf2txy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/maximum-depth-of-a-tree-65oca4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/distance-between-two-nodes-koszb6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/maximum-product-of-a-triplet-24sgq1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/remove-elements-for-product-congruent-to-1-mod-n-j0p3ud</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/minimum-jumps-for-rabbit-with-obstacles-3mtb5p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/determine-game-winner-based-on-situations-0livby</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/minimum-steps-in-a-grid-t9dy2r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-in-bitonic-array-83yk6z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/validate-bst-1pft34</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-hops-to-reach-end-or-any-node-5nuwr5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/top-k-trending-words-in-a-large-file-2ualiq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-a-vector-in-c-cb1xpn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/build-binary-tree-from-pre-order-string-thpq4a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-smallest-element-8e1378</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/row-with-maximum-number-of-ones-pn97wq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/first-person-to-wear-a-unique-color-74jbe1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/merge-two-linked-lists-and-inheritance-code-y7362m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/count-pairs-with-minimum-absolute-difference-4k3u8m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/escape-the-grid-within-time-limit-jr50di</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/sublist-sorting-for-increasing-order-j32962</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/maximum-root-to-leaf-path-sum-erw5yc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/sum-of-elements-in-each-tree-level-1bis3e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/pairs-with-difference-equal-to-k-w4kmqr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/hierarchical-data-structures-and-queues-4iwsxp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/sql-mean-salary-query-oa26no</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/two-dsa-problems-mths61</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-k-s-closest-elements-and-mountain-range-problem-5o58p6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/ugly-number-ii-rh5hfw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/number-formation-p8tzbd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/lru-cache-and-data-structures-hwo41i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/excel-column-name-tw92y1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/recursively-remove-adjacent-duplicates-xce8kh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/ugly-numbers-ck0sox</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/count-paths-in-a-grid-6sx69k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/construct-a-binary-search-tree-sxaur4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-contiguous-sum-connect-ropes-print-left-view-27moei</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/grandparent-parent-child-sum-and-circular-house-robber-eoazf3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/min-jumps-variation-and-cs-mcqs-xlmo49</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/class-that-cannot-be-multiply-inherited-and-instantiated-y0kvuo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/create-a-mesh-like-tree-structure-with-overlapping-links-ym3vjp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/most-frequent-word-in-a-text-stream-u7oumb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/core-subjects-html-differences-and-sorting-array-zp8gyu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/nth-fibonacci-number-code-eqs43p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/splitwise-simplify-debt-algorithm-0qtf4x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-maximum-parallelism-from-service-logs-ihy7gq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/find-numbers-with-difference-k-and-minimal-sum-8ko1du</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/permutation-in-string-y8ozu8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/merge-two-bsts-2ovr9d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/anti-clockwise-binary-tree-traversal-fzp8h6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/four-principles-of-oop-in-cpp-ce04n8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/react-state-management-and-optimization-4g7pg4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/string-character-count-clock-angle-test-cases-sh6zeg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/average-speed-calculation-fibonacci-factorial-wdcy2h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-gcd-of-an-array-of-numbers-med69q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/write-and-optimize-pseudocode-for-given-problems-88yf47</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rainwater-trapping-and-binary-tree-zigzag-traversal-ggjfc2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/binary-string-addition-and-count-numbers-divisible-by-c-4h0lz6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/java-main-method-arraylist-vs-linkedlist-and-duplicates-lpc11k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/classify-weak-and-strong-passwords-xoqtx4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/count-non-overlapping-pairs-with-sum-k-5u0osg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/compare-count-of-t-and-t-in-large-text-4bhr8u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/print-subordinates-under-a-given-hod-36g319</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/group-by-queries-in-oracle-sql-ptixy9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/count-pattern-in-a-circular-linked-list-v5r92b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/java-8-new-features-5rvvgt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/iterate-and-find-unique-words-count-in-java-l93pga</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/sort-first-k-values-ascending-and-remaining-descending-mpzfa6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/core-algorithms-linked-lists-sorting-and-oop-concepts-p2a3l6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/memory-allocation-python-file-search-bst-and-puzzles-g4ro3t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/knapsack-and-job-scheduling-variations-6it17y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/gas-station-fuel-reached-5hjuq0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/distinct-elements-in-window-i3pd7i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/root-to-leaf-paths-with-target-sum-z8ch71</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/cheapest-flights-within-k-stops-variation-r7y9d2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/polymorphism-concepts-2vw4lc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/word-pattern-q75w96</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paypal/left-view-min-swaps-palindrome-substrings-k6823w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/formula-1-race-simulation-and-calculations-7hrmfp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/check-if-word-exists-in-string-bv1u7l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/min-months-to-reach-work-hours-2bfm5s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/largest-substring-with-equal-0s-and-1s-4hrklt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/wave-traversal-of-binary-tree-ztnnn9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/longest-subsequence-as-substring-pxod64</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/graph-connectivity-with-threshold-recgy7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/second-most-repeated-word-u4w997</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/queue-implementation-kuwtm1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/write-insertion-sort-algorithm-e64m9n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/most-frequent-ip-addresses-and-median-of-sorted-arrays-6re2tx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/rotated-sorted-array-search-max-stack-and-top-k-frequent-ffue18</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/pair-with-given-sum-in-array-104hk4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/boolean-matrix-and-row-column-sorted-matrix-search-lptas6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/length-encoding-r98ci3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-point-occurrences-k91u7u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/path-with-minimum-magic-potions-5z50x4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-index-of-repeating-element-l451am</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/print-all-files-in-a-folder-recursively-wqrlh5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/write-code-for-merge-sort-v8m2w6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/stack-and-array-questions-os9vk4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/pairs-with-sum-divisible-by-k-5o2cse</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/next-largest-palindrome-se5jyj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-saddle-points-in-a-matrix-93hio2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/replace-repeating-integers-with-unused-greater-numbers-uctfj1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-the-height-of-a-tree-1f2yzs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-an-element-in-array-in-o-n-comparisons-kwex3b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-nth-fibonacci-number-i8yhrx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/check-if-binary-tree-is-height-balanced-5tsruz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/replace-character-in-string-x6vj0w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-second-largest-number-decodings-and-coprime-pairs-bis52q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/event-bubbling-forward-refs-and-css-pseudo-elements-l9rego</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/word-count-and-n-th-step-ways-with-max-m-steps-zob7dv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/anagram-xyhly5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/binary-tree-traversal-vsm2gq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/coding-test-8b6fj6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/maq-software/manager-round-b2txln</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/string-score-calculation-cxhiu0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/generate-binary-strings-gs6mgh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/median-of-infinite-stream-663jh8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/power-of-2-and-water-clogging-3qoqdp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/f2f-coding-3awt03</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/f2f-technical-dn4llu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/print-all-interleavings-of-given-two-strings-x70qtq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/segregate-0s-and-1s-in-an-array-3uvuq4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/minimum-operations-to-reduce-number-to-1-nm1vcx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/next-rise-in-temperature-days-67btyf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/time-to-burn-a-binary-tree-e6kq68</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/count-employees-present-at-query-time-7fwiuv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/minimum-exchanges-to-sort-a-3x3-matrix-s19qw4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/print-number-sequence-pattern-77xa71</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/merge-overlapping-intervals-using-stack-m1oyxw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/minimum-iterations-to-empty-binary-string-a3k3c5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/merge-overlapping-robot-retrieval-orders-s06ygj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/minimum-cost-product-selection-across-categories-264wng</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/tournament-schedule-design-e4jbt2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-two-nodes-in-a-bst-that-sum-to-a-given-value-06whq5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/candy-crush-consecutive-removal-problem-xa3sb1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/count-pairs-with-difference-divisible-by-k-4633o4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/rotten-apples-oranges-problem-bd22sz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-5th-element-from-the-end-of-a-linked-list-tk3v2r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/set-bits-in-an-integer-8jdau7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/most-common-toy-after-range-updates-yxd98u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/maximum-continuous-pickups-6oc6qn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/minimum-operations-to-reduce-n-to-1-wd07pj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/maximum-perimeter-of-polygon-from-array-dtje74</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/shortest-path-in-server-network-w292uh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-nth-number-containing-only-digits-0-to-5-xqx7oq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-missing-element-in-sorted-array-a93wgo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/check-if-sentence-is-formed-from-dictionary-words-xle5sj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/super-bitstrings-sequence-generation-gnifs7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-cost-to-connect-n-ropes-690u45</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/in-place-heapsort-and-comparison-with-other-sort-algorithms-4tpijl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-local-minima-in-an-array-xqsj5q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/currency-arbitrage-using-bellman-ford-a6al8b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/rule-based-string-concatenation-optimization-s6seng</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/compiler-compilation-order-determination-k6tjsb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/reverse-a-bitstream-8o5fbp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/search-in-a-circular-linked-list-sno5yr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/reverse-string-vertically-with-unique-characters-nv038j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/smallest-substring-to-replace-for-stable-string-f36mnl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/next-biggest-number-using-same-digits-rln48u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/zig-zag-order-traversal-6gevoi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/width-of-a-skewed-binary-tree-0l75sw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/number-of-buildings-facing-the-sun-o1m7zb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/minimum-insertions-to-form-a-palindrome-5tjn5f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-element-appearing-once-in-array-of-duplicates-889dwy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-two-non-repeating-elements-in-an-array-p46q89</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/check-if-number-can-be-written-as-sum-of-k-prime-numbers-6ggcd4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/zigzag-or-diagonal-traversal-of-matrix-tt6pw1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/word-search-ii-with-coordinates-kbk59h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/even-length-palindrome-in-a-character-stream-4inxbv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/factorial-equation-a-b-c-1bg6pv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-path-sum-in-matrix-j89el8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/pair-leaf-nodes-with-non-intersecting-paths-4si94w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/pizza-price-closest-to-target-fhw5ls</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/generate-all-permutations-of-a-string-r8ac9a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/largest-perimeter-triangle-2cym6r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/minimum-number-of-taps-to-open-to-water-a-garden-w0nsh0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-the-missing-number-in-a-linked-list-from-1-to-n-41z2ht</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/count-substrings-with-identical-terminal-characters-in-a-09ds1v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/sort-urls-by-frequency-and-lexicographical-order-2njduj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/point-update-and-find-r-th-minimum-element-b5au0z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/reverse-a-string-using-multiple-approaches-o17xcm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/check-if-a-string-is-a-palindrome-and-analyze-time-jq4wcv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-the-element-that-appears-once-in-an-array-where-every-09kqpt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-the-second-largest-element-in-a-binary-search-tree-mb9qho</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/activity-selection-problem-given-start-times-and-durations-181l39</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/count-sparse-palindromic-substrings-maxs0i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/extrapolate-linear-coordinates-using-line-equation-gdjm5l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/shortest-path-from-node-1-to-node-n-uffu9u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/print-a-character-array-without-spaces-0tdsh6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/shortest-path-using-bfs-or-dijkstra-klgx5y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-the-row-with-the-maximum-number-of-1s-xfnu1u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/multiply-two-numbers-using-addition-with-minimal-recursive-qrmu4i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-the-multiple-of-a-number-ending-in-3-that-contains-only-2u0hg5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-unique-words-from-a-string-with-duplicates-43e0o7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-the-maximum-odd-subsequence-of-a-binary-string-5bafdt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/calculate-servers-that-can-reach-the-n-th-server-in-1-time-al7yp6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-the-minimum-number-of-intermediate-nodes-between-nodes-u9ixiq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/implement-heap-sort-with-complexity-analysis-92png8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/farida-45lar1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/maximum-chairs-needed-n7ix12</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/path-finding-in-matrix-tpf4ls</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/frog-jump-with-bridges-and-tunnels-18xsf2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/string-to-integer-conversion-7whpag</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/reconstruct-tree-from-traversals-085mfz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/validate-tree-traversals-3vmjg4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/word-and-character-frequency-count-in-string-fkv90j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/implement-oop-pillar-ms8w96</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/partition-big-number-for-divisibility-2kg983</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-reachable-leaf-nodes-within-budget-1c0nnu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/spiral-order-traversal-of-mxn-matrix-fmh3fx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/arrangement-based-on-alternating-counts-n9d46s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-rank-of-permutation-yt09gv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/convert-float-to-binary-string-d4z3uu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/identify-ap-or-gp-from-three-integers-zbm2uc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/filter-linked-list-for-even-values-z5d423</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/check-palindrome-without-built-in-functions-eua2ap</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/connect-n-ropes-minimum-cost-gab5g4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/smallest-and-largest-connected-component-on-a-grid-rg48rp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/search-word-in-2d-grid-without-diagonal-traversal-rkq6h1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/salesforce/longest-substring-with-duplicates-using-sliding-window-kmc8w3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-the-missing-number-in-an-array-cp3lo5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/extract-a-specific-substring-from-a-string-in-java-491ukb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/calculate-time-difference-between-file-creation-and-current-iz5heq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/bubble-sort-in-c-and-proof-of-correctness-hg5po7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/calculate-electricity-bill-using-tiered-slabs-tkev4m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/detect-loop-in-a-linked-list-using-fast-and-slow-pointers-3jmhh2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/construct-nested-tree-structure-from-flat-parent-child-wzb05o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/calculate-percentile-for-a-given-roll-number-viw4yc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/count-ways-to-uniquely-fill-a-3x3-grid-with-digits-1-9-4vw12g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/count-ways-to-climb-a-10-step-ladder-0v10k8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/calculate-the-time-when-clock-hands-overlap-after-3-00-pm-06pk2x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/write-pseudocode-to-sort-an-array-2w0vva</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/minimum-initial-power-to-cross-caves-and-defeat-monsters-3zjo4z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/implement-selection-sort-and-quick-sort-pynn2n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/maximum-number-possible-with-n-digits-and-sum-of-digits-lvy6xb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/implement-linked-list-with-employee-details-and-add-6-6u58ct</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/print-ascii-value-of-all-digits-of-a-given-number-yam5dt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/find-whether-a-given-number-is-a-power-of-4-x4vmjb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/form-a-chain-of-words-using-a-trie-8wraem</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/check-if-a-number-contains-duplicate-digits-mgr87k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/bleak-number-dj6o27</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/print-decimal-to-binary-recursive-and-non-recursive-8tfo1q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/smallest-possible-number-of-same-size-using-digit-8ogqx3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/maximum-sum-of-nodes-at-a-level-in-a-binary-tree-jsk6lr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-repeated-words-in-a-linked-list-without-extra-space-h42ql1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/count-leaf-nodes-of-a-binary-tree-0q7h2a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/zig-zag-traversal-of-a-binary-tree-3prc35</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/maximum-product-of-5-numbers-in-an-array-8jmjz6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-moves-to-reach-destination-ozxe26</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-modifications-to-restore-array-order-955mjq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/isolate-infected-application-fee57j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/generate-mirror-of-tree-od2jmg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wells-fargo/subsequence-with-given-sum-nmc3p9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/highest-frequency-character-weigs6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/print-array-of-strings-without-comma-yflvt6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/string-conversion-with-shifting-dnpc67</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-two-numbers-with-product-n-plxm95</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/check-if-linked-list-is-contained-in-another-chy0el</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/fibonacci-using-dp-sq81zt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/insert-in-circular-linked-list-gx49hr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/back-propagation-in-cnn-6dy7i6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/check-power-of-two-1r2ehq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/real-world-examples-of-oop-concepts-wz9wwi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-max-exercise-category-based-on-sequence-ya9alm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/next-smallest-number-with-distinct-digits-2fuvpg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-minimum-element-in-a-rotated-sorted-array-an29de</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-common-node-between-two-linked-lists-t1mfv4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/radius-of-smaller-circle-in-isosceles-right-triangle-74ur2p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-length-of-line-segment-after-folding-rectangle-5vowai</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/heapify-an-array-and-time-complexity-w2cbty</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-single-multiple-non-repeating-numbers-in-array-v9lun1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/check-if-binary-tree-b-is-a-subtree-of-a-gq4mao</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-kth-smallest-element-in-unsorted-array-ly1jqg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/count-pricing-errors-by-comparing-sold-vs-correct-prices-lzcft9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/remove-consecutive-duplicates-from-string-d0qi19</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-most-frequently-occurring-ip-from-log-file-zp33rl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/probability-of-array-being-a-minheap-and-local-minima-ybom55</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-total-squares-in-an-n-x-n-square-grid-gijno8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/sql-query-for-second-highest-score-k3oz6n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/reverse-a-singly-linked-list-in-a-single-iteration-xt2k7r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-string-length-and-middle-node-of-linked-list-ml5omh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/minimum-races-to-decide-top-3-horses-out-of-25-9e498r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/lexicographical-rank-of-string-among-distinct-substrings-vp127m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/permutations-avoiding-consecutive-incrementing-elements-n2nv6u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/firecracker-chain-ignition-count-q36tz9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/makemytrip/connect-nodes-at-same-level-in-binary-tree-fzder2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/edit-distance-with-strict-optimization-rtcze6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/minimum-cost-to-connect-cities-nbv5ao</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/find-triplet-with-given-sum-78mo8d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/create-directory-with-edge-cases-6jv2ld</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/task-master-jlrqd6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/closest-random-points-v98ymv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/count-words-in-string-with-special-characters-pak9jq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/design-special-stack-2fz4sl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/bny-mellon/iterative-and-recursive-binary-search-0hezs3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-the-missing-integer-in-a-range-from-1-to-n-bkj9wd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/maximum-profit-with-at-most-k-stock-transactions-j4tw71</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-the-minimum-and-maximum-numbers-for-a-specific-weighted-ycy11f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/convert-a-decimal-number-to-a-binary-string-oyzq07</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/multiply-two-complex-numbers-given-as-strings-rzh0qx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/binary-palindrome-identification-a3i8xx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/triplet-sum-in-an-array-5f3gh8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/generalized-subset-sum-problem-o9ozag</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/largest-square-submatrix-with-at-most-k-red-cells-n5p9tu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/recursive-string-palindrome-check-pw9orb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/smallest-subarray-with-sum-greater-than-or-equal-to-x-guf6x2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/maximum-product-of-nodes-in-a-path-to-leaf-movao3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/evaluate-expression-according-to-bodmas-2j25kx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/cumulative-sum-of-gcds-over-ranges-23n34p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/filter-and-average-student-cgpa-from-two-arrays-p1jkx5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/data-structure-for-college-organization-hierarchy-lz5jee</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimize-maximum-difference-in-three-groups-6qj9zj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/largest-square-from-merged-segments-j5vtqg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-depth-of-a-binary-tree-and-furthest-leaf-c6whhz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/linked-list-operations-alternate-nodes-delete-node-middle-luw3id</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/house-robber-problem-obvy6y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/form-valid-dictionary-words-of-length-2-or-more-from-string-bhuk7j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/find-interval-containing-a-target-number-using-binary-search-91ar5c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/unique-paths-in-a-grid-with-obstacles-0rfwns</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/count-connected-components-in-an-undirected-graph-qvc5cp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/horizontally-flip-a-2d-matrix-ps2dlp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/count-elements-greater-than-the-mean-of-adjacent-elements-k6xncy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/minimum-cost-to-travel-between-circular-stations-928tys</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/write-pseudocode-for-binary-search-and-string-reversal-20cfil</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/write-pseudocode-for-string-matching-algorithms-1utfo8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/maximal-square-of-1s-in-a-binary-matrix-8t9qw2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-the-smallest-divisor-given-a-threshold-6jl8de</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/determine-type-of-triangle-from-triplets-070c3u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-the-second-smallest-element-in-a-binary-search-tree-b2b6vu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/sum-of-digits-for-each-integer-in-an-array-hx2jg6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/convert-number-using-custom-complement-mapping-1zxfc5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/maximum-sum-of-subarray-containing-only-unique-elements-tx7zcu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/maximum-path-sum-between-two-leaves-of-a-binary-tree-aby895</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/next-greater-number-using-the-same-digits-3cf0ow</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/max-element-in-matrix-after-row-and-column-range-additions-25hexy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/largest-number-formed-from-two-numbers-02mpl2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/move-similar-characters-to-the-end-of-a-character-array-qqlu3t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/count-1s-between-0s-in-binary-array-k9wmq4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/recursive-and-iterative-post-order-traversal-semy9q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/rotate-array-by-k-elements-oz8bka</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/angle-between-hour-hand-and-second-hand-in-a-clock-yhljf0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/sum-of-root-to-leaf-binary-numbers-nj788c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/check-if-two-strings-are-anagrams-of-each-other-t3vap8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/nth-largest-and-smallest-element-in-unsorted-array-r4k0cq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/prime-numbers-and-range-filtering-jsk662</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/sql-join-for-second-highest-salary-and-selection-sort-7yv4bz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/longest-non-repeating-substring-and-expression-evaluation-x6nb8u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/middle-node-of-linked-list-and-two-missing-numbers-in-array-ykt0hb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/print-odd-and-even-numbers-using-two-threads-xrf838</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/hash-table-implementation-and-immutable-class-9fnxkw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/count-occurrences-of-a-number-in-an-array-oi3096</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/calculate-factorial-of-a-number-sg5eig</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/print-all-possible-decodings-of-a-digit-string-77r58z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/check-if-string-contains-permutation-of-another-1ixc9r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/count-paths-in-n-x-n-matrix-phsou1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/minimum-transitions-between-words-9o6x9p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-lexicographical-substring-eeu6a2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/average-of-ascii-values-dklbz7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-three-stacks-in-an-array-ofp8a8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-a-text-editor-pattern-search-as2wri</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/move-negative-numbers-to-beginning-5jkoac</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-loop-in-a-linked-list-and-java-questions-53i5z0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/longest-substring-without-repeating-characters-and-lis-274pba</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/sort-array-elements-conditionally-and-match-strings-th2apm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/squares-of-a-sorted-array-maximize-sum-from-corners-and-kwe028</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/row-with-max-1s-first-and-last-position-sliding-window-sqa64c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/os-project-and-concurrency-discussion-dxwp8d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-all-triplets-with-zero-sum-tziw3j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/sort-a-k-sorted-array-ljdz41</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/max-coin-sum-game-i8sgkh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/snake-case-to-camel-case-conversion-lu140x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/join-all-leaf-nodes-of-a-tree-t3xg0g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/design-a-data-structure-with-o-1-insert-delete-and-search-l1va3m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/distance-between-two-nodes-in-a-binary-tree-5l0b3x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/check-if-a-number-is-a-perfect-square-without-sqrt-or-44wspz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/implement-heap-sort-8w6gyf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/implement-and-resolve-a-deadlock-in-java-n8kni6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/implement-or-and-and-using-conditional-operator-0xk15w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-the-nth-largest-element-in-a-bst-uom0ms</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/construct-a-binary-tree-for-infix-expression-without-stack-cb10m1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-the-middle-of-a-linked-list-in-one-pass-cjlz7k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-a-queue-using-linked-list-fgj9hk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-the-kth-node-from-the-end-of-a-linked-list-in-one-pass-ou506z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-the-median-of-an-unsorted-array-all-people-in-the-world-k4p6dd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-time-taken-to-reach-a-hospital-cxep3y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-alternating-path-in-a-tree-30rtpn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/last-day-when-virus-spreading-will-stop-bje8yy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-pair-with-given-target-sum-in-bst-1htbox</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/minimum-removals-to-make-string-magical-r1eg4m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/calculate-area-of-circle-rectangle-and-triangle-dsj87w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/implement-a-doubly-linked-list-dg5o96</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-missing-numbers-in-a-sorted-array-hiwk8y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/longest-consecutive-sequence-u1dbdh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/print-all-common-substrings-of-two-strings-7ww1kf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/intersection-of-two-sorted-linked-lists-ai3l6t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-for-balanced-parentheses-in-an-expression-c8vw12</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-single-unique-number-among-duplicates-s4qkh5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-a-linked-list-in-one-pass-a0nef5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/transpose-matrix-in-minimum-iterations-f9w6wz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-x-elements-after-first-n-elements-3ugq8w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/unique-binary-search-trees-gfov9n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/minimum-area-bounding-rectangle-for-streaming-stars-uf5ui0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-if-a-binary-tree-is-a-bst-ubgx5o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/write-code-to-make-a-machine-sluggish-82mlki</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/decode-binary-array-to-characters-qzu6ox</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/reverse-a-number-4geih3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/implement-a-matrix-size-transformation-in-r-84mes3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/jar-filling-operations-2ltbsv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/maximum-strongly-connected-nodes-with-given-edges-7faph8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/volleyball-match-score-sequences-oxhwt4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/height-of-a-full-binary-tree-in-o-1-tci95o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/find-two-nodes-with-target-sum-in-bst-me6745</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/shortest-distance-between-two-cells-in-a-matrix-grid-riukv6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/next-higher-number-using-at-most-one-swap-mc3gn1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/word-ladder-length-of-shortest-chain-to-reach-target-word-101yko</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-the-ordering-of-tasks-from-given-dependencies-ssi3d5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-if-a-string-can-be-formed-in-a-2d-character-grid-9p3v4k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/remove-extra-spaces-in-a-given-sentence-h0z5lj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-3-digit-number-equal-to-sum-of-factorials-of-its-digits-2f0skg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/decompress-run-length-encoded-string-47eyk1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/rearrange-interleaved-array-halves-l85jb8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-matching-characters-after-dollar-sign-in-string-array-nk3gpr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/check-if-a-string-input-is-a-pangram-1vyvor</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/longest-palindrome-of-a-string-3801tg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/print-array-as-json-iy2tu2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/delete-a-node-from-a-doubly-linked-list-6kqfyh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/coin-change-variation-yngdr2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/unique-paths-variation-zoos3w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-duplicate-elements-in-list-7ktfqv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/train-station-graph-problem-n0fmoo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/sort-array-using-helper-jj3iuz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-most-frequent-element-jv582o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/merge-two-binary-trees-rsv54f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/validate-token-nwk7xw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/mapping-name-and-id-q2zvkx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/bst-to-dll-missing-numbers-loops-in-ll-queue-reversal-and-gpeu63</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/modified-binary-tree-preorder-perfect-squares-count-and-3jan2y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/row-with-max-1s-mutex-vs-semaphore-virtual-memory-and-rotten-7ozks2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/odd-number-of-1s-string-permutations-horses-puzzle-and-0wk6co</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/ip-mac-run-length-encoding-stock-buy-sell-and-java-wrappers-zx5jmx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-first-occurrence-of-substring-in-circular-string-and-ql81an</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/place-8-queens-on-a-chessboard-8l0idp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/number-of-threes-in-numbers-from-1-to-n-nywp95</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-multiple-loops-in-a-singly-linked-list-ki6ioa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-difference-of-days-between-two-dates-sshsb3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/lowest-common-ancestor-in-a-binary-search-tree-wdiqg8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/clear-kth-bit-and-implement-min-max-using-bitwise-or-av7lh3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/finding-loop-in-a-linked-list-natht5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-2-consecutive-empty-seats-for-a-couple-in-a-theater-qojdi5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/replace-all-vowels-with-next-consonant-2sbes5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-product-id-with-second-lowest-salary-without-functions-6vp4ee</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/convert-roman-numbers-to-integers-a9ot6w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-inorder-successor-in-a-bst-with-parent-pointers-58y8zn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-a-string-is-a-valid-signed-floating-number-without-mcb8b1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-for-well-formed-parentheses-db7kiw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-bot-can-reach-gold-in-a-maze-s4n547</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-two-binary-trees-are-isomorphic-xre4lc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/group-anagrams-together-from-a-dictionary-er5wrk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/complement-of-base-10-integer-51c7az</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/print-custom-alphabet-staircase-pattern-8ksil2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-duplicate-characters-from-a-string-ao2ehb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/check-if-strings-are-rotations-and-count-rotations-t90j6f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/print-number-triangle-pattern-3elhrw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/java-string-reversal-coding-task-u78imk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/build-a-react-counter-component-gs9u7z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-mex-for-chosen-array-ho44tt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/jump-game-reach-end-of-array-su4vxo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/decode-string-eh6shr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/implement-circular-linked-list-from-scratch-3b73xm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/check-whether-number-is-circular-prime-drigj8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/permute-array-elements-following-given-order-h2vbh3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/bridges-in-a-graph-r8rb7u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-duplicates-in-o-n-time-and-o-1-space-u8vsqb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/design-a-voting-interface-with-votecandidate-and-gettopk-sp335v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/add-graph-edges-incrementally-avoiding-paths-between-jthb0i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/design-logger-to-print-completed-requests-ordered-by-start-8msipf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/implement-a-version-control-map-system-with-snapshots-4opbr9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/trimmed-mean-of-a-sliding-window-of-size-w-excluding-top-and-xua0qp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/expand-string-with-curly-brace-permutations-1kygqi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/dynamically-allocate-a-2d-array-in-c-3t3s5w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/crashing-stones-r0b6cb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/task-queue-batch-processing-time-diwet6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/separate-integer-and-decimal-parts-of-a-floating-point-z3du9j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/elevator-floor-sequence-g5g3ze</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/sorting-techniques-explanation-xs2oct</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/bouncing-ball-distance-6dinc5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/fibonacci-in-o-logn-wcbz0a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/swap-two-specific-numbers-u04zfb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/destructor-order-in-inheritance-jsjmt4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/bst-creation-and-traversals-6ssima</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/generate-gray-code-bit-patterns-0cym2j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/next-greater-permutation-ab6r01</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-manager-hierarchy-using-self-join-igo7u9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/circular-tour-to-visit-all-stations-41ao0l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/connect-ropes-with-minimum-cost-kquu2n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/kth-smallest-element-in-sorted-2d-array-sf6g2h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/max-length-substring-with-same-characters-pro2h7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/shortest-path-in-grid-with-obstacles-97ehiv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/rearrange-linked-list-odd-even-positions-izppb1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/removing-duplicates-from-an-unsorted-linked-list-u25tay</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/permutating-elements-according-to-an-index-array-n5f6ew</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/smallest-substring-with-maximum-distinct-characters-n40ufk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/print-right-angle-triangle-pattern-z34c3c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/segregate-positive-and-negative-numbers-v41k9t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/repeat-and-missing-number-54n5zc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/average-of-top-k-numbers-in-stream-66dc3u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/copy-stack-to-another-stack-fef6r7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/rain-water-trapping-8w6r2f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/dna-subsequence-window-kdhh4l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/bus-tour-scheduling-3es5ab</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/tree-validation-and-formatting-dg4dy0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/smallest-window-containing-all-words-lkv7dn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-basin-block-size-ze54zc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/build-walls-to-contain-overflowing-dam-water-15kfht</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/print-left-view-of-a-tree-and-find-alien-dictionary-grammar-u8wsfx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/parse-validate-and-query-xml-data-without-hardcoding-xlx2eu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-minimum-number-of-chairs-required-given-arrival-and-j6keh3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/find-length-of-contiguous-ones-in-a-binary-string-4xvequ</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/array-vs-linked-list-and-implementation-differences-in-c-vs-xa9dbm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-all-subarrays-with-sum-equal-to-0-w6bxzg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/delete-bst-nodes-outside-given-range-6rarhz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-if-second-string-is-a-rotation-of-the-first-ceka51</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/return-kth-node-from-end-of-linked-list-using-one-loop-vyt2kf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-top-k-words-from-a-file-with-millions-of-words-kt70my</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/determine-if-elements-can-be-sorted-in-ascending-order-given-u5h3di</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-top-k-words-from-a-file-with-billions-of-words-under-k0zr9j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/generate-the-nth-ugly-number-jbjz81</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/alien-language-alphabetical-order-0j52pm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-all-distinct-pairs-with-difference-equal-to-k-mobkw2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/detect-a-loop-in-linked-list-fh6nkz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/replace-every-character-of-string-by-character-whose-ascii-xof8rb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/delete-a-node-in-a-linked-list-given-only-a-pointer-to-that-eure8j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/implement-linked-list-and-find-nth-largest-element-in-o-1-2t8hk0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/code-a-sudoku-solver-93l1jo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/delete-a-node-in-a-singly-linked-list-given-only-a-pointer-92hbbo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-minimum-number-of-coins-to-make-change-2lhgo3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/design-a-data-structure-supporting-insert-search-and-kth-rctov5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-the-last-non-zero-digit-of-factorial-86xtcp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/balanced-parentheses-validation-gj1d1m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/count-even-numbers-using-bitwise-operations-n369om</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/remove-duplicate-words-from-a-sentence-6kii8y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/find-pair-with-a-given-sum-in-a-bst-90jen6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-number-of-distinct-groups-from-parent-child-pairs-8ykr25</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/calculate-balancing-weights-for-nested-scale-balances-z565bt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/root-to-leaf-path-sum-equal-to-k-cired5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/encode-and-decode-string-using-numerical-key-repetitions-4l1kbs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-first-non-repeating-element-in-an-array-2s7lp4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/longest-word-in-a-dictionary-formed-from-characters-of-a-556z77</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/implement-a-fibonacci-series-program-e8l0kk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-number-of-binary-strings-without-consecutive-1-s-yo87gj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sort-a-string-according-to-the-order-given-by-another-string-en87c0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-max-sized-sub-matrix-with-all-border-cells-black-vxgx6h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximize-profit-by-buying-and-selling-share-at-most-twice-0psehp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/populate-unique-ids-in-an-empty-column-v55awd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/merge-sort-implementation-pq0pae</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-a-statement-is-a-palindrome-hri2hp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/detect-loop-in-a-linked-list-5d8ohs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sum-of-nodes-greater-than-or-equal-to-current-node-1oab4i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/kadane-s-algorithm-application-qg9npu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-length-of-maximum-sum-array-00ji1g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-closest-point-to-a-given-point-3r5nfk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/prisoner-jumping-walls-xy2vkf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/kth-max-element-in-o-n-7w4jnd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/sort-0s-1s-and-2s-in-o-n-ugu8ri</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/left-view-of-a-bst-ge4csv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/implement-queue-using-linked-list-v7w2s0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/kth-element-from-head-1mg6nf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/point-inside-triangle-lopw9k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/check-if-c-is-interleaving-of-a-and-b-0zyuhm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/segregate-r-g-b-flags-4xqafx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/divide-array-into-two-halves-with-equal-cherries-5m8hga</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/number-of-ways-to-sum-to-k-avr64x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-valid-substrings-and-reversed-substrings-d6d4m6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reverse-every-alternate-k-nodes-ne1xto</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/merge-millions-of-sorted-lists-1rqnfc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/robot-max-distance-from-origin-2e9ox2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/write-factorial-and-fibonacci-code-4prvam</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/inverted-index-and-page-rank-algorithm-1tdmxo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/validate-email-address-oxld6b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/rearrange-array-into-negative-and-positive-elements-in-o-n-5rukdn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/print-number-grid-pattern-with-shifted-diagonals-zm6kts</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/capitalize-first-letter-of-words-not-present-in-second-e1bh30</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/maximum-sum-of-nodes-in-a-binary-tree-such-that-no-two-are-1ikfhz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/random-traversal-visiting-every-cell-in-an-8x8-matrix-d0k0ue</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/rotten-oranges-minimum-time-required-to-rot-all-oranges-0ntobj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/binary-search-using-recursion-and-iterators-s4nqeq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/fibonacci-series-without-using-a-temporary-variable-y3923k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/minimum-moves-to-convert-to-a-lucky-number-7xl56l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/dijkstra-s-algorithm-and-complexity-3n5evt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/best-searching-algorithm-hj2lno</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-the-next-date-from-dd-mmm-yyyy-iw817e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/check-if-smaller-matrix-is-sub-matrix-of-larger-matrix-aa9mze</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/count-pairs-with-sum-closest-to-target-k-2yuxla</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/count-occurrences-of-each-word-in-a-string-c47kn7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/number-of-connected-components-in-matrix-4idzv8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/most-frequent-substring-with-at-most-k-unique-characters-9toki0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/largest-empty-gap-on-a-road-with-overlapping-intervals-2tttmj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-sets-of-merging-linked-lists-30uj4p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/time-to-burn-binary-tree-from-leaves-8cactk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/optimal-strategy-for-a-two-player-coin-game-ba8ay0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/implement-merge-sort-heap-sort-and-quick-sort-and-contrast-8ye66f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-the-nth-element-from-the-end-of-a-linked-list-in-a-6o9mw6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/determine-if-a-binary-tree-is-a-subtree-of-another-binary-8xhzke</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/perform-an-in-place-removal-of-all-spaces-in-a-string-4vpaae</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/round-a-given-number-to-the-nearest-multiple-of-10-tm6zjk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-median-of-a-running-stream-of-integers-5lzhpz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-possible-paths-from-top-left-to-bottom-right-in-an-n-x-ojgm14</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-minimum-word-distance-between-two-words-in-a-large-l3q8vq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-most-probable-word-of-length-n-given-transition-9cz638</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-top-selling-product-in-the-year-2020-cc735d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-all-pairs-of-elements-whose-index-positions-sum-to-10-0hi0ga</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-frequency-of-each-word-in-a-list-of-words-dlz4wq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-largest-square-formed-of-1s-in-a-grid-jaw66s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/append-occurrence-counts-to-repeated-strings-in-a-log-oy7q6a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/determine-if-a-valid-path-exists-from-the-top-to-bottom-row-5ok1h7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/identify-the-most-frequent-page-transitions-from-user-b6kkf8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/minimum-cost-to-cross-an-array-qbol1n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/expand-string-compression-wr449u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/greedy-weight-cost-problem-u4yxcv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/css-shapes-and-layout-ttgge4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/evaluate-operations-in-binary-string-ogqvs4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/palindromic-partitioning-cz48h1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-n-th-node-from-end-of-linked-list-usgr7y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/search-position-in-an-infinite-sorted-array-cw5uj2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/k-smallest-elements-from-an-array-or-continuous-stream-euyqu8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/partition-set-into-two-subsets-with-minimum-sum-difference-03m8iv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-queue-using-one-stack-33wr79</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/pattern-matching-counts-across-multiple-patterns-hdjle9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-five-missing-numbers-in-an-array-range-rcu5lc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/toggle-case-of-characters-in-a-string-uxbw4b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/sum-of-array-elements-between-given-indices-nm44bs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-if-a-word-exists-in-a-grid-of-letters-vhlhj7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/shortest-distance-between-two-cities-cl0o1y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-word-order-and-adjust-casing-t2390a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/toggle-alternate-character-case-in-string-56ze6b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-a-pair-with-the-given-difference-c422jo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/minimum-number-of-swaps-required-to-sort-an-array-x13nb1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/merge-two-sorted-arrays-and-find-target-index-pg2rm8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/segregate-positive-and-negative-numbers-in-an-array-xfhq39</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/design-a-stack-with-getmaxvaluefromstack-b5s9ju</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/detect-whether-a-linked-list-is-y-shaped-cdr1g7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/time-taken-by-a-binary-tree-to-burn-from-a-target-node-lrn7oc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-number-of-unique-triangles-possible-from-an-array-0lv76q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/design-and-write-a-program-for-snake-and-ladder-game-y67bd6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/compute-average-of-four-unsigned-integers-without-overflow-3rzli1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/a-special-matrix-8l7y1r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maximum-sum-of-elements-where-picking-value-i-prevents-wh1ays</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-palindromes-formed-by-jumbling-characters-of-a-string-t3c5ng</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-a-large-file-that-does-not-fit-into-memory-3w59ot</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/clone-a-linked-list-with-next-and-arbitrary-pointer-nh9q4j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/best-sorting-algorithm-and-iteration-count-for-given-array-tya7as</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/calculate-cost-for-extra-distinct-integers-beyond-capacity-k-98di01</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/count-occurrences-of-a-in-your-name-ul12d1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/explain-and-implement-bubble-sort-72ypga</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/query-for-finding-2nd-maximum-salary-wta2bi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/algorithm-and-complexity-for-heapify-qa38xd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/multiply-two-sparse-matrices-represented-as-hashmaps-u5kvxi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/process-creation-and-control-with-fork-tz3i18</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-top-2-alphabetic-characters-words-from-alphanumeric-pms6hf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/sql-query-using-group-by-2riktb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/convert-a-number-based-on-a-mapped-digit-replacement-system-r2dmdc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/sum-of-nodes-at-distance-k-from-leaf-nodes-m7xy8c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/recursive-function-to-trace-and-print-elements-da62tp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/merge-two-unsorted-linked-lists-into-sorted-order-2iwd2c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/algorithms-for-height-and-width-of-a-binary-tree-1bh9tr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/implement-a-2d-array-using-pointers-0vkbr2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/find-the-middle-element-of-a-linked-list-efficiently-35a0hx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/detect-loop-in-linked-list-and-return-start-node-2jzz0g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-third-most-frequent-element-in-an-array-oljl3v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-connected-groups-in-an-array-of-intersecting-linked-s71ycf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/check-if-a-mathematical-expression-is-valid-wom31x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/line-of-people-height-visibility-arrangements-83l63f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/preorder-traversal-recursive-and-iterative-approach-hnzd17</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/string-permutation-mlk043</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-sum-of-three-salaries-without-revealing-individual-b9rg4k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/maximum-area-of-a-rectangle-in-a-histogram-nw7apk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/calendar-slot-booking-api-and-nodes-at-k-distance-from-v66sbg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/level-order-and-skew-order-traversal-without-extra-memory-kmi6z5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-continuous-subarray-and-reverse-duplicate-element-ra97iu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/recursive-string-reversal-rotated-sorted-array-search-and-lbe9eg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/generalized-fibonacci-sequence-and-number-of-islands-nernj9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/minimum-matching-substring-length-and-jumps-with-max-k-steps-m3bhkv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/validate-bst-with-different-approach-and-zeros-covered-by-n91xp4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/intersection-node-of-singly-linked-lists-and-element-3go93v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-umbrellas-required-to-cover-given-number-of-people-s3bzcm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-matrix-in-spiral-order-063uaq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-pythagorean-triplets-in-an-array-7ypah2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/most-repeating-digit-in-prime-numbers-within-range-vta94w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/number-of-ways-to-split-sum-s-into-four-positive-integers-lwtp84</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/reverse-alternate-nodes-in-linked-list-y0fvr7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/iterative-postorder-traversal-of-binary-tree-x7zyjj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/count-grid-paths-from-x-y-to-n-n-1szk7s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/detect-loop-in-linked-list-and-find-starting-node-z2bneo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/stock-buy-and-sell-single-transaction-max-profit-and-max-9svth7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/implement-string-trim-algorithm-j1xsir</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/maximize-number-with-allowed-adjacent-swaps-grq0k4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/compute-npr-and-ncr-modulo-p-using-fermat-s-little-theorem-v0zzs8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-nearest-perfect-square-using-basic-arithmetic-operators-v3a5py</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/count-common-digits-in-range-kko6g3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/knapsack-items-array-variation-qh8wke</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-student-with-maximum-average-marks-p4tev4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/generate-0-100-random-number-from-0-9-generator-i3onao</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/knight-tour-problem-2cfllm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/bst-deletion-cj8tmo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/return-least-10-numbers-from-a-list-7zzvi1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-queue-using-stacks-and-vice-versa-nw5yb8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/25-horses-race-puzzle-td745e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/min-number-for-n-m-ascending-descending-pattern-rmh8fo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/swap-elements-based-on-digits-and-count-triplets-05ui6v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/phone-digits-words-and-sensor-grid-triggering-ol0puw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/min-operations-to-make-binary-string-all-ones-r9fruh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/binary-tree-cameras-qa1u1b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/python-array-sorting-and-pandas-data-frame-operations-bsgr8q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/longest-common-subsequence-and-sql-query-2p3l7l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/sum-of-elements-from-l-to-r-in-an-array-h9bj7f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/sort-colors-min-stack-and-first-unique-character-in-a-string-di842a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/longest-increasing-subsequence-and-count-possible-decodings-jnf79x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/count-palindromic-subsequences-and-find-pairs-with-given-sum-kx61yq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-single-element-product-array-palindrome-substrings-96nuer</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-string-in-place-flatten-array-and-design-image-zqr7co</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/expression-evaluation-and-multi-select-list-ui-component-lgvq0j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/speed-time-distance-and-age-problems-ku44x0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/min-k-elements-of-an-array-with-large-streaming-data-8qxfif</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-platforms-required-for-a-railway-station-pojhc2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-an-element-in-a-sorted-and-pivoted-array-ec9is6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/make-the-largest-string-possible-from-character-array-h63sn8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/move-all-1s-to-the-end-of-an-array-containing-0s-and-1s-nkooa4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/kth-smallest-element-in-an-array-nqs1gs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-difference-cbbv2i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/data-structures-b-tree-vs-bst-and-sorting-algorithms-p5ar4j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/sorting-students-by-completed-codes-6l987m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/starter-class-and-main-function-nmakz3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/array-vs-linked-list-search-time-caf6q9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/linked-list-loop-logic-and-circular-linked-lists-5wwey0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/binary-search-mechanics-and-termination-dj4wvz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/doubly-linked-list-sorting-deduplication-and-heap-sort-lef2zg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/stack-implementation-sorting-collections-and-multithreading-x2qynm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/implement-merge-sort-algorithm-8mmkmb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/sum-of-two-large-numbers-frp7wy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/count-unique-and-duplicate-telephone-numbers-is4hpm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/merge-2-sorted-arrays-d87x45</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/print-fibonacci-series-in-equilateral-series-format-v1qito</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/look-and-say-problem-4cnp8w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/check-power-of-2-and-define-class-structure-64gflk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/sum-of-numbers-in-a-string-and-find-element-or-next-greatest-03mjgy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-leaders-in-an-array-z9baha</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/longest-subarray-consisting-of-unique-elements-5e3el9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/minimum-repetitions-of-a-so-b-is-a-substring-o6p7wb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/floyd-s-triangle-8q76vw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/matrix-problem-minimum-distance-nyaq22</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/reverse-a-string-and-display-in-html-0kl7d1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/efficient-array-sorting-algorithm-hds0w0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/lru-cache-implementation-algorithm-01ggcu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/minimum-coins-for-amount-4wjmdw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/remove-duplicate-elements-in-array-quickly-aon2cr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/stock-buy-and-sell-max-one-and-two-transactions-44t7gc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/people-knowing-each-other-thl56f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/lake-counting-on-a-grid-uqoys7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reduce-number-to-zero-in-minimum-steps-1j9kag</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/click-and-bet-hit-counter-with-expiry-jk6630</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/array-problem-with-space-optimization-4qht7e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/hashing-and-collision-scenarios-jufsp7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/minimum-increment-or-decrement-required-to-sort-array-dmt3of</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/basic-technical-concepts-assessment-ne39q9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/reverse-a-linked-list-and-detect-cycles-within-it-90kxum</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/explain-time-and-space-complexity-of-kadane-s-algorithm-and-6byozl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/implement-dijkstra-s-algorithm-for-finding-shortest-path-in-2vywj7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/validate-binary-search-tree-and-find-kth-smallest-element-galh62</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/determine-if-line-between-two-excel-cell-coordinates-passes-vw3zeb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/count-split-indices-where-both-left-and-right-substrings-can-9w0uc7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/first-non-repeating-character-in-a-stream-of-integers-5eit42</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/replace-o-surrounded-by-x-with-sharp-2roeg8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-all-unique-triplets-that-sum-to-zero-4w7b0z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/create-a-web-form-and-database-connection-to-store-and-fetch-oqml9z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/binary-tree-zigzag-level-order-traversal-uul2wm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/compare-sum-of-even-elements-versus-odd-elements-in-an-array-w7twlj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/string-vs-stringbuilder-differences-75swhg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimize-tower-heights-difference-with-k-rav3nc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/format-string-by-inserting-spaces-and-lowercasing-pgwtm8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-a-spell-checker-uliy87</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-duplicates-in-a-string-0or01y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/number-of-intervals-inside-a-target-interval-0wcorm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/longest-bitonic-subsequence-lobub4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/reverse-a-linked-list-in-o-n-space-agz23q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-substring-with-length-n-2-kp1rh0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-two-missing-elements-in-array-b-2g7sjs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-middle-element-of-three-merged-sorted-arrays-053wr6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/find-most-frequent-word-in-a-statement-h6wx8b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-winner-in-a-stream-of-bids-ypm1wx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/last-non-zero-digit-of-a-factorial-sxcdn6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-minimum-index-i-i-in-matrix-44ahsh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-triplet-in-array-urh3l3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/substrings-of-palindrome-s2-from-anagrams-of-s1-prv89t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/valid-string-after-removing-two-different-characters-h6ypl8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/print-anagrams-in-vector-order-cw2abv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/mirror-of-binary-tree-7d0tgb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-triplets-with-given-sum-8ai4ci</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/working-and-code-of-merge-sort-y10ce5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sql-queries-using-group-by-max-and-count-98par7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/radio-channel-frequency-data-structure-management-90x8a5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/find-missing-number-in-faulty-random-generator-stream-1dh60q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/set-kth-bit-for-an-integer-nnhb4r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-the-greatest-common-divisor-gcd-9bcw8n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/shortest-path-in-a-maze-using-bfs-defv63</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/implement-quicksort-and-discuss-complexity-sx1qqx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/difference-between-an-array-and-a-linked-list-atnay5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/principles-of-object-oriented-programming-7m6wi9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/hash-table-internal-working-and-operations-7wiegi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/explain-dynamic-programming-and-solve-knapsack-wv1dhw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-all-permutations-of-a-string-93e5kq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/maximum-active-users-on-a-website-wf9ska</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/rotate-a-matrix-clockwise-by-90-degrees-1n637s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/binary-stream-divisibility-by-5-iimr4e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-all-subsets-of-a-set-mp7i6v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/maintain-median-of-an-integer-stream-tewzz1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/calculate-racer-ranks-based-on-times-1inbra</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/min-heap-operation-time-complexities-nxnr9x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/sorted-vs-unsorted-array-complexities-pz747m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-level-sum-in-a-binary-tree-6jrqbl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/shortest-route-between-cities-eliminating-k-edge-distances-36zvzt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-sum-without-adjacent-elements-mnt22h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-the-missing-element-between-two-arrays-231t59</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/insert-a-node-into-a-linked-list-at-the-middle-and-end-7yfzz6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/convert-string-to-specified-case-qfq2er</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/predict-ticket-booking-success-j5fcd4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/remove-whitespace-from-a-string-in-java-1snwik</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-kth-repetition-of-a-character-and-all-k-s-9ysd7m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/delete-node-from-singly-linked-list-given-only-node-address-bqk5h3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/count-maximum-elements-after-incremental-matrix-operations-9dqfsu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/min-and-max-remaining-building-blocks-after-halving-jc80mz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-root-to-node-paths-where-last-element-is-greater-than-ipilx8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-of-minimum-for-every-window-size-k-rw3wyy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/design-ds-supporting-add-delete-and-getrandom-in-o-1-1otijv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/determine-elephant-height-orders-from-pairwise-comparisons-gmblu7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximize-stolen-value-from-houses-house-robber-knapsack-9jtqfv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/partition-set-into-two-subsets-with-minimum-difference-uzei5m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/convert-string-to-integer-without-default-functions-6xf8m1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/find-largest-odd-number-in-string-and-peak-array-search-vsr9wr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/cricket-team-combinations-query-and-burning-binary-tree-wlzsq5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-nth-magic-number-mewk7k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/form-string-from-dictionary-words-urg8p4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/spiral-traversal-of-n-ary-tree-4ll5bf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-of-consecutive-windows-of-size-k-guy6s4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximize-summation-of-i-a-i-with-rotations-xqp88q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-circular-queue-g20aui</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimize-subset-sum-difference-cwg00r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/smallest-substring-containing-all-words-ekd3a0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/reduce-n-to-one-io4o10</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/hsbc/armstrong-number-ftqk9y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/most-repeated-number-5jl68x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sort-array-of-5s-6s-and-7s-4c9hg7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/find-word-in-vector-of-strings-q8eyfs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/sql-query-to-find-authors-with-multiple-books-3wbvdi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-all-missing-numbers-in-an-array-r53ru0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-last-character-from-variable-length-ascii-byte-array-72cwgv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/flood-fill-algorithm-implementation-xe0cqo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/generate-n-bit-gray-codes-bbh7pp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/implement-an-n-row-n-column-tic-tac-toe-variation-ffhf28</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/minimum-time-to-burn-a-tree-completely-otxcv0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/print-nodes-at-a-given-level-in-a-bst-qk6lfw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/insert-a-name-in-a-sorted-manner-in-a-very-large-file-0tl4gy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/reverse-a-string-using-two-pointers-4fwakl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/maximum-depth-of-the-binary-tree-gel2yk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/implement-queue-using-single-linked-list-6lciwr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/write-multiple-and-multilevel-inheritance-code-qjzj6y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/construct-tree-from-string-and-write-code-2m0kfn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/separate-cgpa-stream-from-file-and-store-efficiently-vfxs9a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/check-cycle-in-linked-list-and-find-orphan-nodes-h5kivn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/check-if-element-square-root-exists-in-array-kf6720</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/fibonacci-series-using-objects-and-classes-moz97v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/print-even-numbers-using-arraylist-pjus1e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/memory-hierarchy-and-storage-location-questions-i01v4s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/best-data-structure-for-searching-unsorted-elements-f165s3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/find-missing-element-in-unsorted-list-and-rotate-array-jv7fj6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/print-hollow-pyramid-diamond-pattern-o0tzl4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/doubly-linked-list-operations-xgn9zu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/string-pattern-replacement-z406j5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/word-search-in-2d-grid-z81hvr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/restore-rotated-array-by-reversing-subarray-tg0q5z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/match-keys-and-locks-o2exhd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-all-anagrams-56mxt7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/reachability-with-addition-and-subtraction-d8ovue</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/efficient-max-insert-delete-data-structure-mt2lgf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/sum-of-last-n-nodes-m5xybi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/binary-tree-subtree-and-logic-aym8k2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/print-all-cycles-in-directed-graph-2d6d2m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/snakes-and-ladders-the-quickest-way-up-o3v63h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/thread-implementation-code-t8b1qm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/coding-question-based-on-trie-data-structure-647tgq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/array-rotation-in-linear-time-and-constant-space-csfi3e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/coin-change-problem-6muli9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/land-and-water-matrix-traversal-f4hjn2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/implement-stack-from-scratch-0gmqx0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/painting-fence-algorithm-7xw5i3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/count-palindromic-subsequences-khm1eu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/reverse-tree-path-2z5k04</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/sort-string-according-to-another-string-fdj0wm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/ways-to-return-to-start-vertex-in-a-triangle-85ptfe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/doubly-linked-list-to-balanced-bst-81mz02</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/pythagorean-triplets-in-an-array-74efvu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/print-prime-numbers-divisible-by-6-f9pouj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/sum-of-first-largest-k-elements-ofa6kp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/number-of-necklaces-with-pearls-in-ascending-magnificence-d0om0b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/print-boundary-values-of-a-binary-tree-zfjx4p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/sql-queries-nth-highest-salary-joins-and-subqueries-m8xc44</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/optimize-double-loop-character-comparison-sum-hyt4nw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/write-a-multi-threaded-cpp-program-pwcfs8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/detect-cycle-in-a-graph-using-bfs-4rwavd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/row-with-maximum-number-of-1s-in-binary-matrix-5cgt5u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/find-all-cousins-of-a-given-node-in-a-binary-tree-gr7n6u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/find-employees-and-their-managers-from-single-table-jq7xf8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/employee-count-per-company-query-xbh6jg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/arcesium/generate-integer-from-1-to-7-with-equal-probability-no8r5p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/partition-of-a-set-into-k-subsets-with-equal-sum-30qr74</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/height-of-a-tree-and-count-number-of-nodes-85wb72</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/binary-search-in-an-array-and-reverse-a-string-buluj3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/detect-loop-and-find-intersection-point-in-linked-list-w9huvk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/post-order-traversal-using-recursion-and-iterative-methods-mt4f11</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/count-number-of-set-bits-in-an-integer-9rxrql</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/maximum-size-rectangle-binary-sub-matrix-with-1s-9ab8wb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/modified-kadane-s-algorithm-with-maximum-sum-less-than-k-ih1ngx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/modified-dijkstra-algorithm-for-train-routes-q2wg77</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/sql-query-employee-sorting-and-profit-calculation-b124mt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/sql-query-to-get-employee-and-manager-names-6poig3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/find-prime-numbers-from-1-to-n-eg4m1g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/quicksort-logic-and-complexity-comparison-njcg3n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/custom-regular-expression-matching-1xipks</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-majority-element-occurring-n-2-times-yid5dl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/clone-a-random-linked-list-mj1xz6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-maximum-width-of-a-binary-tree-a34ylf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/reader-writer-problem-without-semaphores-ifc1uv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/store-words-from-a-text-file-using-a-tree-j9bukm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/lca-in-bst-vly62w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/palindrome-linked-list-2zeq88</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-stream-6698r6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/flatten-linked-list-2hfjai</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/oops-concepts-encapsulation-overloading-and-overriding-jhl88t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/double-linked-list-and-its-applications-s8kydn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/lexicographically-smallest-sub-sequence-of-length-l-f3gj3a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/knight-probability-on-chessboard-jneuq7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/detecting-loops-in-a-doubly-linked-list-fjtkc3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/graph-dfs-problem-orozx5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/c-storage-classes-pointers-and-references-bfwge9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/swap-two-numbers-and-find-prime-numbers-mr4mnn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-consecutive-path-of-alphabets-in-a-matrix-q54oxy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/construct-n-ary-tree-from-pre-and-post-order-traversals-t51ge1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/flatten-a-binary-tree-into-a-linked-list-h8icba</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/explain-dijkstra-s-shortest-path-algorithm-g1njnh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/delete-a-node-from-linked-list-without-head-pointer-psy342</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/implement-any-sorting-algorithm-in-java-ojrkl5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/rotate-sub-array-of-size-n-in-a-2d-matrix-vr43yg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/form-longest-string-from-string-pairs-with-matching-ends-tqb9hv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/merge-sorted-rows-into-a-1d-sorted-array-without-duplicates-1w0ifp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/merge-two-sorted-arrays-and-remove-duplicates-954e15</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/count-magic-numbers-in-array-i3cq7q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/minimum-window-containing-all-target-words-1jtnaq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/explain-oop-concepts-in-detail-312hpt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/method-overloading-vs-method-overriding-xm9hpj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/types-of-polymorphism-r8txj3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/difference-between-and-operator-1i6hze</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/print-elements-of-row-column-sorted-matrix-in-sorted-order-rd66hk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/write-code-for-max-heapify-3wy3zr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/process-vs-thread-and-virtual-memory-o19lg2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/calculate-x-power-n-efficiently-1zrchs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/nth-term-of-fibonacci-series-in-log-n-x67n0n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/synchronization-mutex-and-reader-writer-problem-60kdqg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-top-5-horses-using-minimum-races-8mgkfy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/check-if-singly-linked-list-is-palindrome-it3zff</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/volatile-keyword-with-example-tiljz7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/array-of-function-pointers-complex-declaration-d6a0do</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/roman-numeral-to-decimal-conversion-nyoz5v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/longest-substring-with-distinct-characters-jyql21</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/what-is-paging-and-why-is-it-used-d0m6sc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/move-all-zeros-to-end-of-array-79btk5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/write-code-for-fibonacci-series-and-a-pattern-96sujm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/find-rotation-count-in-a-sorted-array-4y5cfv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/find-second-maximum-element-without-sorting-pi1416</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/count-odds-in-array-kevqy5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/snake-like-traversal-of-binary-tree-13ix7e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/topological-sort-algorithm-implementation-zt9hgo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/matrix-zeroing-with-o-1-space-9lzk06</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-power-x-y-without-loops-ghw11k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rotate-mxn-matrix-by-90-degrees-y5bnu9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/first-element-appearing-k-times-co08su</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/create-a-wordle-puzzle-vr5acs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/decimal-representation-of-rational-number-p1vsno</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/file-compilation-order-bc58zl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/maximize-a-i-a-j-j-i-ld8h5s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/array-transformation-and-reconstruction-0hmu1v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/nth-character-in-a-custom-tree-1ptfhy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/reverse-string-qbx5nb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/linked-list-cycle-yddiq1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/odd-even-using-java-threads-5vcjct</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/smallest-substring-with-maximum-unique-characters-6edhum</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/generate-grey-code-k0lnvp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-one-missing-number-in-given-range-1vglfv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/maximum-value-array-with-range-increment-decrement-ev4jwn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/nearest-1-in-binary-matrix-with-diagonal-movement-5tega9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/team-visibility-hsb72r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/binary-matrix-path-g89w30</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/array-reduction-o44pgk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/array-insertion-m3jeko</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/path-sum-7dj3vs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/tree-coloring-constraint-odc90a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/merge-linked-lists-9dp337</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/reverse-a-string-in-c-and-write-a-palindrome-program-5g2nd4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/sql-queries-for-table-creation-and-filtering-1oz0c9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-a-loop-in-a-linked-list-ej2frm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/calculate-patterns-in-string-and-knapsack-application-m4wen6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/validate-an-infix-arithmetic-expression-string-awku30</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/categorize-books-with-expensive-external-priority-calls-io7knz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/replace-needle-strings-in-a-long-string-using-a-map-led9j9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/print-character-pattern-s4sk9e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/explain-abstraction-and-encapsulation-ey3vd2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/differentiate-between-private-protected-and-public-class-io3ocx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/what-are-polymorphism-and-encapsulation-imi6rc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/what-is-a-virtual-and-pure-virtual-function-jq3n36</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/minimum-time-required-to-rot-all-oranges-07fx1q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/reverse-a-stack-using-recursion-5ffxbc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/reverse-level-order-traversal-of-binary-tree-ft1fir</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/write-a-sql-query-to-inner-join-two-tables-csri1k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kth-smallest-largest-number-and-roman-numerals-conversion-hlk0qx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/explain-java-abstract-keyword-and-oops-concepts-8qxl6z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/cpp-oops-and-sql-basics-x1x2aq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/pangram-check-and-student-best-average-marks-z5p11p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/grid-path-string-generation-and-closest-pair-sum-tko1z3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/multithreading-networking-and-dbms-concepts-u8lwuy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/maximum-subarray-sum-and-tree-traversals-zhm19y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/concurrency-control-and-dbms-normalization-k40tf7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sql-joins-python-file-handling-and-merge-sort-array-gud9x7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/convert-decimal-to-hexadecimal-d0mmg6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/largest-number-formed-from-an-array-xwz5jm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/add-n-days-to-a-given-date-without-inbuilt-libraries-cy9qj9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/synchronized-producer-consumer-threads-in-alternating-order-nlx6di</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/core-oop-concepts-and-four-pillars-k69nio</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/types-of-loops-in-cpp-9fmlzn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/visa/sql-queries-and-file-processing-for-strings-with-vowels-wydnu9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/arrays-vs-linkedlist-malloc-vs-calloc-and-prime-numbers-d3q028</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/distinct-array-modification-and-vowel-longest-common-4df80x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/lru-cache-implementation-and-matrix-rotation-ylbvs0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/missing-and-repeating-elements-and-stock-span-problem-om59k7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/binary-tree-level-sum-with-n-ary-children-lu8z79</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/offensive-word-message-moderation-system-f8z2km</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/armstrong-numbers-aer8h8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/factorial-by-recursion-mme5yp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/minimum-length-positive-subarray-tq7ef3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/encoded-string-possibilities-wm7rew</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/rearrange-linked-list-eayz4q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/random-song-picker-mbo92f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/check-if-bst-9iahsd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/merge-sort-time-complexity-and-approach-wquc4q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/different-sorting-algorithms-and-real-life-implementation-de17ph</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/doubly-linked-list-with-real-time-examples-hc12cj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-the-middle-element-of-the-linked-list-ggwz7e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-if-two-words-are-anagram-or-not-cfeoz0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/even-and-odd-numbers-range-d39f1s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/heap-sort-vs-merge-sort-1bx9bp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/reverse-sorting-time-in-heap-zfd1ah</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/data-structures-without-o-log-n-lookup-2z488g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/function-overriding-discussion-75371p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/most-frequent-word-and-hashing-te5n3m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/menu-combos-price-search-q9fw5e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/stable-in-place-binary-array-sort-cq22o7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-pairs-with-sum-k-bs42qp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/rectangles-on-a-chessboard-72a3cs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/delete-duplicate-nodes-in-linked-list-t6unoa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/convert-string-to-integer-806nb9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/sum-of-two-large-integers-9yie12</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/kth-byte-from-hexadecimal-number-oyrm2f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/qualcomm/free-memory-without-free-function-5gawvt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/nearest-same-alphabet-distance-5zqyzt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/n-queen-and-puzzles-q0v0sk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/reverse-each-word-of-a-sentence-with-starting-letter-in-caps-7st5ay</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-gcd-of-given-two-numbers-if0hia</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-missing-slot-and-number-in-1-to-100-array-0wngiy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/partition-string-into-k-substrings-with-digit-constraints-z7wb4g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/count-special-paths-in-an-n-ary-tree-dwzd60</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/minimum-operations-to-make-building-floors-zero-or-k-6tbnv9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/frog-probability-on-n-ary-tree-nodes-xa2e6i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-elements-subset-sum-less-than-k-83fnjm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/level-order-traversal-of-binary-tree-in-array-format-hmfn8t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/count-subarrays-that-sum-to-k-yl9t13</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-starting-money-for-savings-25ucuv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/optimal-path-in-a-grid-n9guwp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/fraction-to-decimal-string-togz6r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/cube-root-floor-sx0h3h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximize-ad-effectiveness-miygj0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-cost-path-with-jumps-r9jnyo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/max-sum-path-in-graph-084q2n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/simplify-directory-path-ydz9ys</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/post-office-delivery-queries-2m6ozo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-subarray-with-at-most-k-distinct-elements-6guvrg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-length-of-sorted-subarray-via-recursive-division-bhvc85</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-sine-subarray-0x2q3j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/number-of-connected-components-yxop52</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/array-updates-and-rth-minimum-queries-6odfap</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/count-substrings-starting-and-ending-with-same-character-5oqjcv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/sql-query-for-user-purchases-and-favorite-packages-ihp9ui</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-largest-element-in-bitonic-array-l6fjck</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-elements-with-absolute-difference-greater-than-or-0vjwje</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/character-alterations-needed-for-anagrams-90aiqm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-distinct-pairs-with-target-absolute-difference-kj2pgd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-corrupt-node-in-bst-wrrsb0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/binary-search-on-a-sorted-array-ctaef5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/e-commerce-platform-sql-queries-1s6tpm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/how-do-you-implement-graphs-92iqus</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/can-you-find-the-no-of-nodes-in-a-linked-list-without-f65ytn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-the-minimum-largest-group-size-sharing-a-single-1gz2wb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-the-connected-component-with-the-largest-sum-of-1tejyj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-the-permutation-of-a-number-with-the-smallest-magnitude-jjkx2q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-the-range-of-indices-for-a-target-in-a-sorted-array-o0dusk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximize-buckets-where-all-occurrences-of-a-digit-are-in-the-tsl9oy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/convert-an-n-ary-tree-into-a-binary-tree-p0fp71</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/build-a-wall-with-specific-brick-constraints-5s04an</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/multiply-a-number-by-7-or-8-without-the-multiplication-k11nbd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/implement-the-brainvita-game-logic-mmr8xl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-elements-of-an-n-x-n-matrix-in-spiral-order-r0bx3d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-all-subarrays-whose-sum-exceeds-a-given-value-68w5la</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/calculate-running-average-from-a-stream-of-numbers-sdhjv0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-path-with-minimum-product-of-edge-weights-2zriqc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/assign-student-grades-based-on-numerical-marks-1vtcaa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/calculate-additional-spend-required-to-make-total-price-a-6tkwfo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-the-longest-increasing-subsequence-7tp492</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-minimum-length-unsorted-subarray-that-sorts-the-array-s3ar6z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/add-a-digit-to-a-number-represented-as-a-linked-list-ki80cs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/determine-if-two-binary-trees-are-identical-3phrss</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rotate-matrix-elements-by-a-given-distance-s2htgc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/calculate-connection-depth-between-two-linkedin-users-1am047</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/shortest-period-with-upload-rate-meeting-threshold-2fjymo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/max-score-in-two-player-coin-picking-game-02nh2e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/maximum-product-path-in-hierarchical-block-structure-tv0e2u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/sum-of-remainders-from-1-to-n-divided-by-div-lenr8h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/maximum-length-increasing-path-sequence-with-difference-of-1-0ukwxt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/swap-two-numbers-in-multiple-ways-kr5ec4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/minimum-number-of-steps-to-convert-an-array-of-zeros-to-o17h1h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/remove-contiguous-duplicate-characters-from-a-string-utugl8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/detect-cycles-in-a-graph-5wa93n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/preorder-traversal-of-a-binary-tree-hl21cy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/minimum-number-of-swaps-to-convert-a-string-to-its-anagram-j5r0o7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/palindrome-pairs-in-a-list-of-words-o2hi5m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/convert-binary-tree-to-binary-search-tree-9tkh3f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-missing-and-repeating-number-in-consecutive-array-e46kc1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/count-pairs-with-given-sum-in-an-array-3q1tpb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/coin-change-minimum-number-of-coins-8qb1l9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/insert-a-node-into-the-middle-of-a-linked-list-iw4kfx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/kruskal-s-algorithm-and-networking-applications-fxgx5o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/count-set-bits-and-find-absolute-value-b22wi2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/detect-loop-in-a-linked-list-without-using-external-8ey6gi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/binary-search-tree-traversal-implementation-and-complexity-tba3a4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/hash-table-vs-binary-search-tree-trade-offs-ksw4ui</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximize-number-by-swapping-two-elements-or-bits-z6qt18</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/pairwise-swap-elements-of-a-given-linked-list-p97obr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-incident-and-outgoing-edges-for-a-node-in-a-directed-m4s1yd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/largest-rectangular-area-in-a-histogram-v0ya1e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/top-10-frequent-words-in-a-stream-at-every-instance-pjt3tr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/store-a-very-big-number-exceeding-standard-data-types-u5q7t0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/analyze-time-complexity-of-recursive-function-2l12dh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/set-the-nth-bit-in-a-32-bit-integer-scwi6c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/reverse-level-order-traversal-with-left-to-right-child-wj1xd7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-connections-in-a-growing-pentagon-pattern-j2l4rn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/largest-sub-square-matrix-with-all-1s-8an7am</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-row-with-maximum-1s-in-a-binary-matrix-88r7tx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-characters-to-append-to-make-a-string-a-palindrome-7ntow9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-occurrences-of-a-word-in-a-2d-matrix-wvr6ow</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/allocate-3d-array-using-pointers-82is9y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/tiling-problem-ebn8g7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/api-data-extraction-and-sorting-bvy7qn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/longest-path-in-connecting-cities-38ko2m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/frequency-of-k-in-an-array-jb2ecu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/square-root-with-precision-u6vfp4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/snakes-and-ladders-378ns3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/sum-of-differences-of-repeated-elements-xy7tax</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/reverse-decimal-number-using-bitwise-9av4yt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/remove-duplicates-from-dll-9mxyxq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/draw-bst-from-flattened-array-0oysh0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/subarrays-with-sum-k-42f1ky</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/max-absolute-difference-of-counts-k0vlsi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/compare-two-numbers-without-operators-a8s22o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/convert-to-mirror-tree-9tzcdv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/determine-type-of-number-array-order-8c5p1g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/longest-palindromic-subsequence-and-file-palindrome-rp81zi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/minimum-distance-pairs-in-array-and-semaphores-0awron</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-moves-to-equalize-apples-in-baskets-ajn73t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-string-to-url-format-dnzkg7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-day-with-maximum-hotel-occupancy-d9ipuk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-first-sibling-in-binary-tree-with-parent-pointer-9s11c7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/draw-circle-given-radius-and-center-mzwtu7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-optimal-build-order-for-dependent-packages-lmc16f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/spiral-order-traversal-of-binary-tree-97dybm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-prime-and-non-prime-orders-h7nbx6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-all-left-leaves-in-binary-tree-ib7t2v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/evaluate-arithmetic-expression-string-ohz3sc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-jumps-to-reach-array-end-6x1iyc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/generate-non-overlapping-on-call-schedule-56wbq4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/shortest-path-search-with-dijkstra-s-algorithm-xnz4k0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-time-to-rot-all-oranges-7ok5r2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sum-of-nodes-at-distance-k-from-target-node-9gftnz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-median-of-1-billion-numbers-034sho</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-stack-push-and-pop-using-linked-list-l5re7a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-squares-from-1-to-n-in-o-n-time-9oi4cf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-position-of-a-target-number-in-a-sorted-version-of-an-twvk5o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-top-k-users-with-the-maximum-number-of-words-spoken-in-95r48b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/count-valid-escape-routes-from-city-c-to-hometown-h-based-on-2mcnhj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/minimum-gas-station-stops-to-reach-destination-we2bne</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-the-date-of-the-first-monday-of-a-given-month-and-year-m2y8yj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-starting-index-of-a-string-in-an-alphabet-matrix-hjx5ny</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/print-linked-list-elements-in-reverse-order-iteratively-0sgogn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/lowest-common-ancestor-of-two-nodes-in-a-bst-y8gu8b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/explain-bfs-traversal-on-a-directed-graph-kqe0yp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/print-all-prime-numbers-smaller-than-n-lzvik9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/tree-serialization-traversals-and-reconstruction-from-n5zgpo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-k-smallest-elements-in-a-continuous-stream-of-integers-sh5nty</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/replace-binary-tree-node-data-with-child-sums-or-propagate-jne2cc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/merge-strings-with-minimum-cost-and-implement-heap-jl8itb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-first-non-repeated-element-in-a-continuous-integer-uwv8ps</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/check-if-two-binary-trees-are-mirror-images-b9p4um</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/convert-a-sorted-array-into-a-wave-array-amt5qz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/print-numbers-from-1-to-200-without-using-any-loops-9d3bop</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/sum-of-n-ary-tree-node-values-after-capping-child-values-by-ylqge9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-the-tallest-building-within-2d-rectangle-queries-cah9qa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/median-of-two-sorted-arrays-of-the-same-size-9b8ft8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/queue-based-approach-for-first-non-repeating-character-in-a-qsp22q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/count-of-smaller-or-equal-elements-in-sorted-array-k4nay7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/maximum-size-square-sub-matrix-with-all-1s-fy4i9l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/compare-bst-and-hash-map-4r0oy4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/count-ways-to-reach-the-nth-step-with-1-or-2-steps-zq0zrp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/derive-time-complexity-of-recursive-fibonacci-ype8re</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/dynamically-allocate-a-k-dimensional-array-linoq0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/model-student-course-relation-and-query-enrollments-ful34p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-a-string-using-a-stack-hc1pds</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-longest-common-subsequence-of-two-strings-mt36z3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/implement-disjoint-set-union-dsu-p1xd7e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/sum-of-consecutive-numbers-greater-than-or-equal-to-k-f68ian</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/shortest-substring-containing-all-english-alphabets-ig132k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/basic-linked-list-operations-bu6wzm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/digital-root-of-a-number-xuu7l3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-missing-number-in-array-of-1-to-n-1rxmar</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/compute-memory-size-of-an-arbitrary-object-x3lre6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/search-in-rotated-sorted-array-without-finding-pivot-6f07bm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/mean-and-median-of-dynamic-stream-25ec6p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/order-teams-such-that-each-lost-to-the-next-cyk0a9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/knight-s-tour-problem-on-an-8x8-chessboard-40llmk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/duplicate-every-occurrence-of-2-in-place-hzls7f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximize-ad-effectiveness-with-cooldown-interval-5yld98</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/topological-sort-of-a-directed-acyclic-graph-fy0rw3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/count-contiguous-subarrays-summing-to-k-u5n1sx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/check-if-a-graph-is-bipartite-avcu71</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-k-most-frequent-numbers-in-an-array-pm7yyj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/count-word-occurrences-from-a-log-file-6q2dsv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/detect-loop-in-a-linked-list-without-fast-slow-pointers-30d3nh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-all-exe-files-across-nested-folders-bz66a4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-an-element-in-a-binary-tree-in-o-1-time-qxqfa8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-duplicate-strings-and-frequencies-without-hashmap-or-1u944a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/insert-into-sorted-linked-list-in-o-log-n-ny87cz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/count-elements-formed-by-adding-subtracting-values-kq76bc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/even-numbers-at-even-index-odd-numbers-at-odd-index-0jpmvy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/print-nodes-at-distance-k-from-a-given-node-oc3cux</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/count-subsequences-with-sum-x-rbjvq7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/merge-one-array-into-another-tfq0we</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/connect-nodes-at-same-level-with-constant-extra-space-aebf5e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/evaluate-postfix-expression-tett2m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/kth-largest-element-in-bst-with-constant-space-nnlxz7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/reverse-first-k-nodes-of-a-linked-list-6v4tb4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/maximum-sum-subarray-with-negative-numbers-sp26bd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/remove-minimum-size-subarray-to-make-sum-divisible-by-k-z2wtw1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-string-using-greedy-method-ln1tje</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/print-reverse-level-order-traversal-from-parent-array-eie8bj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-square-root-of-an-integer-j5o02w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-sum-path-in-a-2d-matrix-y2onx3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-largest-number-smaller-than-n-with-same-digits-ori0ya</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/largest-k-numbers-in-a-stream-c03r8h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-range-containing-elements-from-k-sorted-arrays-3fu89t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-valid-words-from-dictionary-in-2d-character-matrix-5zj3kk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/lattice-points-on-a-circle-qgrnn7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/min-flips-for-alternating-string-wqp3nq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/max-stolen-value-from-houses-f75ntp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/fibonacci-for-large-n-2oa597</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/swap-x-and-y-without-conditionals-ehk7l6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/longest-zig-zag-subsequence-7825kd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/tic-tac-toe-optimal-move-cdos9l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/linear-search-in-linked-list-7q9gyi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/pre-order-traversal-of-bst-73gqxb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/betting-game-simulation-an7b25</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-ranges-in-an-integer-array-onn4p8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-string-based-on-custom-priority-string-f4oglv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reservoir-sampling-hvv7q7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/generate-valid-parentheses-permutations-esh0j5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/update-bst-node-with-sum-of-greater-nodes-2ywp0t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/inorder-successor-in-bst-7wm42k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/invert-every-k-elements-in-a-list-q2rcmj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-smoke-from-merging-jars-o2mh3m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-3-or-more-consecutive-duplicate-characters-as03zo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/matrix-summation-challenge-before-matrix-from-after-matrix-80a8wv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/employee-work-approval-system-lca-6mmxp0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/josephus-puzzle-in-o-1-time-complexity-n6685w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/linked-list-palindrome-check-from-string-r2mkdu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/seating-arrangement-with-vaccinated-and-non-vaccinated-j5qw0j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/rain-drop-problem-nml9mp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/rotate-an-array-by-k-positions-v353uq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/get-distinct-items-appearing-only-in-the-second-table-y4tvo5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-fixed-point-in-a-sorted-array-o3d6t3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/design-a-stack-supporting-getmin-and-popmin-in-o-1-qpx8ao</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/print-organizational-hierarchy-0e6ko9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/search-in-a-bitonic-array-xn27xy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-i-th-smallest-number-across-given-intervals-ykku6m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/inorder-successor-in-binary-tree-with-parent-pointer-3cztv8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-nodes-that-are-leaves-with-null-right-children-dvn5ub</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/zig-zag-diagonal-traversal-of-a-matrix-e0opgj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/store-and-retrieve-numbers-in-2d-space-in-optimal-time-q403md</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/detect-loop-and-find-start-node-in-linked-list-82rpcj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/mathematical-proof-of-floyd-s-cycle-finding-algorithm-9aocuy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/internal-working-of-hashmap-with-custom-equals-and-hashcode-5bi4jp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-duplicate-files-in-a-directory-hdgs1m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/add-1-to-a-number-represented-as-linked-list-3ufmdq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/best-time-to-buy-and-sell-stock-ii-8f7kxp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-characters-by-frequency-with-single-occurrences-last-5p7h2k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-any-subsequence-with-zero-sum-ikw1m8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-balanced-parentheses-expression-with-o-1-space-gpn2ej</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/schema-creation-and-data-retrieval-with-inner-join-xreb0j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/recursively-remove-adjacent-duplicate-characters-9bai4n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/house-robber-maximum-stolen-value-from-houses-3yt4je</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/substring-search-using-pattern-matching-0icy1c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/find-customer-information-from-october-sorted-ascending-tdv1im</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/barclays/find-the-longest-word-in-a-sentence-lvs0sv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/swap-two-numbers-without-using-a-temporary-variable-ml39zu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/print-a-right-angled-star-pattern-m0l1kn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/approach-to-binary-search-1bq9ch</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/check-if-every-computer-in-a-network-is-connected-to-every-uo19cv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/convert-a-hexadecimal-string-to-a-decimal-string-n71bvl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/starting-index-of-subset-whose-sum-is-closest-to-zero-i357yv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/inversion-count-in-an-array-using-merge-sort-f5fkxn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-kth-largest-element-in-a-bst-without-modifying-the-tree-26qh9q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-repeating-and-missing-numbers-1ghj8l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/design-a-data-structure-with-o-1-insert-delete-search-and-ay1jmg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/design-a-stack-supporting-getmin-in-o-1-time-and-o-1-extra-c7kv1b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/count-possible-ways-to-construct-buildings-qady7s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/check-if-all-leaves-in-a-binary-tree-are-at-the-same-level-9fv0a1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-next-greater-number-with-the-same-set-of-digits-sim1du</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/search-for-a-string-in-each-line-of-a-file-in-python-csqpx7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/reverse-words-in-a-character-linked-list-lvcn2n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-index-triplets-where-val-c-val-a-val-b-nen7nz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/determine-if-two-binary-trees-are-mirror-images-ngov1g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-the-missing-number-in-an-arithmetic-progression-8e1q7t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/diagonal-sum-of-a-binary-tree-85agrp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/print-all-factors-of-the-number-9-g256mk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/swap-two-numbers-without-a-third-variable-or-arithmetic-amm0im</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/find-largest-and-second-largest-numbers-in-an-array-0kz6c1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/double-matching-valid-numbers-and-shift-zeros-we7wkl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-j-i-with-arr-j-arr-i-tx2bkc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/word-wrap-formatting-hdf8om</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/merge-sort-for-linked-list-and-array-xjwf77</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/stock-buy-sell-to-maximize-profit-o7tvyp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/range-sum-using-segment-tree-sbp7y6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/tower-of-hanoi-ny1cng</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/check-balanced-parenthesis-6903rw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/multiply-two-numbers-using-minimum-additions-4c8cko</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/pairs-with-sum-k-bik3cr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/2-s-complement-of-a-boolean-string-jwp7gn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/gcd-of-two-numbers-1sr3e0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/maximum-of-three-using-ternary-operator-mcbam3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/segregate-red-blue-and-black-balls-4xe42p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-unique-file-names-in-directory-structure-512u3f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/kth-smallest-element-in-two-sorted-arrays-dr42da</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/reverse-linked-list-without-returning-head-5l1gqj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/reverse-level-order-traversal-ytuz50</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/serialize-and-deserialize-bst-for-network-transmission-027l6u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-percentage-word-matching-z487k1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/generate-ugly-numbers-in-ascending-order-weer71</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/model-scenario-using-graph-and-topological-sort-f5p5ch</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/schedule-maximum-meetings-in-k-rooms-ktrb26</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/pattern-matching-with-custom-regex-1wvohv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/generate-n-numbers-with-given-k-factors-0qf395</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/height-of-tree-and-minimum-leaf-level-kl1urm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/separate-red-and-blue-balls-with-minimum-swaps-c1ftuc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/nodes-at-k-distance-from-root-ma2na1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/excel-column-name-from-number-2ypvex</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-array-elements-row-wise-or-column-wise-o68hqo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rasterize-line-on-computer-screen-putv79</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/minimum-adjacent-swaps-to-make-palindrome-typh03</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/multiply-numbers-without-arithmetic-operators-fnea34</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/tree-and-graph-algorithms-ddmkb5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/steps-to-reach-diamond-m8kkhm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/recursive-function-analysis-it6dtm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/matrix-traversal-simulation-umdv9v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/count-pairs-with-even-odd-sum-5iu9z3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-rooms-for-requests-y2qedp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/stack-and-queue-implementation-og7is4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/max-average-marks-by-id-1dihu4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/running-average-b9t0hm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/first-non-repeating-character-cwars7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-grandparent-in-table-0aq9kj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/subset-check-3uzaf0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/add-days-to-date-at0has</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/maximum-common-path-z9edzv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/convert-to-custom-number-system-j8gjrb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/closest-square-2900cd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/compare-large-files-al29f6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/linked-list-implementation-d14c4v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sql-query-for-2nd-highest-salary-82fl4g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/armstrong-number-program-4o0u82</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/print-odd-occurrence-of-numbers-in-order-of-occurrence-4ltuch</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/implement-kruskal-s-minimum-spanning-tree-algorithm-bhj9vl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-anagrams-3cp5j2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/basic-concepts-and-programming-questions-0hpybp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/add-natural-numbers-up-to-n-in-binary-5jzir4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/calculate-sum-of-ai-aj-for-an-array-we7st4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/swap-two-numbers-factorial-and-prime-check-ex6no3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/determine-the-diameter-of-a-tree-b54ttv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-pairs-of-anagrams-line-by-line-sn8y00</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-array-elements-by-frequency-and-descending-value-t4re1p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-maximum-loss-in-buying-and-selling-stocks-qjztr7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/execute-processes-given-a-resource-allocation-graph-slqvd4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-binary-representation-of-a-number-is-a-palindrome-r8heub</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-balanced-parentheses-in-a-java-code-string-j67971</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/number-of-students-unable-to-get-preferred-tiffin-fzt4ag</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-starting-index-of-consecutive-winning-sequence-of-1982i1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/insert-interval-into-a-set-of-non-overlapping-intervals-2b34ty</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/insert-into-a-sorted-circular-linked-list-without-head-vg5mcu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/sum-of-n-terms-of-an-arithmetic-progression-kn58mi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/find-common-elements-of-two-arraylists-5ah6a4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/hosoya-s-triangle-va78yo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-an-element-where-the-sum-of-left-and-right-subarrays-6ojtn1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/convert-a-given-binary-tree-to-doubly-linked-list-gb37py</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/count-distinct-elements-in-every-window-bgknb6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-whether-an-array-is-a-subset-of-another-array-v1mzac</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/count-number-of-subarrays-having-a-given-xor-eqfbi3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/print-nodes-at-odd-levels-of-a-binary-tree-l1vlxp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/anticlockwise-spiral-printing-of-a-matrix-5u4roz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-common-elements-in-linked-lists-l5ncja</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/merge-sort-on-a-linked-list-kon3da</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-words-in-a-sentence-nwib9z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/insert-into-bst-and-print-sorted-order-7uqjxg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-the-kth-largest-element-in-a-linked-list-without-extra-rz41up</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/find-the-longest-palindrome-in-a-string-682euy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/divisibility-by-7-in-range-l1gu67</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/efficient-factors-of-a-number-sddtw4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-distance-between-two-words-in-a-string-uuic6a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-difference-between-two-arrays-74ret7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/calculate-researcher-s-h-index-8nkv3i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/balance-an-imbalanced-bst-a4ymog</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/measure-45-minutes-using-non-homogenous-ropes-b8wfg6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/minimum-number-of-chairs-required-52w69y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-nodes-to-turn-on-all-edges-in-a-tree-ie03gr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximize-xor-of-2-numbers-znv46o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-valid-string-outcomes-with-frequency-counts-k9ig79</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-strokes-to-paint-buildings-1oiunb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/balancing-of-parenthesis-2cyjqm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-row-with-maximum-ones-in-2d-array-be5345</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/dynamic-2d-array-allocation-and-deallocation-b12xxd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-an-averaging-filter-on-an-image-p16nn6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-queues-using-linked-list-237bl0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/calculate-number-of-set-bits-ilmen6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-missing-digit-in-second-array-8kscw8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/square-root-of-n-nkb89j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/optimal-palindrome-check-ec1kjo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/fibonacci-series-wjf6wi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sql-queries-for-string-matching-w8m3qo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/string-rotation-check-nba4ok</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/binary-equivalence-set-np1d9t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/histogram-volume-difference-lcbi0b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/print-triangle-of-height-n-h60lp2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/prime-number-digit-manipulation-vunw6b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/largest-sum-subsequence-without-adjacent-elements-5hc78u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/min-area-uncut-rectangle-cutting-kvaad1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/maximum-in-subarrays-of-size-k-qhp6v5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/max-absolute-difference-between-nearest-smaller-elements-azzya2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/day-of-the-week-from-date-uq57jm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/merge-sort-of-two-linked-lists-e56ret</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-smallest-element-in-rotated-sorted-array-5v2985</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/swap-two-elements-in-singly-linked-list-llprx7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-strtok-function-bk2i04</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/detect-cycle-in-singly-linked-list-lof58x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/evaluate-infix-expression-dxui1x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/count-subarrays-with-at-least-one-bad-pair-bhx0df</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/kmp-pattern-searching-and-non-overlapping-matches-isb0ea</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/diagonal-traversal-of-binary-tree-nw5m9j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/dice-throw-problem-pdaz50</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/maximum-distinct-elements-after-removing-k-elements-n6vf0j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/generate-next-unique-permutation-of-array-89ixkd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/generate-all-combinations-of-balanced-parentheses-znri5j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/asteroid-ball-collisions-with-strength-reduction-ruv0ut</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/count-horizontal-trapezoids-from-cartesian-points-jnte4p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/construct-nested-json-from-relational-path-equations-ft30u3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/design-a-data-structure-supporting-enqueue-dequeue-find-and-8xbv0r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/probability-of-survival-of-a-person-moving-n-steps-on-a-o59lki</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/minimum-number-of-platforms-required-for-a-railway-or-bus-ee8kxi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-an-element-where-left-sum-equals-right-sum-ucg2p3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/sum-of-all-leaf-nodes-in-a-binary-tree-dhtj9p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-missing-variable-in-x-y-z-qor6ca</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-derangements-of-a-set-of-elements-lfo8oe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-page-faults-using-lru-cache-yy6vi2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-k-digit-substring-with-the-second-highest-frequency-9hzqxs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-number-of-delivery-blocks-required-to-schedule-u6youy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-connection-request-can-be-sent-within-k-degrees-of-xls3oy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/construct-all-structurally-distinct-binary-trees-with-n-rj59um</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/determine-build-order-of-a-module-given-its-dependencies-e76n1s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-lengths-of-non-overlapping-contiguous-subarrays-with-ksc5a4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-cost-to-reach-the-last-station-with-chocolates-onl3ko</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-a-pair-with-given-sum-and-triplet-with-sum-zero-y4ff3w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/smallest-value-of-x-where-f-x-0-for-a-monotonically-64lciq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-infix-expression-to-postfix-expression-5eu9yk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/asteroid-collision-problem-using-stack-60y4vn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-and-print-an-input-string-qx67dy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/describe-the-kmp-algorithm-6058r4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-pair-with-sum-zero-or-closest-to-zero-qttxl9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-pair-with-largest-possible-positive-product-c75cq1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-longest-circular-chain-of-strings-86egmx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/partition-array-into-two-subsets-with-equal-sum-without-aqmr8q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/print-duplicates-from-a-given-string-1z5kzc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/first-negative-number-in-every-window-of-size-k-1acaea</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-remove-loop-in-linked-list-and-floyd-cycle-proof-yhk23t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/intersection-point-of-y-shaped-linked-list-mrsh3t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/maximum-even-number-by-swapping-digits-once-1rbzi1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/minimum-distinct-elements-after-removing-m-items-8q8ttu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/website-log-analytics-queries-n7swvh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/avl-tree-working-and-code-gvqi4z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/binary-search-in-linked-list-wb2ap2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/largest-strictly-increasing-contiguous-subarray-with-one-my7vrn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/implement-inheritance-in-code-34wdoo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/implement-stack-and-array-operations-z7vwop</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/finger-counting-puzzle-yg4yrw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/inorder-traversal-iterative-5tr3dc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/bit-swapping-fg9hgn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-cost-of-path-with-default-weights-xd6n8h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/decrypt-substitution-cipher-without-spaces-4wygjr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-2nd-largest-element-with-minimal-comparisons-7lux57</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/synchronize-download-and-ui-threads-without-java-sync-3mbiwn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/reduce-linear-search-loop-comparisons-to-one-lcre7w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/anagram-check-and-alphanumeric-sorting-vnaha6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/union-of-two-arrays-and-java-core-cnduv0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/boundary-traversal-and-java-8-209bkl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-swaps-for-balanced-parentheses-ewzs3l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/normalization-binary-tree-traversals-and-mirror-tree-i08080</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/implement-an-sql-query-using-custom-data-structures-3a2go9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/implement-dynamically-expandable-hybrid-array-linked-list-x3s1be</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/calculate-total-profit-percentage-for-farmer-land-prices-8jq64w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/divide-a-set-of-coins-into-3-equal-parts-yraa5h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/check-if-an-array-is-sorted-using-recursion-w2kqjy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-minimum-and-maximum-of-a-binary-tree-q1v7wb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/minimum-petrol-pump-stops-for-round-trip-across-cities-8iuttx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/check-if-a-number-is-even-or-odd-nov4zf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-name-of-hr-in-hr-department-oyt1t3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-possible-decodings-of-a-given-digit-sequence-dgpjk5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/solve-for-x-in-an-addition-equation-string-ik1ory</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-steps-to-reach-target-by-a-knight-v983il</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reverse-a-linked-list-in-groups-of-given-size-udle2w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-deepest-left-leaf-node-in-a-binary-tree-a008lm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-whether-two-binary-search-trees-are-identical-s2qtkv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/kadane-s-algorithm-based-question-oh2pis</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/reverse-a-number-reverse-a-string-and-check-for-palindromic-4zdfll</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/print-all-prime-numbers-from-1-to-20-rxq0bq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/check-given-string-is-palindrome-or-not-r6in8m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/remove-duplicates-from-an-array-4pd7gk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/power-of-a-number-using-divide-and-conquer-uoitj9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/recover-bst-with-two-swapped-nodes-i5yumg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-arrays-of-sum-n-where-elements-are-greater-than-3-dpu1wn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-total-set-bits-from-1-to-n-95j43h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/task-scheduling-ordering-with-dependencies-hwh3j0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-level-with-maximum-nodes-and-return-sum-of-its-nodes-ypk8yn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/divisibility-printing-variant-for-7-and-5-65bm67</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-any-path-in-a-maze-from-source-to-destination-cc1f4l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-if-number-z-has-x-y-z-and-x-and-y-0-ar6654</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/count-pairs-with-arr-i-arr-j-arr-i-and-arr-j-2ehmls</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/represent-number-as-sum-of-consecutive-natural-numbers-nmv35q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/reverse-a-string-and-optimize-swap-using-xor-n17lzm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/print-all-possible-subsets-and-derive-subset-count-1700eb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-trie-insertion-deletion-and-prefix-search-1yyp7k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-steps-to-reach-destination-on-number-line-0lq6gh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-profit-from-buying-and-selling-stock-2gvu4g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/print-numbers-containing-1-2-and-3-in-ascending-order-ekovc3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-next-greater-permutation-number-from-string-f3yt9t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-getmin-for-a-stack-lq25u0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/cancel-consecutive-identical-numbers-more-than-3-times-candy-jbor6n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/design-a-shuffled-playlist-58sx5c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/write-program-for-factorial-of-a-number-in-notepad-izdc5s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/implement-kadane-s-algorithm-and-reverse-linked-list-1y9tpu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/system-calls-and-array-manipulation-w1z12q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/dsa-debugging-and-git-udqjf3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/replace-all-0s-with-8-in-a-number-without-string-conversion-4mykxy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/armstrong-number-implementation-and-explanation-p27fet</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-if-an-integer-is-present-in-a-string-using-polymorphism-lvbiv1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/count-racers-with-faster-start-and-slower-end-times-mf5b3c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-rank-of-an-element-in-a-bst-in-less-than-o-n-time-47cjad</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/optimize-a-loop-multiplying-1000-elements-using-multi-3ey2p4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/reduce-employee-capacities-based-on-manager-capacity-e1ekrd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/maximum-height-among-buildings-inside-specified-rectangles-5tl48s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/maximum-of-minimums-of-all-subarrays-of-a-given-window-size-ot3xz6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/check-if-array-elements-can-be-paired-with-even-sums-ho7eha</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/minimum-character-removals-to-make-string-non-palindromic-5exji2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/minimum-cost-to-satisfy-house-energy-requirements-co84rv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/find-first-non-repeating-character-in-a-string-n5o2ck</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/delete-the-middle-node-of-a-linked-list-8bklzy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/smallest-window-in-a-string-containing-all-characters-of-6ns1gq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/next-greater-element-for-every-element-in-an-array-l7kdd6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/minimum-cost-to-move-beyond-array-boundaries-cn5b0v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/modular-exponentiation-for-large-numbers-5th52r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/invert-array-bits-based-on-equal-adjacent-neighbors-1gkqqs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/calculate-hamming-distance-between-two-integers-sootu4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/maximum-product-submatrix-anchored-at-top-left-index-47nste</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/find-the-number-of-islands-in-a-2d-matrix-zc5rrq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/linked-list-optimization-and-stack-problem-491qgb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-missing-number-in-an-arithmetic-progression-ap3vsw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/apply-merge-sort-on-a-linked-list-16hf19</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/fetch-modify-and-update-csv-file-data-2mulij</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-all-palindromic-substrings-within-length-range-j5f862</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/hash-table-implementation-for-character-counts-e7qqyo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-sorted-substrings-in-a-string-18v0n1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/optimized-prime-number-generation-algorithm-h40wzc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/rotate-an-array-left-or-right-vcl72f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/query-doctor-department-and-patient-names-5a3fe1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-alternate-vertical-sum-of-a-binary-tree-2h7vfq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/maximum-sum-path-in-a-pyramid-5icfzu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/sort-an-array-and-discuss-sorting-algorithms-2gt9xh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/sort-a-linked-list-sorted-by-absolute-values-4vzz9s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/check-if-second-string-can-be-formed-from-first-string-in-r6tpmb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-largest-element-for-each-row-in-a-matrix-jgw65z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/traverse-a-matrix-efficiently-x0leow</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/minimum-distance-in-a-grid-with-obstacles-ov3ggw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/minimum-steps-to-reach-destination-floor-using-up-and-down-6v37zm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-row-with-maximum-number-of-1s-in-a-sorted-boolean-f7jpce</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/rod-cutting-to-get-length-n-with-minimum-cost-e2k4vn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/minimum-operations-to-reach-target-number-using-add-subtract-4dai32</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-n-th-largest-element-from-a-stream-of-integers-sfxg5t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/check-if-a-point-lies-inside-a-triangle-vj9dcn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/implement-an-arraylist-using-a-custom-data-structure-em4jic</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/best-fit-crate-allocator-data-structure-dko1kj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/connect-nodes-at-the-same-level-ra6zlk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-number-of-islands-and-the-size-of-each-island-hce4cy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sliding-window-maximum-of-all-subarrays-of-size-k-pgqy66</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/merge-m-sorted-linked-lists-without-extra-space-i6hlui</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/generate-integers-0-to-7-using-an-unbiased-coin-toss-4fwdu3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/optimized-triangular-mesh-from-planar-points-fzg3dp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/intersection-of-two-lines-in-a-plane-ms2jkk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-generic-sort-function-like-qsort-w6wqvb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/count-ways-to-travel-cyclic-path-in-n-steps-on-triangular-vgs70m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/4sum-jdzcn9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/zigzag-conversion-of-string-hip4nw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/print-or-generate-fibonacci-series-qc92ip</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-the-smallest-missing-positive-integer-0tb59g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-the-number-occurring-an-odd-number-of-times-il4xip</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/summary-ranges-formatted-as-a-string-cca7cr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sudoku-solver-87rh7e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/maximize-minimum-distance-between-two-cities-in-a-circle-408c7b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/non-crossing-handshakes-around-a-circular-table-5w7gew</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/save-hostages-with-minimum-cost-using-soldiers-izaty8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/convert-infix-to-postfix-and-postfix-to-infix-rrr8fd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-nth-element-in-k-fibonacci-series-0i8irh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/petrol-pump-problem-imwjk2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/lowest-common-ancestor-in-a-bst-5804fe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/median-in-a-stream-of-integers-75zd0a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-the-nth-highest-salary-using-sql-wucdx1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/normalize-a-database-table-with-normal-forms-k42rgi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/string-decoding-c619es</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/clone-a-linked-list-with-next-and-random-pointers-in-o-1-p84sfa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/pattern-matching-in-a-string-n4dgzc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/minimum-left-rotations-to-make-all-string-characters-same-eps5ta</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/graph-coloring-shortest-path-variation-0qndbf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/search-in-sorted-rotated-array-xbqp9e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/valid-string-check-fy6vbd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/substring-count-from-rearranged-string-m4jjud</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/random-number-generator-t3mhnn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/k-sum-paths-sz8ezu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/transform-to-sum-tree-variant-f1g4m8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/sum-of-numbers-divisible-by-7-62rwo7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/sequence-generation-vcax6j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/merge-sort-and-heap-sort-w90k1t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/lru-cache-and-unix-command-kdysn6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/generic-stack-x6vhyr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/check-for-armstrong-numbers-3h9lli</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/variable-width-set-top-box-arrangement-8989lr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-three-elements-such-that-a-b-c-qk2pyw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/modify-specific-bit-in-binary-representation-g5rz5z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-slope-changes-in-points-along-a-linked-list-yl4pn1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-all-permutations-of-a-string-ey99xt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/subtract-two-numbers-without-arithmetic-or-increment-br7wwu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/remove-duplicates-in-sorted-linked-list-e0ijzp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/find-k-nearest-values-to-n-in-a-bst-6fdj5t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/design-a-data-structure-with-insert-check-if-exists-and-kth-9u6uz2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/print-all-permutations-of-a-string-and-recursion-memory-611ir4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/reach-matrix-boundary-with-color-transition-rules-c1ec49</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-depth-from-source-vertex-in-undirected-graph-6no1ux</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/transform-string-x-to-y-using-append-and-reverse-append-gr1673</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/subarray-sum-equals-k-nkgyw8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/reorder-linked-list-l1-ln-l2-ln-1-lg0lut</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-the-m-th-element-of-array-after-k-left-rotations-62ozsr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/build-an-expression-tree-with-multiple-bracket-types-ley1z3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/longest-subarray-with-sum-0-in-binary-array-5vdksd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/sorting-algorithms-implementation-and-complexity-u9rvfa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/word-recommendations-containing-search-string-i9304j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/count-palindromic-numbers-with-maximum-difference-condition-t8rf9m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-frequency-of-elements-from-0-to-n-1-in-o-n-time-and-o-1-8ojfir</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/merge-two-unsorted-arrays-in-place-kghf57</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/perimeter-traversal-of-a-binary-tree-clockwise-hvff9f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-character-changes-to-make-strings-anagrams-epd88l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/rotate-string-left-and-right-jzlkc6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/array-queries-with-repetitive-updates-9ugr9k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/bellman-ford-algorithm-vs-dijkstra-op612s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/traveling-salesman-problem-variant-without-returning-home-i7732j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-every-k-digits-in-a-string-8b47u0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-departments-without-female-employees-1h8oru</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-managers-who-hired-employees-in-the-last-six-months-e4ayp5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-missing-and-repeating-element-in-1-to-n-array-kl0xom</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/print-numbers-from-scrambled-string-in-decreasing-order-z7m31b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/count-pairs-with-sum-equal-to-k-in-sorted-array-ohb73d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/implement-binary-search-in-three-lines-2e1492</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/merge-two-data-files-and-sorting-strategy-0pp410</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/sql-query-to-find-people-from-specific-cities-q1w49e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/valid-password-and-arctic-temperature-tracker-coding-with-eh3nx3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/remove-duplicates-string-reversal-and-sql-sub-queries-lpfjy9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/intersection-of-two-linked-lists-and-valid-island-count-in-x8burh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sudoku-backtracking-algorithm-v1r7v3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/pseudo-code-verbal-game-based-aptitude-and-behavioral-08s0ea</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/matrix-navigation-and-minimum-changes-to-reach-destination-k402lx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/minimum-semesters-to-complete-all-courses-given-y5sx4q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/most-beautiful-path-in-a-directed-graph-z02pzc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/print-all-possible-palindromic-strings-y88xnn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/remove-duplicates-from-unsorted-array-and-sort-descending-yh6fkm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-kth-smallest-element-using-min-heap-sq9vv8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/combinatorics-with-binary-search-and-exponentiation-93akug</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/sum-of-leaf-nodes-at-minimum-level-oo80x3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/convert-sorted-linked-list-to-avl-tree-70a8e5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-prime-numbers-in-range-with-digit-constraints-poc0k2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/unique-subarrays-with-odd-number-count-condition-bhr59e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/shortest-path-in-a-maze-without-standard-algorithms-5qcr8m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-minimum-at-every-index-in-a-stack-with-o-1-space-rv5lkg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/check-if-a-given-string-is-a-palindrome-r6odgc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/longest-consecutive-sequence-in-unsorted-array-3kqsdd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/calculate-power-of-a-number-using-divide-and-conquer-rwdy8c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/detect-errors-in-binary-tree-represented-as-tuple-yuzm3y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/order-cricket-tournament-teams-based-on-match-results-ss92tn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-packets-for-wrapping-z0bfzx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/circular-petrol-pump-dno1tt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-length-subarray-sum-676gi1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/handle-exceptions-in-code-t0q7xc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/product-of-three-numbers-without-multiplication-08xoyx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/min-absolute-difference-between-3-sorted-arrays-zfas2i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/add-1-to-a-linked-list-a5yznc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/median-in-a-stream-of-numbers-s7bf3v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-string-without-stl-vt6xvm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-element-occurring-less-than-k-times-7nevhs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/linked-list-and-tree-operations-yq6hqo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/target-pair-sum-and-power-calculation-8ui7pc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-student-name-by-join-date-mcw6pw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/calculate-semesters-needed-to-complete-courses-with-53uatn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/select-and-pair-cartons-from-an-incoming-stream-within-1rklgy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-number-of-distinct-groups-with-size-at-least-k-and-9uy2if</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/standard-parenthesis-checker-using-stack-avyt6b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/recursive-function-to-print-numbers-1-to-n-and-n-to-1-8bsspi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/detect-cycle-in-directed-graph-73vjhm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-a-peak-element-in-a-given-array-n0wmtx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/print-alternating-even-and-odd-sequence-8g3lel</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/find-two-numbers-with-specific-sum-and-print-distinct-7l1uxp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/find-the-missing-number-from-1-to-n-u0eqv3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-skips-to-arrive-at-meeting-on-time-bo76ua</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/binary-tree-fire-burning-time-n15q7f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/chessboard-key-movement-bcoz5r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/minimum-frequency-occurrence-234anb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/union-intersection-and-backspace-string-compare-f4qe63</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/double-value-b-on-array-match-jhfe43</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/coconut-shop-mood-changes-63x26z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/reverse-vowels-in-each-word-of-a-string-3au5n8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-nearest-k-sellers-to-a-fulfillment-center-o5qhnw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/key-pair-5aozzy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/robber-problem-8aegrt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/all-type-of-tree-traversals-ke5uw5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/generate-fibonacci-series-methods-2rtmvp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-3rd-largest-element-in-an-array-lzm17o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/array-shrinking-7r0m48</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/union-of-two-sorted-arrays-2uhzwr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-memcpy-2p3bii</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/lca-of-n-ary-tree-6oq7uw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/dp-principles-a8dl2y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/matrix-path-counting-ny9uhy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-stack-njtw1s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/pots-of-gold-game-0g176k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/array-assignment-00v9kd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/score-reachability-24xsfv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/modify-tree-sum-swo3rb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/droplets-in-pipe-v2vstd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/first-negative-in-window-u9vppm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/spiral-matrix-x8p38z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/largest-sub-matrix-of-1s-l9lxej</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sub-arrays-exceeding-sum-fvh2f3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/elements-at-height-x-pag2za</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/shortest-path-in-graph-l0nyjy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-initial-energy-x5adah</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/birthday-party-toy-distribution-x1lbps</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/pangram-missing-letters-13ekyq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/smallest-subarray-with-sum-1ryuw9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-flips-to-make-binary-string-alternate-nk00l4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/intersection-of-two-arrays-b2ipnk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/building-bridges-dynamic-programming-problem-rz5ljw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/time-complexity-of-randomized-quick-sort-p2n0so</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/prime-number-pairs-differing-by-two-p1u89m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/product-of-all-array-elements-except-current-1xz0ky</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/evaluate-an-arithmetic-expression-string-pobd4h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/design-data-structure-for-student-subject-queries-noof1t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/infix-to-postfix-conversion-7mowaj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/minimum-distance-between-a-pair-of-numbers-vl6a31</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/frequency-of-each-character-in-a-string-iwk22n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/count-subarrays-with-sum-divisible-by-k-jm718t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-row-with-maximum-zeros-in-binary-matrix-ty6rf8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/python-features-and-data-structures-s7hwug</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/max-substring-with-equal-0s-and-1s-and-minimum-steps-to-make-zyzi9n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/stock-buy-sell-and-first-unique-value-in-stream-5dr4e5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/shortest-path-and-dp-with-dfs-coding-7e1a7f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/second-smallest-element-and-team-with-maximum-wins-yc1ei1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/memory-payment-calculation-0vqvu2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/stack-implementation-tg0c1b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/string-combinations-gj4kjf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/bst-verification-zz3r0c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/file-system-path-printing-f5ew3x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/first-duplicate-index-l0xhkk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-jumps-v99jrd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/max-rating-sum-hjcfd3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/max-diametric-sum-is6zt6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/non-defeatable-pairs-kik6ly</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-element-in-2d-matrix-using-binary-search-xl8831</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/working-of-built-in-sort-quick-sort-and-binary-search-lhjyf1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/jump-game-check-if-can-reach-end-qt9wny</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/final-cell-after-following-movement-commands-3t1chi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximize-gap-by-shifting-k-meetings-kgb7lc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/largest-submatrix-with-sum-less-than-k-z57hld</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/stream-of-numbers-returning-max-n-elements-in-a-window-x7pl68</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/set-next-pointers-of-tree-nodes-dgq2hj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/print-tree-level-by-level-like-leaf-removal-reverse-dcazh7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/minimum-number-of-hotel-rooms-required-ezp341</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/diameter-of-binary-tree-and-bst-balancing-s4k9wa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-last-k-lines-from-a-file-coin-change-and-vertical-tree-2k1xz0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/optimize-linear-search-and-cpp-program-crash-scenarios-y5uwia</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-a-string-without-built-in-java-functions-z199ur</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-number-of-matching-words-between-two-files-iwsv66</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/javascript-intricate-form-validation-dozx9i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/algorithm-used-to-sort-a-graph-kgsey2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/sql-query-to-sum-salaries-for-employees-with-specific-name-c2pvb7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/modify-array-elements-and-shift-zeros-to-the-right-t7ld4n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-index-difference-such-that-arr-i-arr-j-gjt4x6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/extract-leaf-nodes-of-a-tree-into-a-linked-list-q7ksyn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/check-valid-parentheses-7zp936</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/circular-array-rotation-z8buqf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/reverse-given-numbers-iwf72t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/maximum-sum-of-subarray-with-no-duplicates-n8csga</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/shortest-leaf-node-distance-7leqtg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-bridge-in-a-graph-ugr0b7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-all-left-leaf-nodes-ed4j5f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-all-duplicate-subtrees-611ckt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-elements-where-a-b-c-d-0-9vet4r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-increasing-subsequence-of-size-3-u64hiy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/add-three-linked-lists-0muqfq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/diameter-of-binary-tree-3x28z4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/number-of-ways-to-reach-i-j-mnwh76</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/delete-leaf-nodes-em5va0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/delete-nodes-not-on-k-heavy-path-iwvs9w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/min-element-in-rotated-sorted-array-l9n7s5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/divisibility-by-3-for-bit-stream-m10rov</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/file-handling-in-cpp-92pyrp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/max-profit-in-job-scheduling-11nrwv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/sorting-algorithms-with-least-time-complexity-dd1ynt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/make-a-sorted-linked-list-into-a-balanced-tree-2lb890</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/second-max-element-in-bst-1viagv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sort-an-array-with-odd-numbers-left-and-even-numbers-right-tz003z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-memory-conflicts-based-on-thread-logs-m35rum</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/turn-an-image-by-90-degree-6g64zx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/level-order-traversal-using-queue-and-recursion-7c4n5i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/delete-a-node-in-single-linked-list-mc0t56</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/calculate-depth-or-height-of-a-tree-l3d4gh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/add-two-numbers-represented-by-reverse-linked-lists-3quv69</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/print-nodes-in-top-view-of-binary-tree-r0q4xm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/convert-ipv4-to-ipv6-address-25ytum</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/length-of-last-word-in-a-string-0uif7v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/create-a-linked-list-node-and-detect-cycle-zx8jla</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/swap-msb-and-lsb-of-an-integer-and-detect-endianness-nwn8wx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/reverse-line-and-replace-character-ntr3y2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/sorting-algorithms-pseudo-code-and-complexity-uh3u52</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-all-triplets-in-an-array-azrw2v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/lexicographically-maximum-array-with-index-swaps-zl662p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/shortest-path-in-graph-with-gcd-edge-condition-nsho0p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/assign-nodes-to-two-boxes-without-edge-conflicts-m2yon6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/divide-array-into-k-continuous-subarrays-with-odd-sum-s0yt36</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-bracket-deletions-for-valid-sequence-g3tdh2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/coin-change-ways-to-sum-s-qb4z81</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/multiple-coding-and-database-queries-7x401o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/boundary-traversal-of-binary-tree-and-count-decodings-53bj60</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/jumps-median-of-stream-and-min-cost-path-6zvi0d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/deletion-of-nodes-in-a-range-5wqhwb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/odd-even-sum-problem-r20apj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/sql-group-by-query-t94z0x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/print-the-alphabet-n-9axa7c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-sort-using-rev-nv3g1r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-of-sliding-window-3hy5zj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/children-sum-problem-variant-hpn2dp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/prime-number-g0gq7l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/regular-expressions-and-inheritance-assessment-8yp1vu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/browser-back-and-forward-feature-implementation-k2kdu2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-power-of-4-greater-than-n-g47ac0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/coin-exchange-and-replacement-dp-7ax8ys</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/snake-and-ladder-game-minimum-moves-qvjy0o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/replace-is-with-are-in-string-86srnd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-word-indexes-within-limit-n-g9ovs1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/sudoku-possible-elements-eehu09</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/shortest-route-in-a-character-matrix-g5kr9v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/lowest-common-ancestor-in-binary-tree-and-bst-uk0nch</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-missing-numbers-in-arrays-78p0cm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/first-missing-positive-number-with-negatives-ctc68y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/real-time-example-of-bitwise-algorithm-kh6vo6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/construct-tree-from-array-and-node-to-root-path-aec7p8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/product-of-factors-and-primes-modulo-10-9-7-k25e35</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/generate-equal-probability-from-binary-random-sk74sk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/string-permutations-and-length-3-permutations-5regjv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/check-bst-without-extra-space-ty9gya</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/determine-if-linked-list-is-circular-rjf9b8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-nth-number-containing-or-divisible-by-k-ksj8r3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/add-two-binary-numbers-represented-as-strings-lzda4o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sum-of-all-nodes-that-have-no-child-at-minimum-level-l5tqs2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/connect-next-left-node-and-level-boundary-pointers-381lzb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/implement-alt-tab-functionality-vk61b2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/print-all-nodes-at-distance-k-from-a-given-node-z6h0hu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/nagarro/quicksort-algorithm-explanation-and-coding-problem-02xla2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-if-two-trees-are-identical-cmxw8v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/print-path-between-any-two-nodes-in-a-binary-tree-3aoipd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/count-minimum-number-of-fountains-to-be-activated-d5lg8q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-linked-list-without-extra-space-mx4zlv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/diameter-and-lca-of-a-tree-375zvw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/randomize-array-and-permutations-p924pz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-islands-in-2d-array-4co6fz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/minimum-key-presses-in-a-circular-playlist-z6im8g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/queue-implementation-and-bst-operations-crhb27</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/prefix-search-data-structure-6hnacp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/facebook-friend-search-198dtt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-meetings-in-one-room-k3s6fc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/reach-a-number-on-a-number-line-sms721</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/smallest-substring-with-all-characters-eab7as</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/dictionary-word-transformation-hu8twx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/string-palindrome-check-blzj0h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/add-two-numbers-without-plus-operator-e7debl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/binary-string-expression-evaluation-vhke9d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sentence-reversal-59xc06</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-two-expression-trees-are-equivalent-uha7s4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/retrieve-data-in-sql-with-program-qpg9hx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/reorder-linked-list-alternating-ends-wai4zr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/minimum-cost-to-travel-from-station-0-to-n-1-7rjb1z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/length-of-path-connecting-two-nodes-in-binary-tree-bj586s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/earliest-non-repeated-character-in-continuous-stream-8zzm6i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/stack-applications-in-strings-and-product-shipping-in-51mn8e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/flip-zeroes-for-max-consecutive-1s-2stgfy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/circular-petrol-pump-tour-j7z4pd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rightmost-set-bit-6uy4zc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/large-number-sum-79y495</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/string-processing-17anyv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sum-of-non-common-elements-in-two-arrays-uba3pq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-n-digits-to-get-minimum-number-kc9ey8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-duplicate-rows-in-binary-matrix-6bcz3h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/number-of-islands-using-dfs-cof7wi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-common-substring-fmkk3m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/tokenize-string-with-quotes-eq7ui1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/output-of-printf-with-increment-operators-49w05q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/infix-to-postfix-expression-e65ux3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/binary-tree-to-doubly-linked-list-blvoc6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/extract-version-from-string-6f9poz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/implement-graph-node-37orgz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/swap-adjacent-nodes-lqi9jd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/replace-word-in-files-kqy27w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/delete-node-without-head-pointer-12cqvj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-distance-seat-placement-2rzov3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/basic-c-programs-y05lns</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/maximum-perimeter-sum-of-rectangles-from-stick-lengths-and-y3ilbx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/closest-difference-of-two-array-numbers-to-a-given-number-nske86</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/knapsack-problem-and-array-string-coding-46rv8d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/character-frequency-and-ip-address-validation-4tjkl2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/islands-adjacent-duplicates-and-clock-angle-fd2akr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/thread-safe-hashmap-and-word-frequency-in-o-n-650eno</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/time-for-signal-to-fill-array-wy7125</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/password-validation-regex-sl25r1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/snake-and-ladder-dice-throws-hcuaz9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/average-of-ascii-characters-7imu2q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-k-nodes-in-a-linked-list-1iel8j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-a-sentence-dhtg1b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-sentence-preserving-whitespaces-qkso8g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/binary-tree-node-connectivity-s52u0o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-last-character-in-mixed-byte-string-34pb52</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/populate-right-pointer-in-binary-tree-wen4w8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/correct-dll-with-one-random-pointer-z8long</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/next-larger-palindromic-number-0sscpl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/maximum-cars-at-any-moment-zczh76</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/producer-consumer-implementation-bf7k33</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/spiral-printing-of-matrix-i5lgsp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/lcm-and-hcf-calculation-izh4us</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/max-length-repeated-non-overlapping-substring-zl9gt1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/consecutive-natural-numbers-sum-ym1fw2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/rectangle-sum-in-2d-matrix-ad3lsv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/linked-list-loop-and-start-point-97ilz7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-excel-column-name-and-number-eh6ml2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/explain-deadlock-ta9ysj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/hashmap-and-linked-list-5p6hel</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/water-jug-problem-puzzle-my75zv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/cpp-latest-version-and-features-s973dz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/max-and-min-sum-subarray-of-size-k-cciy4r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/maximum-length-of-identifier-z8ly2n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/auto-keyword-zqvb0z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/what-is-a-token-90m9dy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/explain-recursion-m3h0gl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/write-an-infinite-loop-lzi1o0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/virtual-function-in-cpp-po054e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/exception-handling-and-differences-2te8j5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/container-class-i15iyl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/tie-in-cpp-hey2pn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/longest-subarray-of-1s-with-one-swap-qdu0ea</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/sorting-array-manipulation-7pw1mf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/maximum-subarray-sum-2ag4pl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/most-frequent-ip-in-log-file-vjhpx2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/custom-parseint-implementation-in-java-z33b07</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/decode-string-recursively-3nfb84</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/compute-average-without-overflow-fw8kx8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/string-palindrome-and-recursion-iued5l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/parenthesize-expression-to-maximize-value-4xcx8a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/find-two-missing-numbers-in-array-rxlkk3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/tree-traversals-implementation-jhki7d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/coding-and-spring-boot-api-flow-sp5sqs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/linked-list-and-tree-traversal-3pcjh0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/median-in-a-stream-g8odls</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/search-and-sort-algorithms-4cdclf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/file-validation-algorithm-j18asv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/subsets-and-sql-aggregation-st6hgr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/search-hashmap-and-js-internals-1c9i0h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/remove-nth-node-from-end-of-list-3e4zlg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/maximum-subarray-26rqnz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/binary-tree-to-bst-conversion-e8huvw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/convert-email-to-masked-format-b8nywm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/matrix-zero-set-3fbgpe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/form-two-numbers-with-minimum-sum-from-digits-ja2d07</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-distance-and-pairs-in-array-iolsf4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-shifted-string-version-9b4ntk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/substring-matching-algorithm-r67r23</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-node-in-circular-linked-list-65okem</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-height-stack-of-rectangles-2taqpl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/valid-parentheses-combinations-sy6kp0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/implement-stl-list-class-3kv41n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/insert-element-at-kth-position-in-linked-list-si1455</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-cousins-of-node-in-binary-tree-2a03gt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-common-elements-in-two-large-arrays-vzjos1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/pairwise-swap-elements-of-linked-list-a7p4za</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/maximum-stolen-value-from-houses-4oeo3n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/kth-element-from-end-of-linked-list-2v63iq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/palindrome-pair-in-array-of-words-16qwyt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/optimal-game-strategy-470gc0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/lexicographical-string-minimization-06q0ou</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/temple-offerings-ir22lg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/javascript-and-inheritance-t6ulm2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/linked-list-and-recursion-263rxy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/camel-pascal-snake-and-kebab-case-conversion-kj5t3o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/use-and-types-of-data-structures-ftr8sz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/define-binary-search-tree-29bvhp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/exception-handling-implementation-56ob5q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/string-pool-in-java-1iz8kg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/list-operations-and-tuples-7w9but</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/python-decorators-w9jzl4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/count-numbers-in-range-with-specific-digits-odkm7n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/top-five-occurring-words-in-a-file-1cfc6u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/min-jumps-array-jqme9t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/gray-code-problem-ff0fii</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/print-leaf-nodes-q7cb60</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oyo/min-absolute-difference-hd3tyb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/valid-password-checker-91q8ef</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/explain-pointers-en8q77</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-the-nth-bit-of-a-number-q0h7ai</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/8-bit-register-precision-allocation-d0qak8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/difference-between-void-main-and-void-main-void-zq4fwa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/difference-between-list-and-tuple-82b967</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/pointers-and-dangling-pointers-1q289m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/traverse-a-linked-list-jlv9rx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/palindrome-and-fibonacci-odkb7i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/nth-floor-egg-break-problem-ll8wym</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/database-normalization-and-joins-rgfx4c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/add-a-new-node-in-a-linked-list-qf4weg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/python-vs-java-execution-speed-92cbns</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/vector-resizing-in-cpp-eyo4uj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/compare-library-versions-p9r3ls</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/move-semantics-in-cpp-tuf8tw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-postorder-from-inorder-and-preorder-without-building-wic4zv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/rotate-2d-matrix-by-90-degrees-bi9udm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/print-characters-in-a-string-using-ascii-code-nr7qgq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/range-sum-query-in-an-array-s7lmrn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/parse-floating-point-numbers-from-a-stream-xjr73o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/lru-and-lfu-cache-implementation-uv4jwa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/thief-escaping-jail-walls-48d5m1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-element-at-position-after-sorting-5llrut</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maze-exit-and-house-robber-kh6c3d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/string-duplicates-and-random-set-mvg2hd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/stock-buy-sell-maximum-profit-4zwifr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-sub-string-in-a-string-ga1uyc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/minimum-distance-between-two-given-characters-of-a-string-gi4y8q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-different-numbers-of-vowels-in-a-given-string-gxxg2o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/minimum-appends-to-make-string-palindrome-wpil14</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/convert-bst-to-max-heap-qz5yko</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-top-k-numbers-in-infinite-stream-3unokv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/multiply-2-numbers-using-bitwise-operator-4z25ou</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/clone-a-linked-list-with-next-and-arbit-pointers-5ov7qy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/delete-nodes-in-bst-within-range-5k1n1j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/diagonal-sum-of-binary-tree-y4390d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-the-second-largest-number-in-an-array-without-sorting-6s7234</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/fix-react-bugs-o1l6ow</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/koko-eating-bananas-and-validate-bst-otgn25</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/spirally-traversing-a-matrix-and-longest-increasing-5n74qd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/longest-line-of-1s-and-number-of-islands-9e0zxa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/sort-array-of-0s-1s-and-2s-and-check-palindrome-strings-w0659z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/employee-hierarchy-bonus-allocation-gt1ea5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/matrix-transformation-and-scaling-kg2vf8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/top-k-words-in-a-stream-fw0iqw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/interpolate-missing-timestamp-values-from-lists-3nh4xv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/directory-path-pattern-matching-ohxqa9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-building-space-in-a-rectangular-city-map-xccn2j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/code-version-diff-tool-kqb3e5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-min-and-max-of-an-array-in-one-traversal-gke4el</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/maximum-number-of-squares-on-a-chessboard-x9s1cv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/generate-connectivity-matrix-from-a-tree-using-preorder-g6u9xm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/move-all-zeros-to-the-end-of-an-array-kln787</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/candies-distribution-among-students-x476i1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/backend-technologies-sql-joins-and-second-largest-salary-czeu6s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/partition-equal-subset-sum-cie5ld</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/capacity-to-ship-packages-within-d-days-875sqf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/find-lca-in-a-binary-tree-pt9qer</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/topological-ordering-3i0v9j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/data-structures-for-boggle-game-r6eeb2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/number-of-distinct-paths-between-n-points-4pbwxh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/capgemini/cumulative-sum-and-self-join-3v504p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/printing-largest-sorted-nodes-in-bst-jem7ba</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/lexicographical-comparison-of-strings-in-linked-lists-7mnd2s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-stack-using-queue-and-reverse-it-21c8pp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-word-search-using-linked-lists-and-arrays-tx8ad5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-next-closest-greater-time-83q5q7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/java-concepts-and-java-memory-model-cqyq96</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/retain-and-delete-elements-in-a-linked-list-mebz7f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-number-formed-from-array-of-numbers-v5enuh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shuffle-song-ids-from-an-array-k05dwh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/move-duplicates-to-the-right-589ypf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pair-sum-count-bqe3de</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/construct-binary-tree-from-inorder-and-postorder-9qitey</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/least-common-ancestor-of-a-binary-tree-b0cqef</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/prime-factorization-and-armstrong-numbers-uvba5n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-contiguous-elements-with-maximum-sum-l9v5f7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-odd-and-even-numbers-sequentially-using-two-threads-4z8li7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/flatten-a-linked-list-with-next-and-child-pointers-8x6vnr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/ibm/find-common-elements-of-three-sorted-arrays-qfccw2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/code-and-execute-pascal-s-triangle-o12b9s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-lcm-of-two-numbers-without-gcd-ujemz9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/longest-substring-repeated-more-than-twice-ucd74n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/length-of-shortest-subsequence-not-in-order-tprt5p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maximum-achievable-profit-visiting-cities-with-treasure-and-07ogri</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-all-pairs-in-sorted-array-adding-up-to-target-sum-0macan</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/online-coding-assessment-hp115e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/group-problem-solving-lv8569</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/recognize-bleak-numbers-tkrn25</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/merge-adjacent-elements-based-on-conditions-r24s8f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/sum-of-two-fractions-represented-as-arrays-ershd9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/circular-tour-visiting-petrol-pumps-with-minimum-utilization-7fo117</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-common-subsequence-xv7c8b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/form-internet-resource-address-from-string-9d2n6m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/modular-exponentiation-x-y-mod-z-kpsy35</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/dependency-ordering-using-topological-sort-ytuu0y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-count-elements-using-binary-search-vdh00k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/add-all-greater-values-to-nodes-in-bst-9tq9wf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/check-equivalence-of-lcm-sets-of-two-arrays-r4ymqw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimize-cost-of-repairing-unsafe-roads-paq1cq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/reconstruct-sentence-from-misplaced-spaces-using-dictionary-2qfp7h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-stolen-value-from-non-adjacent-houses-ld4e0v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/determine-ascending-order-of-elephants-from-height-6ngrlc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-source-node-in-dag-in-linear-time-vmh568</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/separate-odd-and-even-numbers-in-sorted-order-63pzl3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/time-complexity-of-sorting-algorithms-0zrk84</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/java-collections-framework-and-built-in-data-structures-rea2d2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/concept-of-dynamic-programming-i4geca</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/working-mechanism-of-hashmap-uy4gys</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/girls-in-tech-hackathon-e1ia7t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/reverse-a-string-recursively-without-extra-variables-jm1gjb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/eliminate-duplicate-characters-from-string-a9u820</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/generate-symmetrical-number-pattern-43iboi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/check-if-two-trees-are-mirror-images-u7kdrn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/alternate-positive-and-negative-integers-u0fako</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/populate-sibling-pointers-in-binary-tree-yban10</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-two-unique-numbers-in-array-15klu4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/inorder-traversal-of-custom-modified-tree-4zrq3y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/k-means-clustering-implementation-723j99</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-longest-word-in-string-0jni4c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/longest-subarray-sum-equals-k-2xtb8j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-height-of-a-staircase-tqwh01</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-pivot-in-a-rotated-sorted-array-6exjk5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/equilibrium-index-in-an-array-h3g200</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-size-subset-for-a-given-sum-cl5f0w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/staircase-jump-combinations-hwkgf9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/ternary-search-implementation-lsfv8j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/middle-element-of-a-linked-list-pq0h2j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/largest-subarray-with-equal-0s-and-1s-nw9dox</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-a-stack-without-extra-space-i0v4i8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-bst-keys-in-a-given-range-0m1lq1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/remove-consecutive-repeating-characters-v06vlm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-cells-with-zero-based-on-manhattan-distance-to-ones-93ky8k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-second-largest-and-kth-largest-element-in-a-bst-0pc96b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/valid-parentheses-variant-6qfn5w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/convert-string1-to-string2-using-progressive-character-pelcb1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/maximum-tree-diameter-given-level-node-counts-q6q0ka</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/dutch-national-flag-algorithm-4vd1ld</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/inorder-postorder-and-preorder-tree-traversals-sqmt0r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/bubble-sort-algorithm-and-complexities-s3608g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deutsche-bank/character-occurrence-and-index-with-oop-concepts-skzq0u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/encapsulation-explanation-and-code-implementation-e7olry</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/print-first-10-prime-numbers-efficiently-3zo7a8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/print-inverted-right-pyramid-star-pattern-wb593b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-distance-between-two-words-in-a-dictionary-u6j7mb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-special-nodes-in-a-binary-tree-r8l8ld</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/segregate-even-and-odd-elements-in-a-linked-list-0ef65r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/calculate-square-root-without-using-sqrt-y5rv6x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-regex-substring-matching-with-anchors-f8bytr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rotate-square-image-90-degrees-clockwise-4q9w4z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/merge-two-bsts-in-o-logn-24x4b4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-element-occurring-more-than-n-2-times-ave0nn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-intersection-point-of-two-line-segments-b29y97</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-occurrences-of-the-digit-2-from-1-to-n-lzx5vo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-fibonacci-series-considering-all-solutions-19ojaw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/iterative-inorder-traversal-of-a-binary-tree-fjza66</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/add-1-to-a-number-represented-as-a-linked-list-1siupv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/count-n-bit-binary-numbers-without-consecutive-1s-q5v0gw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/draw-a-line-segment-on-a-monochrome-image-matrix-am09y7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-a-hash-table-with-o-1-recent-element-retrieval-0vhvt8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/search-in-an-array-with-adjacent-difference-of-1-j8zwoy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/convert-a-number-to-negative-base-2-t546wg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/delete-node-given-only-pointer-to-that-node-un1rsx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-a-star-rhombus-pattern-f340yq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/convert-number-to-words-cmg6o2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/format-string-with-initials-e0wuz0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-a-stack-using-another-stack-wg1n93</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-a-linked-list-using-merge-sort-72q8q8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/detect-and-remove-loop-in-a-linked-list-s2lllf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-all-root-to-leaf-paths-of-a-binary-tree-9ptt87</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/implement-a-queue-using-stacks-ah95f6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-the-mirror-of-a-bst-c5hpsn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/0-1-knapsack-problem-implementation-kjslc3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/sort-an-array-by-frequency-of-elements-f8gbd5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/calculate-the-diameter-of-a-binary-tree-da58iv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/implement-a-queue-using-an-array-mp0rw9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-appends-to-make-a-string-palindrome-54ecxj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/separate-vowels-and-consonants-in-a-linked-list-83vxx7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-one-string-is-a-rotation-of-another-v9h7yh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-word-in-dictionary-formed-by-other-words-fu5jcd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/number-of-paths-in-a-grid-from-top-right-to-bottom-right-u409qt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/minimum-square-size-to-fit-n-rectangles-7dlcfv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/insert-a-node-after-kth-position-in-a-doubly-linked-list-ip9o0i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/count-nodes-at-even-height-in-an-m-ary-tree-2e8yqj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/sort-first-k-elements-ascending-and-remaining-descending-znvsk2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-subarrays-of-alternating-monotonic-sequences-epnj73</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-rectangle-with-corners-as-ones-in-binary-matrix-umo2cm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/search-value-in-level-order-sorted-complete-binary-tree-450btt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-triplets-with-sum-smaller-than-target-s6qwzl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/shortest-loop-with-maximum-happiness-in-weighted-directed-vh165b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/integer-solutions-to-sum-of-squares-equation-q4dnxv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/explain-breadth-first-search-bfs-yyz51y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/next-smallest-palindrome-greater-than-a-given-number-w5p1dq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/find-the-two-highest-salaries-in-an-employee-table-del5ix</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/smallest-possible-integer-by-rearranging-digits-gni5gn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/max-sum-in-a-connected-component-vz6813</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimize-the-maximum-group-size-after-splitting-1ah8mv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/wave-array-9lctzl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/time-required-to-infect-all-people-in-a-grid-segs5q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-a-pair-with-given-target-in-bst-bde4nz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-unique-ids-after-removing-m-items-w34egy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/count-unique-words-with-limited-consecutive-vowels-ti3cr6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/supported-vs-bleak-numbers-lx0jtf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-next-missing-number-in-sequence-22w3rs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-students-belonging-to-both-groups-0wrp0m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-window-substring-containing-all-characters-wo18w3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-coins-collected-traversing-a-grid-d9z00h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/solve-problem-via-sql-query-instead-of-dsa-rlug1c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/quicksort-iterations-on-an-array-q0zysa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/calculate-nth-or-mth-number-from-series-based-on-parity-0kl2uu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/sort-array-in-descending-order-of-element-frequency-0p7t94</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-next-greater-palindromic-number-represented-as-string-70qwpw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-steps-for-a-knight-on-a-chessboard-71s1h7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-median-in-a-stream-of-numbers-4bn3nx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-sum-with-no-adjacent-elements-house-robber-xlddw1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-profit-from-multiple-stock-transactions-1epx3z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/range-maximum-query-with-point-updates-dm0ii6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-single-non-paired-element-among-adjacent-pairs-fpvax2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/rearrange-array-with-no-adjacent-duplicates-65ibn5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/distinct-numbers-in-array-aakq6x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/number-of-bit-flips-oxl7a6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/palindrome-conversion-tj42ab</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/dice-roll-mean-1lt79a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/replace-question-marks-gzpzf2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/decrypt-string-zfaio0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-anagram-substrings-ou8pl3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/k-most-repeating-lines-p8bnyd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/valid-word-from-characters-t18ofl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/currency-notes-sum-13yeqa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-consecutive-subsequence-n4cbwe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/sort-an-array-using-three-approaches-xyx6le</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/pointer-arithmetic-and-2-s-complement-p2fkyi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/prefix-to-postfix-expression-conversion-gs9sx7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/n-ary-tree-implementation-and-traversals-xxo1pa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/palindrome-number-and-next-palindrome-qb4lxy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/binary-tree-sum-property-dw8ua3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/multiple-of-3-from-infinite-boolean-stream-7opmck</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/ceiling-in-sorted-pivoted-array-and-endianness-za2x2q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/car-fine-collection-based-on-date-682shx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/evaluation-of-infix-expression-b0z4yy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-k-digits-to-form-smallest-number-2llipe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-mirror-binary-trees-1hmgx8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/word-break-problem-with-ways-count-yx6g9c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/distinct-numbers-and-max-in-window-of-size-k-8vxtxq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/safe-points-and-speed-game-ways-k2mk4v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/power-of-2-array-and-oops-inheritance-5db8ek</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/collinear-point-verification-z9jkmu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/toggle-0-and-1-without-conditionals-n7zqzq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/two-table-sql-join-query-8gv70s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/replace-repeating-characters-with-a-single-hash-symbol-wes0wj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/path-sum-from-root-to-target-in-binary-tree-2u9s7n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/construct-bst-and-skewed-bst-from-sorted-array-xjucp2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/pair-in-sorted-array-with-sum-closest-to-target-h9w4u3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/find-starting-index-of-all-zero-sum-subarrays-02u3yo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/repeatedly-remove-consecutive-identical-integers-2fx2xy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-product-of-3-numbers-in-an-array-l5pejh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-destination-airport-from-flight-routes-17ydry</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/calculate-score-for-integer-n-using-unique-pair-dynamic-u7f0bp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-starting-and-ending-index-of-a-target-value-in-a-sorted-f8knox</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/modify-palindrome-to-lexicographically-smallest-non-w2h1zo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimize-array-sum-after-k-operations-ux69or</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/convert-bst-to-sorted-doubly-linked-list-in-place-d0gq09</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-money-looted-from-non-adjacent-houses-1jozln</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/segregate-and-reverse-even-positioned-nodes-in-a-linked-list-4s1q5a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reconstruct-flight-route-from-tickets-oj82az</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-squares-to-fill-an-axb-rectangle-z4xaha</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-non-attacking-knights-on-an-nxn-chessboard-765pcz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/select-k-random-numbers-from-a-stream-a41e5g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/string-matching-percentage-across-arrays-dss2lz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/determine-if-numbers-in-a-large-array-are-prime-gh416c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/employee-work-locations-using-dijkstra-s-algorithm-ydc0es</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/critical-connections-in-a-network-using-tarjan-s-algorithm-qujx0q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/standard-sliding-window-with-map-egwz1r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/greedy-array-optimization-with-cost-minimization-czfa3v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/unbounded-knapsack-problem-gst0gx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rotting-apples-in-a-2d-grid-f6ggmg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/height-of-a-binary-tree-with-leaves-forming-circular-dll-2bol63</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximize-consecutive-1s-by-flipping-at-most-k-bits-wif6zg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-lexicographical-permutation-of-a-string-mf94iz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/mirror-of-an-n-ary-tree-fgiw5s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-two-nodes-are-cousins-in-a-binary-tree-uf29er</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-an-array-of-0s-1s-and-2s-in-one-pass-xwdjq2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/random-node-and-kth-smallest-element-in-bst-f7ezgz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/spiral-order-traversal-of-a-square-matrix-8iuzjo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/detect-cycle-in-an-undirected-graph-1zmmey</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-circular-tour-that-visits-all-petrol-pumps-0nddk7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-path-sum-in-a-binary-tree-f0dwrp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reduce-the-string-by-removing-k-consecutive-identical-k22uob</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-in-array-where-adjacent-elements-differ-by-1-r9cjge</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-path-with-maximum-apples-in-an-n-ary-tree-4b6lkv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/seat-allocation-with-maximum-distance-to-others-1omsa8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/producer-consumer-problem-implementation-without-busy-mjy0z1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-for-majority-element-in-a-sorted-array-su8637</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/add-two-matrices-34tbzy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/implement-linked-list-with-deletion-and-cycle-detection-in-9tif9x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-the-winner-with-maximum-votes-lnfr0c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/word-ladder-shortest-transformation-path-between-two-words-c511h5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/house-robber-in-a-circle-and-straight-line-ybk258</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-dynamic-1-d-and-2-d-arrays-z3vask</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-custom-memcpy-and-strcmp-0l68ni</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/form-paragraph-using-given-alphabet-cubes-5ypwjl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/determine-if-a-road-with-circular-potholes-can-be-crossed-g44d1m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-bst-in-100-bytes-of-memory-iw0292</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-if-a-string-is-a-palindrome-i1jv9a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/burst-balloons-break-piggy-banks-for-maximum-money-4bda8k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/largest-square-matrix-embedded-in-stacks-of-bricks-j46o95</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-array-after-converting-elements-to-their-squares-be7tnq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/burn-a-binary-tree-starting-from-a-target-node-wtno0n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-all-root-to-leaf-paths-as-linked-lists-s1nvyv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/calculate-total-call-duration-per-call-id-from-timestamp-ady7ze</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-next-smallest-palindrome-larger-than-given-number-ooaf70</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/string-matching-condition-with-pairs-qfky4l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maximum-rows-with-all-1s-after-t-column-flips-j9pt3w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/quick-sort-and-linked-list-reversal-2prcek</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/left-outer-join-sql-problem-4sxwsi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/create-employee-table-and-delete-record-query-eugn71</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/custom-fibonacci-series-code-l8huds</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/bus-stop-routes-0bttct</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/distribute-n-candies-to-k-children-7c8cjx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/majority-element-nz79yj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-element-in-a-stack-p9kf0f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/sort-array-without-built-in-functions-430qon</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/bit-manipulation-tasks-zfj1t7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/missing-and-repeating-element-in-an-array-kc1qnc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/find-pairs-whose-sum-equal-to-a-target-sum-qy2ow3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/find-longest-palindromic-substring-in-an-array-egy45k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/longest-path-in-a-2d-matrix-with-obstacles-x9n5fw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/print-first-two-and-last-two-characters-of-a-string-5v9ekn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/right-most-node-in-last-level-of-complete-binary-tree-i46y3y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/count-accepted-strings-of-length-l-in-a-dfa-w1q5f9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/modified-camel-and-banana-puzzle-yd1u0d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimize-total-distance-for-four-friends-meeting-in-a-2d-r8exic</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/mirror-a-binary-tree-with-parallelization-pep7cn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-a-pythagorean-triplet-in-an-unsorted-array-iy6o1g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/time-needed-to-inform-all-employees-without-a-given-head-8jtlxn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/count-n-digit-binary-strings-without-consecutive-zeros-9a9saw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/count-ternary-strings-without-consecutive-zeros-and-three-3gctgr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/verify-consistency-of-inequality-equations-sy9w24</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-first-index-where-current-character-is-smaller-than-ox1258</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/implement-next-and-hasnext-iterator-for-a-frequency-encoded-o5074h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-palindrome-partitions-of-a-string-pm6ai5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-shortest-subparagraph-containing-n-given-words-lkr3d6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-in-an-array-that-first-increases-and-then-decreases-jk8s7g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-month-calendar-for-an-alien-calendar-system-v8ikv9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-all-permutations-of-a-given-string-y89j93</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-kth-largest-element-in-an-incoming-stream-of-928kkb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-alphabetical-ordering-of-characters-from-alien-r3og69</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-total-anagram-pairs-in-an-array-of-strings-fb3hs4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/predict-string-concatenation-output-in-java-e5g8tm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/calculate-length-of-a-given-string-literal-90mm91</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/index-of-modified-character-in-a-palindrome-c0zx20</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/form-a-palindrome-6h3r42</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/print-character-frequencies-in-order-of-occurrence-o7mvjc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/print-bst-keys-in-the-given-range-sv171z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-the-highest-repeated-character-in-an-array-88hae3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/delete-a-node-given-only-a-pointer-to-it-nl6vey</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/check-if-a-number-is-a-power-of-2-ylvfc5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-a-number-is-prime-ifl326</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-digits-and-alphabets-in-a-string-ll49bk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-words-with-custom-priority-rules-d9flgc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-substrings-divisible-by-8-prga47</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-number-of-distinct-elements-in-an-array-or47j9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-characters-in-a-string-with-no-adjacent-duplicates-wtwh8w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-elements-in-index-range-in-constant-time-431lxk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-k-unique-characters-substring-4oufz9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/shortest-path-in-a-weighted-graph-using-dijkstra-s-algorithm-5fs9zq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-a-linked-list-by-interleaving-ends-a3ddt1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/construct-bst-from-preorder-traversal-vp1p18</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/connect-n-ropes-with-minimum-cost-gc9sww</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-pythagorean-triplet-in-an-array-ihd8rs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remainder-of-large-binary-number-divided-by-k-78xoql</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-number-to-english-words-f0g76n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/remove-vowels-and-consonants-from-a-string-rym6tk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/print-all-prime-numbers-between-two-intervals-e7qj6w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/merge-two-strings-alternately-x8p8al</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/number-of-ways-to-express-n-as-sum-of-consecutive-integers-7l5gy4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/search-string-in-sorted-array-with-empty-strings-00cq3o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-three-numbers-appearing-an-even-number-of-times-y7mo7x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/select-and-implement-data-structure-for-a-dictionary-vkd16c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/detect-and-prove-impossibility-of-cycle-in-bst-t5f3ow</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/write-a-c-program-to-implement-a-calculator-with-two-0vmdg1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/write-a-java-program-to-check-if-a-number-is-prime-or-not-9q7cgd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/code-an-inverse-pyramid-star-pattern-in-python-lqiu17</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/sort-a-random-array-of-integers-g3vkji</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximize-sum-of-middle-elements-of-triplets-in-an-array-of-y6n3tx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-subarray-sum-with-one-deletion-qzgs5k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/shortest-flight-path-from-source-to-destination-before-j9upu8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/minimum-weight-edge-deletion-to-disconnect-all-leaf-pairs-in-8py1wt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/maximum-distance-covered-by-ship-given-fuel-capacity-and-a20beo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/generate-the-fibonacci-series-w266xz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/output-top-3-largest-elements-in-a-running-stream-of-08ho2s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/implement-a-basic-calculator-and-extend-it-to-scientific-cj86vz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/delete-the-5th-node-from-the-end-of-a-linked-list-hb5uc5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/swap-middle-elements-of-a-stack-and-a-queue-based-on-parity-w87w79</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-row-with-maximum-number-of-1s-9zc4oz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/longest-common-subsequence-and-maximum-subarray-sum-yc0ato</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/store-strings-in-data-structure-and-find-key-r0n76h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/graph-queue-implementation-and-sliding-window-two-pointer-2wb9p0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/linked-list-and-complex-string-manipulation-problem-0pdk0d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/string-conversion-check-gr8g2j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/circular-table-jumping-game-7nj4c9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/digit-replacement-and-subsegment-length-pm2r47</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/sorting-algorithms-comparison-fpqv96</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-characters-excluding-operators-symbols-and-vowels-mmik67</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-word-occurrence-re1q4f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-value-k-in-given-complete-binary-tree-and-count-nodes-faqs8p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lru-cache-implementation-and-connect-n-ropes-with-minimum-s3y92f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-maximum-meetings-in-one-room-py9ovv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/print-the-average-of-n-numbers-t6jmyk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/eliminate-occurrences-of-a-second-string-in-the-first-string-8lhnjv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/sentences-containing-all-words-of-given-phrases-5ynfp6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/modified-knight-problem-with-pawns-iskbo7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-items-needed-to-deliver-across-buckets-in-k-tours-4s597d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/compare-two-file-versions-to-detect-line-changes-7biml6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/check-if-any-two-concatenated-strings-form-a-palindrome-yqeow9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximize-party-profit-with-hierarchical-subordination-e20mlh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/count-character-frequencies-in-a-string-and-output-sorted-ld62oj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-bit-flips-required-to-convert-number-p-to-q-5aqrg0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-the-number-of-islands-in-a-graph-61gz96</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-top-k-frequent-words-in-a-running-stream-dnpxj2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/compare-quicksort-and-mergesort-algorithms-8ld5k4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-100-gb-of-data-with-memory-constraints-m2dg9o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-occurrences-of-digit-2-from-0-to-n-zi3xdt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/partition-array-into-two-subsets-with-minimum-sum-difference-qgq4ih</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-linked-list-with-negative-values-before-positive-74coqn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-minimum-element-in-every-subarray-of-size-k-0rvu6k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-triplets-with-target-sum-f1r46c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/assembly-line-scheduling-e99ujk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-two-sets-are-disjoint-and-implement-set-hashing-ray8oe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-sets-to-remove-for-disjoint-collection-hd5ps7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/row-with-maximum-number-of-zeros-in-binary-matrix-meq8dh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-last-index-of-substring-in-string-mbu3c7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-sub-segment-containing-all-target-words-q7f2ob</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-a-string-with-code-dry-run-hkbr0a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/calculate-people-traveling-through-city-x-to-reach-match-2fq4kr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/bridge-and-torch-problem-with-k-torches-and-max-x-people-gnzdb5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/compute-x-y-in-log-y-time-9fgb7g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/in-place-character-replacements-in-a-string-with-allowed-9jjxfx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/wildcard-string-matching-9b1byz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-length-of-bitonic-subarray-bg702b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/recommend-a-page-to-a-user-based-on-page-transition-logs-u34efz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/min-cost-path-in-a-grid-lb66z8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/three-sum-6rjplq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-shortest-superstring-containing-all-strings-as-msgm5i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-time-required-for-all-oranges-to-rot-ba42v3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-gap-between-successive-elements-in-sorted-form-5ud88s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-character-at-index-m-after-k-replacement-iterations-ip73c6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-xor-of-two-numbers-in-an-array-b1qd9z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/print-alternate-numbers-with-each-run-of-the-program-pvvpk7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/calculate-frequency-of-elements-in-an-array-rqz06y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/minimize-uncovered-segments-given-segment-array-and-workers-unz8co</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-root-of-an-acyclic-undirected-graph-to-make-a-valid-um4n1h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/cutting-a-rod-problem-6fjbrk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-number-of-coins-change-problem-hf6s55</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/target-string-construction-from-subset-of-strings-using-xj9a6t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/valid-string-by-character-frequencies-n91kcr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-pairs-and-triplets-with-target-sum-5emjx4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-length-subarray-to-sort-hvqje4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/non-repeating-random-number-generator-tjps57</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/run-length-encoding-without-extra-memory-xs9gz2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-a-cycle-in-a-graph-r1njqg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-word-from-paragraph-using-trie-371ddv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/water-flow-through-porous-and-opaque-bricks-matrix-h66ep6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/dictionary-match-count-3ghqi0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/recent-requests-myx26c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-occurrences-of-regex-pattern-10-1-in-a-string-5lphku</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-valid-cars-for-a-date-based-on-odd-even-rules-3z3meb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-positive-points-to-reach-destination-knvji7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-subsets-with-a-given-sum-perfect-sum-problem-ye66wl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/removing-string-that-is-an-anagram-of-an-earlier-string-sbdti3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/check-if-string-is-k-palindrome-with-exact-k-removals-4vfoae</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/2-sum-pair-sum-closest-to-target-using-binary-search-hp7oft</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/html-and-webpage-formatting-queries-0iz1tl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/sql-queries-on-multi-table-schema-338jsl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/python-fundamentals-tuples-and-functions-j1qvmh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/duplicate-occurrence-of-element-in-array-with-o-1-space-mtmx9v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximize-news-channel-ad-ratings-with-time-gap-constraint-4jurgt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/modified-boundary-traversal-of-a-binary-tree-f1wbgi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/house-robber-problem-on-a-binary-tree-b97666</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-an-iterator-over-a-binary-search-tree-in-java-3m27c0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/recursive-search-in-an-array-cd9944</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/bubble-sort-algorithm-6wmftm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/replace-element-with-greatest-element-on-right-side-cinw37</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/number-of-paths-in-a-grid-9k6k1n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reach-end-cell-in-mountain-array-with-obstacles-gp3p8v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-binary-tree-to-mirror-tree-is63pu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-units-on-a-truck-h9wqlu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-segments-of-string-into-prime-numbers-2chplp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/subsets-with-average-equal-to-k-0l0vdp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-wildcards-required-to-match-all-strings-6iqsm1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-cost-to-merge-alexa-devices-scw2m8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/clone-a-doubly-linked-list-with-random-pointers-6lyf0r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/travelling-sales-person-problem-using-dynamic-programming-5uyq76</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/implement-a-trie-for-dictionary-operations-nc4n8q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/custom-set-with-o-1-insert-remove-and-getrandom-9pir8t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/variable-relation-solver-with-multiplication-constants-llyiw8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximize-customer-support-calls-handled-cvo5zi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/smallest-value-cannot-be-created-using-given-coins-4qf3cf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-distance-between-midpoints-of-two-word-occurrences-b4kmoy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/arrange-numbers-to-form-the-largest-possible-number-cq022p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/check-if-linked-list-is-circular-5dt9tp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/swap-two-numbers-without-third-variable-stl-or-xor-m4qqqm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/numbers-in-range-divisible-by-a-target-sxsde6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/pixel-color-modification-in-bit-packed-screen-2mjwbp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/in-place-word-replacement-in-infinite-array-ot0dhv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/search-in-2d-sorted-matrix-k24a93</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/convert-circular-linked-list-to-linear-m57286</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/max-stack-using-one-stack-w1dkmz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-the-factor-tree-of-a-given-number-qbd7lu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/partition-string-so-each-character-appears-in-at-most-one-k48vxu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-if-two-strings-are-rotations-of-each-other-vbs3rq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/friend-queries-and-group-total-count-fk2kad</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-an-array-containing-0s-and-1s-q94mod</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maximum-absolute-difference-between-the-sum-of-two-8lvup4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/determine-relative-position-of-two-quadrilaterals-8somhf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sql-queries-for-nth-highest-salary-and-department-wise-7qbw8k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-date-after-n-days-y0c3he</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/reverse-words-in-string-without-reversing-individual-words-potb1w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/add-an-element-to-the-head-of-a-linked-list-in-o-1-0k1n2o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/swap-two-numbers-without-using-a-third-variable-hc17o6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/count-of-subsets-with-given-sum-643sx3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/sudoku-solver-approach-99o0dv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-all-root-to-leaf-paths-in-a-binary-tree-1lmjl6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-the-element-that-appears-once-0lhxs5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/shuffle-an-array-using-fisher-yates-algorithm-jkf2u0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-common-restaurants-with-minimum-index-sum-on3owh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-words-of-a-string-vertically-column-by-column-lb9fpz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-peak-point-in-a-function-mapped-from-integers-to-real-bv57lh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-numbers-generated-by-each-root-to-leaf-path-in-binary-vtuvv9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/combinations-of-strings-from-a-numpad-dgax5t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/subset-with-zero-sum-after-negation-44iptc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/median-of-two-sorted-arrays-without-extra-space-usc18d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/zigzag-order-level-wise-traversal-of-binary-tree-uptj65</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-two-non-duplicate-elements-in-an-array-6f5l0x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-number-of-islands-and-geographical-riddle-uu28so</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/outlier-detection-without-built-in-libraries-bj1ia5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/implement-a-function-to-check-if-a-given-string-is-a-j8n8yo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/factorial-using-recursion-l0i3vv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/technical-interview-1-2buu0m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/group-fly-round-i0xpnf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/java-oops-interfaces-palindrome-and-sql-2hpf0q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maximum-subarray-sum-and-binary-tree-diameter-dyhxy1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/c-programming-memory-handling-and-sql-optimization-f8ssoe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/mcqs-and-coding-challenges-on-data-structures-f06cxa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-greater-number-with-same-digits-and-postfix-evaluation-v24rdv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/diagonal-binary-tree-traversal-and-sub-arrays-with-zero-sum-sl7r0q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/stream-top-elements-alien-dictionary-memory-and-undo-redo-qvc1qa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-number-of-words-in-a-given-string-1agb05</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-characters-added-to-end-of-string-to-make-it-a-n4bpsj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/matrix-multiplication-using-double-pointers-cwg3sb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/rearrange-array-to-place-even-numbers-before-odd-numbers-jj3yid</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/check-if-a-string-can-be-formed-from-nested-structure-5dnh82</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-the-element-that-appears-exactly-once-in-an-array-0cu32x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/swap-dots-and-commas-in-a-string-7yl96l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/determine-profession-of-a-child-at-a-given-generation-and-xzx0jo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-word-with-maximum-character-repetitions-in-a-string-5shix7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-duplicate-line-in-a-large-text-file-de4gql</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/select-optimal-data-structure-for-fast-search-in-large-80h9er</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/calculate-confirmation-rate-for-each-user-kl1zsa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/calculate-cgpa-b75dl8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/move-zeroes-to-end-of-array-0m2fil</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/count-subarrays-with-exactly-m-odd-numbers-wpr03f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/count-distinct-subset-sums-vo8q88</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-time-interval-with-no-active-cars-p0bi4k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-bracket-reversals-for-balanced-expression-vewvr5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-non-overlapping-bridges-across-river-m80rvc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/number-of-ways-to-reconstruct-same-bst-nz27ip</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/activity-scheduling-with-deadlines-for-maximum-profit-hb92mg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/explain-python-lists-dictionaries-arrays-strings-and-mutable-htkm6a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-the-fourth-point-of-a-parallelogram-given-three-points-edq2b3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-max-heights-for-all-nodes-considering-each-as-root-5dr1ig</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/group-strings-by-set-of-characters-and-sort-xq1svk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/contact-tracing-graph-to-find-contacts-within-the-last-x-pfgqd4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/find-the-row-with-maximum-1s-in-a-row-wise-sorted-binary-job9i2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/morgan-stanley/how-to-improve-search-time-in-a-linked-list-m4mlb7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/demonstrate-multiple-inheritance-in-java-using-interfaces-eif8p8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/write-code-to-print-pascal-s-triangle-s3mlc5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-the-maximum-sum-path-in-a-binary-tree-e7s594</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/calculate-angle-between-hour-hand-and-minute-hand-o1uwep</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-elements-by-frequency-8rxuem</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/sorting-algorithms-complexities-and-quicksort-vs-mergesort-083f8d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-the-number-of-occurrences-of-a-key-in-a-sorted-array-wjo2hz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-a-stack-supporting-element-search-nzu6aj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/check-if-two-strings-are-permutations-of-each-other-ye90fj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/handle-arithmeticexception-and-print-a-custom-error-message-6duqlo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/write-a-simple-program-demonstrating-abstraction-in-java-5zsl0b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/write-an-sql-query-involving-joins-and-explain-its-output-nl6pnu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/implement-bfs-algorithm-e59rzf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/shortest-path-algorithms-and-bellman-ford-nk8acr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maintain-sorted-order-of-incoming-data-and-implement-jeib0t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/maximum-value-of-expression-by-different-parenthesization-sl7k8a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/sum-of-elements-at-odd-indices-5s7kxa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/arrange-first-k-elements-ascending-and-rest-descending-ftrd0t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/convert-string-representation-of-integer-to-integer-4yk55w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-pair-or-triplet-matching-target-sum-mw35el</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/string-manipulation-and-non-repeating-characters-h7dquu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/reverse-the-string-word-by-word-9weii6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-difference-between-two-text-files-rgj9ct</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/convert-a-binary-tree-into-a-full-binary-tree-7zlbl5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/construct-array-of-length-n-from-sign-string-slnn6h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/insert-element-at-i-th-position-in-a-doubly-linked-list-vys1ak</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/sort-array-using-prefix-reversals-and-highest-element-index-q6fkdk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/perfect-numbers-d4sklq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/remove-duplicate-numbers-uflr43</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/company-hierarchy-and-salary-ctp2lp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-substring-yz9yfo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/minimum-jumps-with-special-indices-3sxezc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-min-heap-with-array-j96dwh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-largest-adjacent-path-of-1s-in-matrix-u6132e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-array-optimally-and-search-element-s7poet</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/print-1-to-20-skipping-8-to-10-using-break-and-continue-ai7k0h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/minimum-currency-notes-for-given-amount-4flzo6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/paytm/closest-leaf-distance-from-target-node-qhx3dr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/convert-number-words-to-digits-inline-in-sentence-zd704n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/permutations-of-string-with-test-cases-e4vwgc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/order-prisoners-based-on-mutual-hatred-relationships-4blw1o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-all-nodes-at-distance-k-from-target-node-zucj3c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/construct-mirror-tree-recursively-and-iteratively-f5il2q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/array-processing-optimization-using-sliding-window-qmyl8c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sudoku-sub-grid-extraction-and-3d-extension-czm8f0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/calculate-integer-power-vv95ll</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/best-fitting-box-for-item-size-xf40w7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-cost-to-join-strings-4dn8rp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/in-place-audio-player-playlist-randomizer-amxkw9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/iterative-preorder-traversal-and-data-structure-use-cases-bub2bp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/boolean-matrix-transformation-72a16x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/group-anagram-indices-559mru</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimal-hexadecimal-representation-by-repeated-digit-summing-q6wdeo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-median-from-data-stream-9bklj1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/valid-parentheses-variations-and-precedence-10ktg4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/shortest-path-in-a-grid-with-obstacle-elimination-dgdm00</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/print-all-prime-numbers-within-a-given-range-e30iz9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-length-subparagraph-containing-all-target-words-b68l7l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-pairs-with-a-given-sum-in-a-bst-hse5s5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-avl-tree-7ers2o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-number-of-squares-that-sum-to-n-6vzwfa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-number-of-bags-to-carry-waste-jzfp7m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-initial-cookies-needed-in-pantry-0w7fct</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/trapping-rain-water-and-finding-block-with-maximum-trapped-y6p1tv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-all-permutations-of-a-string-with-and-without-7gzne4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/implement-vector-insertion-in-cpp-and-state-complexity-o7ntzn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/difference-between-sum-of-even-and-odd-index-elements-v02ogm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/print-frequency-of-repetitive-characters-in-a-string-272a3q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/basic-dynamic-programming-coding-problem-h999gx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/stack-coding-problem-dzgu04</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/basic-string-and-pattern-coding-problems-2wk1a9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/sql-queries-and-basic-coding-problems-38fvym</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/remove-duplicates-and-reverse-string-xs0uwk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-words-ending-with-ing-with-frequency-557pfb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/subarrays-divisible-by-divisor-ir1a8j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-if-mobile-number-is-fancy-olh87e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maximum-consecutive-1s-in-matrix-dj4vvh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/date-addition-without-built-in-functions-g4l31t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/string-manipulation-with-trie-optimization-vprn6z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/number-with-maximum-occurrence-of-digit-k-644dco</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/wildcard-matching-9142q6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/telephonic-coding-and-optimization-z2ts5p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/maximum-sum-contiguous-sub-array-0lgpva</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-median-of-bst-413huc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/delete-k-consecutive-identical-characters-from-a-string-23b8es</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/find-pattern-with-wildcard-in-text-bwx89k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-a-given-number-kcyt6x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-lowest-common-ancestor-lca-of-two-nodes-m70u2o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/determine-if-a-number-is-a-magic-number-53holi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-distance-between-two-elements-with-conditions-l8wdqi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/add-greater-node-values-to-smaller-node-values-in-a-binary-cqq6sa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-words-that-are-not-anagrams-of-any-other-word-0ytyq2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/connect-all-nodes-at-the-same-level-in-both-directions-4e1c64</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/insert-a-node-in-a-sorted-linked-list-and-circular-linked-2uuqra</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-position-of-the-first-1-in-an-array-of-0s-and-1s-uciph6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/list-manipulation-operations-in-python-zd3nhg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/rearrange-positive-and-negative-numbers-in-alternating-order-s4it1t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/design-and-implement-an-lru-cache-7l8cnf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-pair-in-an-array-with-target-sum-1j2w3s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/check-child-sum-property-in-a-binary-tree-4370rp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/detect-loop-in-linked-list-with-modified-pointer-speeds-zg3r95</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-triplets-satisfying-the-triangle-inequality-property-m4rmtx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-package-compilation-order-using-topological-sort-96zb43</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-left-side-view-bottom-up-and-right-side-view-top-down-qqbr2a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/connect-next-pointers-in-adjacent-nodes-of-a-binary-tree-f0hgga</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/multiply-sums-of-leaf-nodes-at-each-level-in-a-binary-tree-45l64j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-duplicates-from-a-string-in-place-mdu8ut</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-binary-tree-leaf-depths-differ-by-at-most-one-a8p64h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-a-string-using-different-methods-w6v51v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/fetch-salaries-of-employees-in-departments-with-more-than-3-pf85er</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-valid-parentheses-1fx3sr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/step-by-step-directions-from-a-binary-tree-node-to-another-3jh6xz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/partition-to-k-equal-sum-subsets-1tw9jp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/rotate-string-based-on-dictionary-value-m4fxeu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/find-minimum-number-occurring-4-consecutive-times-in-a-ted9os</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/minimum-cost-to-buy-n-metro-rides-lbjg9i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/minimum-perfect-square-numbers-that-add-up-to-n-c66s8b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-the-second-smallest-number-in-an-unsorted-array-9as3ro</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/length-of-the-largest-substring-without-repeating-characters-c733nk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/rapid-debugging-and-logical-coding-1qhinf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/move-zeros-to-the-end-of-an-array-1q5121</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-anagram-indices-in-a-text-xg337g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-3-node-cycles-in-an-undirected-graph-xsbrl6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-array-to-wave-like-form-ri21n7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-array-based-on-custom-order-q3tdui</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/unique-anagrams-of-a-string-5h9i5f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/print-alternating-series-using-three-threads-0eymjo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/detect-and-fix-broken-pointers-in-a-circular-linked-list-u5fh2h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-quadrilaterals-from-four-points-nq8tyw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/next-greater-element-to-the-right-xh8dnm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/clone-a-binary-tree-with-random-pointers-k5wf0w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/sum-of-odd-and-even-digits-in-an-integer-xzw89t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/expressive-words-and-decreasing-decimal-order-from-random-os20t3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/add-1-to-linked-list-number-and-generate-power-set-x239fg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-number-of-possible-words-for-a-mapped-numeric-string-za5g7r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-average-score-from-student-marks-and-string-z3v2iy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/best-fit-box-for-product-size-and-longest-path-in-binary-x5z3nh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-in-absolute-difference-1-array-palindrome-linked-list-beqgb6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-nearest-points-to-origin-and-nodes-at-distance-k-in-binary-8kvvx9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/maximum-and-minimum-values-of-algebraic-expression-dcy2to</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/extract-bit-range-and-convert-to-decimal-j3azmx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-nth-node-from-the-end-of-a-linked-list-5mq144</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/explain-topological-sort-oys81w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/maximum-profit-by-buying-and-selling-a-share-at-most-twice-sxa711</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/kth-node-from-middle-of-linkedlist-pii1qc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-total-distance-meeting-point-for-four-friends-3ptevm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/string-manipulation-using-two-pointers-and-hash-map-la453o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/in-place-string-problem-with-o-1-extra-space-nkyq52</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/implement-selection-sort-k3hn9e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/expression-evaluation-with-mixed-measurement-units-1jpn70</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/important-features-of-python-biew9k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/pandas-and-python-data-structures-sxzpo1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/build-a-dataframe-using-lists-q3gs2p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/list-and-dictionary-comprehension-in-python-45p7ms</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/normalize-a-table-and-write-sql-queries-cfsm8l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/explain-sql-joins-in-detail-z864vi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/algorithms-prim-s-divide-and-conquer-and-sorting-5rki4a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/detect-cycle-in-linked-list-and-find-start-node-smnqn3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/recursive-string-problem-djm52o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/vertical-sum-in-binary-tree-p7nujk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-0s-1s-and-2s-8zgd8c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-duplicates-jd8g78</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-n-numbers-in-stream-5klk43</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lca-of-k-nodes-j26ccr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kth-largest-in-stream-em5hcf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/floor-and-ceil-in-bst-o8q9p3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/odd-occurrences-53tyfr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reverse-stack-fvuy6s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/external-merge-sort-3mxeun</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-frequency-words-e2dnx7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/tree-to-sum-tree-w0ezmi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/partition-problem-80u6ik</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/diamond-star-pattern-4qg0tl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/tree-height-and-mathematical-expression-evaluation-u084yc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/count-even-integers-in-an-array-7emcft</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-time-required-to-burn-the-tree-p24ix2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/print-all-intermediate-steps-of-merge-sort-mn918v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/calculate-algorithm-time-complexity-using-geometric-v1ntdh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/steps-to-reach-one-using-collatz-like-conditions-c8cw6f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/create-doubly-linked-list-from-binary-tree-leaves-oe3odb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/maximum-element-in-every-sliding-window-of-size-k-zaem03</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/search-in-a-bfs-sorted-tree-lsyd5q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-sum-path-between-any-two-nodes-n29g2x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximize-non-crossing-bridges-between-villages-3sl862</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/largest-sum-bst-within-a-binary-tree-9y3mwt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/divide-binary-matrix-into-equal-sub-matrices-vj56wg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-and-use-an-unordered-map-3udyzz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/prune-k-heavy-paths-in-a-binary-tree-6qr38j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-m-arrays-of-size-n-j3ukf9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-a-string-in-linear-time-6k218q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/most-popular-3-page-sequence-mu6sk7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-flips-to-zero-out-an-array-upx6q4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-array-based-on-adjacent-means-4fnnsn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/height-of-a-binary-tree-with-connected-leaves-wken0s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-cost-to-merge-all-elements-hbreg8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/array-element-after-q-queries-3df2j2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/remove-all-consecutive-duplicates-7evy5t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/hello-world-and-java-modifiers-v9ot6o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-missing-value-in-array-p94v31</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/check-permutation-palindrome-25bdqz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/maximum-product-of-three-values-sn8ag9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/snake-and-ladder-minimum-steps-ycihj6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/rotate-linked-list-right-3zb61v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/number-to-word-form-hjsm8i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/max-consecutive-ones-wf4rq5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/longest-path-elements-in-binary-tree-5bxh9k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-matrix-in-spiral-form-stht30</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/product-of-sums-of-two-sorted-parts-j0m01w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/sort-2d-matrix-onyd2z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/amicable-number-check-sb3zqi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/cpp-memory-layout-and-struct-size-he90b2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/binary-tree-middle-level-bnxx8g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/unbounded-knapsack-t3guq7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/bracket-reversals-fqb1og</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/dice-toss-to-tail-v7e5b9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-celebrity-tcx3oi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/longest-compound-word-eaq1id</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/check-for-palindrome-string-uosqf8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-1d-array-to-2d-array-and-calculate-row-col-max-sums-0u0eha</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-obfuscated-string-into-standard-url-format-0093ic</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-linked-list-is-a-palindrome-without-modification-on654t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-platforms-required-for-trains-eo6d21</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-heapify-for-a-min-heap-avkeq9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/reverse-linked-list-and-find-loop-in-circular-linked-list-zd0ms0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/implement-circular-stack-xl65s0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/implement-polymorphism-for-automobiles-922k5q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/write-tostring-function-implementation-849jsk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/tcp-socket-programming-6slgwv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/fantasy-league-budget-selection-rr17sf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/parallel-task-processing-with-dependencies-4yf098</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/minimum-element-via-left-rotations-3mqbr0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/maximum-depth-of-a-generic-tree-jx6ts6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/diameter-of-a-generic-tree-graph-m56qcf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/building-bridges-problem-1lcol4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/move-zeros-to-end-of-array-in-single-scan-kyb2p0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/merging-point-of-two-linked-lists-kelm0b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-next-nearest-number-in-power-of-2-ouoax3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-group-of-elements-in-a-linked-list-0d56c7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/design-a-stack-with-o-1-min-operation-xaak73</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-prime-numbers-gwxvt0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/draw-and-manipulate-a-circular-queue-1j1fq3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/create-a-sql-view-from-an-existing-table-tk7z9y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/modify-matrix-rows-and-columns-based-on-cell-value-4vacvg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/rotate-matrix-anticlockwise-d2ggy3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/check-if-tree-is-symmetric-n02e4a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-height-of-box-tower-ss3p4d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/check-if-tree-is-bst-8buxgu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/event-scheduling-i5i8wa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/pattern-search-in-large-file-s1ch96</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/count-numbers-with-equal-2-4-8-4row70</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/largest-subsequence-with-max-min-1-bv7ojg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/pascal-s-triangle-element-akdj5f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/most-frequent-character-in-a-string-dm0lj5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/maximum-length-palindromic-substring-qxt1br</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/check-for-balanced-parentheses-and-run-length-encoding-ab19a1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/first-non-repeating-character-and-fraction-representation-4ckasr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/median-of-two-sorted-arrays-and-loop-length-in-array-0kqxqp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/flatten-binary-tree-to-linked-list-r6kxda</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-a-triplet-that-sums-to-a-given-value-5gevff</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/maximum-points-from-top-left-to-bottom-right-of-matrix-and-ido74z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/minimum-number-of-platforms-and-sliding-window-maximum-mb4l1d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/longest-substring-without-repeating-characters-and-lca-imv9xb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/sorting-algorithms-merge-sort-dry-run-and-complexity-m9x3fg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/reverse-an-array-and-delete-a-node-without-head-pointer-5ox4dx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/sql-union-with-source-table-indicator-pt6i7v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/sort-a-large-disk-file-with-limited-ram-khsmq8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/reverse-linked-list-from-kth-node-9kq1vb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/print-all-permutations-of-a-given-number-l0gqo2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/react-concepts-es6-features-and-javascript-coding-tasks-mif1xq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/find-product-of-digits-of-a-number-802mg9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/find-maximum-digit-of-a-given-number-b0kbrc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/print-random-array-element-3ww4om</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/average-width-of-n-ary-tree-nodes-xnj3hi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/quick-sort-and-heaps-6yb91m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/design-bst-iterator-ql81na</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/allocate-2d-array-using-malloc-xrno1j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/max-profit-traveling-between-cities-gbj260</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/mismatching-bits-d7hjii</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/define-a-class-and-write-a-function-inside-it-pted6w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/print-name-in-c-without-semicolon-cty7tf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/difference-between-stack-and-queue-pgya20</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/reverse-a-string-and-check-positive-or-negative-number-ifie0o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/fill-4-litres-using-5l-and-3l-buckets-7hahty</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/coin-toss-and-dice-roll-probabilities-ds2a9i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/java-factorial-program-jr4gsn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-4th-highest-salary-in-sql-j01hlu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/intersection-of-two-arrays-and-map-implementation-8su9ev</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-binary-tree-nodes-in-spiral-form-fcs5ms</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/segregate-even-and-odd-nodes-in-linked-list-z3ddbi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/file-transfer-program-in-java-and-variable-swapping-9cvp41</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/discussion-on-backtracking-algorithms-e2p30o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sum-of-cubes-of-digits-47pwiu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/supermarket-revenue-and-best-seller-2ttcov</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/delete-middle-node-from-doubly-linked-list-9h93t5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-k-smallest-numbers-in-stream-g1zqgc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/maximum-subarray-sum-start-and-end-indices-dh6bpg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/level-order-traversal-with-new-lines-x2k1j5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-character-order-of-appearance-from-strings-osmw1k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/search-in-infinite-set-of-integers-okq1bj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-ordering-of-tasks-from-dependencies-x7gs47</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/kth-lexicographically-ordered-string-p8s4cc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/merge-point-of-2-linked-lists-q9obxb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-elements-in-first-array-not-in-second-b0rgr3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-2nd-largest-element-in-an-array-fv42go</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/reverse-alternate-k-nodes-in-a-singly-linked-list-ar73fs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/sum-of-all-subarrays-nlrkh2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-nth-magic-number-lppc0d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/reverse-alphabets-in-string-lx4l9g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/rail-fence-cipher-c9is30</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/8-queens-problem-and-two-non-repeating-elements-tk9u5t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/determine-cycles-in-a-directed-graph-blo2gh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/deadlock-detection-and-multithreading-in-java-t46ob6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/dsa-problem-optimization-ppbs22</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-ancestors-of-a-binary-tree-node-c2n9hm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/reverse-a-linked-list-and-pre-order-traversal-ul3hmb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/json-builder-from-equations-8lyz52</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/zig-zag-level-order-traversal-9ekib4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/character-search-in-string-6vm78u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/fetch-names-and-count-of-professors-ipcp3i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/library-management-system-database-and-sql-zvzk0g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/union-find-problem-v927yv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-number-of-a-s-z5x55y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-guests-at-a-time-9nl9n4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/product-of-array-elements-m42jdl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/sorted-dll-to-balanced-bst-bk0l3r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/non-decreasing-digit-numbers-v34yll</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/max-area-rectangle-of-1s-zzhdg7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/boundary-nodes-sum-u4ickw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/basic-programming-problems-pwm3yi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-positive-sum-path-in-matrix-jm322h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/write-sql-queries-wdvi6h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/write-binary-search-code-5z1xj5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/most-booked-hotel-room-yecmh6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/maximum-time-from-time-string-jbd2xq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-even-length-substring-gk1ugi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-difference-of-subarray-lk590k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/clock-hand-region-check-l0rlab</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/swap-2-objects-without-third-object-df5uoo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/factorial-of-very-large-number-xug5xr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/correct-code-using-single-character-operation-4bomvm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/count-elements-with-matching-index-and-value-parity-s18fhx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/walmart/sde-technical-round-1-coding-evaluation-dnk108</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/reverse-a-string-in-one-line-of-code-p4e8vr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/maximum-difference-between-crest-and-trough-indices-hg6hzy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/count-primes-in-a-large-range-zr1n9p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/pseudo-code-for-checking-prime-numbers-0khnc2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/house-robber-variation-lwc4xg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/game-with-list-reversal-sjio7e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/coding-assessment-strings-linked-lists-arrays-hx8dzh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/string-concatenation-program-adl0bs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/implementation-patterns-math-min-max-array-and-sql-p1ri2f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/combined-rectangle-area-and-5th-largest-salary-sql-l74hx3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-length-of-cycle-in-array-6ttwzv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-highest-average-score-from-name-score-pairs-xw6jme</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/rearrange-alternate-elements-of-linked-list-to-the-end-3e0ndi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-subtree-with-equal-number-of-0s-and-1s-lqwks4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/next-smaller-palindrome-qg4029</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/missing-number-and-first-missing-positive-49ctia</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-absolute-difference-in-bst-vz9zh2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/password-encryption-and-pattern-matching-usm5zh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/bad-url-lookup-and-bracket-number-parsing-5leux2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/reverse-string-number-and-tree-traversal-variations-opi3kw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/design-constant-time-ds-and-trapping-rain-water-2w3sr8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/tcs-ninja-foundation-section-assessment-2cflc2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/mcq-assessment-on-c-cpp-java-and-resource-allocation-de1rw2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/array-index-pair-maximization-and-binary-tree-leaf-sum-nd83bj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/restore-swapped-bst-and-closest-pair-in-sorted-array-w6hc44</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/next-greater-number-by-digit-permutation-2yzd2j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/character-stream-anagrams-tree-construction-and-ball-sorting-2v7syk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/count-pairs-with-a-specific-difference-ab4p87</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/vowel-only-substrings-containing-all-vowels-5p3yvw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/tree-construction-and-level-order-traversal-3pd0pg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/handle-api-requests-and-debouncing-j0i4fq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/component-rendering-and-api-integration-oaicg0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/anagram-strings-and-string-manipulation-rrqm4x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/implement-dijkstra-s-algorithm-025pt0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/define-jvm-and-jre-2yhfq5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/method-signature-ordering-and-main-method-rules-d2jvv3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/constructors-inheritance-and-overloading-iiye9n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/oops-concepts-and-java-collections-luvo8d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-a-given-element-from-a-circular-doubly-linked-list-ies62b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/largest-continuous-sum-in-integer-array-h5u6y9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-two-linked-lists-intersect-43jd50</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-least-common-ancestor-of-a-binary-tree-vwm97t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-one-array-is-a-subset-of-another-wrx46z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-of-subarrays-with-average-k-apehk3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-contiguous-increasing-sequence-in-a-grid-phob3h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/top-k-elements-in-a-stream-ebios8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/debugging-a-linked-list-m7871d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-character-frequency-in-string-and-linked-list-problem-7luz2a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-minimum-distance-between-cities-with-blocked-paths-and-p3vis5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/word-ladder-modification-and-oops-questions-0ki0ic</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-linkedlist-without-reversing-stacks-and-find-tree-uj8vf9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-strips-to-cover-grid-1rllbh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/difference-between-two-given-times-qq6aue</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/count-frequencies-of-all-elements-in-array-4smk1t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/technical-interview-topics-nn47oi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/sum-tree-check-czc8wy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/sort-stack-nf40wu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/nodes-at-distance-k-9f3zcs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/zig-zag-matrix-ttmxe5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/sum-of-k-primes-07mvzu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/non-repeating-element-zev050</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/triangle-type-ypg2xg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/add-without-operator-l4lufw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/deloitte/reverse-number-8c1ox0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/print-hello-world-in-java-and-explain-main-method-modifiers-lo91xx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/hashmap-vs-hashset-and-sql-keys-4c0irz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/calculate-number-of-ways-to-encode-a-string-of-digits-fxrro8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/group-same-sum-pairs-in-an-array-3iiyqx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-numbers-from-1-to-10000-with-factor-sum-equal-to-dv7u2f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-duplicates-top-k-elements-and-max-parenthesis-depth-hfj2a5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/group-fly-round-stack-substring-and-merging-sorted-linked-3n870i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/pattern-printing-and-quadratic-equation-roots-ni5y1b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/count-frequency-without-extra-space-2h1l0t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/reverse-words-in-sentences-xy0bos</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/lowest-common-ancestor-in-a-tree-1ltkqk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/delete-even-nodes-from-singly-linked-list-l44jkt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/intersection-points-of-mapped-vectors-x63k8l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-numbers-with-frequency-two-m8hz58</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/double-ended-queue-implementation-and-operations-9fercr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/lfu-cache-implementation-with-k-size-diq9yc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/what-is-a-trie-data-structure-z79hbx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/write-a-java-program-and-explain-oop-concepts-psti1v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/check-if-first-half-is-anagram-of-second-half-sfia3w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/count-paths-in-2d-matrix-with-obstacles-sqz0ma</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimize-maximum-population-load-per-hospital-i4jxsw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/remove-redundant-records-b716jj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/lca-of-two-nodes-in-a-bst-cq2ufr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/decimal-to-binary-representation-sd2or4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/find-common-strings-in-two-huge-files-vdx08z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/print-triangle-of-asterisks-p5a804</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/top-k-computer-systems-based-on-multiple-attributes-xszl81</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-steps-to-collect-cheese-in-a-maze-and-reach-uab389</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/flatten-a-multi-level-linked-list-in-place-gg8jot</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/convex-hull-problem-d65h7m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/number-game-strategy-to-reach-20-4b098c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-points-path-in-a-matrix-from-lower-left-to-upper-dpwf1m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-row-with-maximum-zeros-in-a-binary-matrix-hp8fd4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/0-1-knapsack-with-item-printing-iw7cky</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/student-with-maximum-average-score-2p5k6k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/element-removal-for-maximum-product-d8tig5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/check-if-a-binary-tree-is-balanced-y7y8vd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/check-if-one-string-is-a-substring-of-another-c8l9jo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/tourist-bookings-concurrent-limit-checker-scnp7v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-palindromic-number-with-at-most-k-changes-zn64oc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/operator-overloading-for-string-concatenation-67l6vc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pair-sum-closest-to-target-5kzecb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pair-sum-from-two-sorted-arrays-pukd9j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-element-appearing-once-in-sorted-array-qsrd4x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-duplicates-from-sorted-linked-list-0itnig</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximize-number-by-replacing-digits-ouyfx8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-strength-to-reach-end-of-matrix-5o32bo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sum-of-two-linked-lists-yy665n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/xor-sum-of-pairwise-xor-array-kgdnl0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/max-xor-sum-of-good-subsequence-0ux1bc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/minimal-time-to-reach-node-n-in-graph-zq0jg2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/partition-string-into-minimum-parts-kj3smg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/grid-coloring-ways-dj33mm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/min-and-max-cost-to-reverse-directed-edges-for-full-ql6exn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/merge-two-sorted-arrays-into-first-array-p35d03</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/number-addition-winning-strategy-game-j8clvm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-happy-numbers-in-an-array-naue4j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/check-palindrome-string-2z6rts</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/implement-bst-operations-4xzpdx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-roots-of-quadratic-equation-yukf3e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-college-admissions-ha1h78</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/search-element-in-increasing-decreasing-array-xd93fz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/return-random-number-from-hash-table-3gtkis</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/calculate-average-marks-per-student-11zrol</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/move-multiples-of-10-to-end-of-array-jsnl9z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/subtree-of-another-tree-zow10p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/design-tic-tac-toe-9w4shi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/round-to-nearest-multiple-of-10-1x33ec</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sum-linked-list-nodes-between-zeros-y1vsqx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/k-maximum-numbers-in-a-massive-stream-k8gstj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/diagonal-matrix-traversal-t1umem</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lazy-bartender-problem-e7efu9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/gravity-shift-box-simulation-52kc9r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/lexicographically-largest-subsequence-with-distinct-namlg2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/bfs-of-graph-k6hmbh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-inversions-99vo3c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/topological-sorts-count-mx1j42</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/swaps-to-convert-array-97rmnj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/swaps-to-sort-array-vpw0t4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/products-suggestion-based-on-search-prefix-9rtr5d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/tree-traversals-dfs-and-bfs-0rm7lz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/shortest-unordered-subsequence-e3id9z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maximum-profit-visiting-cities-with-colors-and-treasures-s6pm42</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/validate-parentheses-expression-w29psb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-operations-to-make-string-good-ayr03x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sum-of-top-k-scores-6i88zc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-color-transitions-for-chameleon-3kmhii</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/merge-two-binary-search-trees-94syyx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/iterative-preorder-traversal-lezny6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/swap-numbers-without-temp-variable-3j7jfs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-number-is-power-of-2-7a5qdx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/replace-spaces-in-string-with-20-791bwx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-nth-to-last-element-of-singly-linked-list-msgwq3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-string-rotation-using-substring-gxn04d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/building-bridges-a1ldq3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-closest-stars-from-large-coordinates-1c3lgl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/symmetric-n-ary-tree-bnl5cr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/evaluate-an-expression-tree-kutw9v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/articulation-points-in-a-graph-ef6r2m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/format-stream-of-numbers-into-ranges-csv56g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-number-of-valid-combinations-to-buy-one-item-of-each-twfh8y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/deep-copy-a-binary-tree-with-random-pointers-without-extra-jb8bnv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-light-years-to-travel-between-planets-using-solar-glz50t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-a-binary-tree-is-a-subtree-of-another-binary-tree-lvelm7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-missing-element-and-index-in-an-arithmetic-progression-57tyzx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-new-index-of-k-th-element-after-right-shifting-an-array-r045yx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-all-anagrams-together-from-a-sequence-of-words-hz1ejt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/inorder-tree-traversal-without-recursion-ejcbj0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/count-child-string-occurrences-as-subsequences-in-parent-a4mrcf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/find-maximum-water-elevation-and-number-of-ways-to-achieve-kei86u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/implement-an-optimized-book-appendix-structure-0k193t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/check-if-a-string-is-a-rotation-of-another-string-sp41yi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accolite/array-product-except-self-without-division-cu0szy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-subarray-with-0-sum-qbjtu0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximize-rental-profit-for-a-car-given-time-intervals-and-hmlfo5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/binary-tree-node-deletion-and-recursive-stack-visualization-u98jku</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-submatrix-with-maximum-sum-rnrp2l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/rotate-matrix-by-90-180-and-270-degrees-knv19g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/print-root-to-leaf-paths-in-a-binary-tree-xb1y71</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lowest-common-ancestor-tree-traversal-problem-cowgm9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/reverse-every-k-nodes-g3p2n8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/design-a-specialstack-with-getmin-7kiu1n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/cost-to-move-all-1s-to-each-index-r6je1s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/multiples-in-a-range-i5713p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/next-smaller-number-yxwj7g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/string-casing-conversion-ti58eh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/dijkstra-s-algorithm-discussion-91gpxd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/heap-and-minheapify-9rra31</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-moves-to-flip-coins-ruhr85</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/string-rolling-operations-and-character-query-hoeb7e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-ways-to-express-a-number-as-sum-of-consecutive-numbers-kr0tsp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/weighted-job-scheduling-8c2ibm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-nth-term-in-a-fibonacci-series-6g8kxj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/validate-an-ip-address-p8tz85</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-middle-of-a-singly-linked-list-8zxw0w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-every-word-in-a-string-v6stqk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/kadane-s-algorithm-implementation-rkbgk4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/move-all-zeroes-to-the-end-of-an-array-43lt7k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-all-dead-links-in-a-website-hierarchy-7ge6rh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/hash-string-with-integers-e10avi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/sort-an-array-of-unsorted-integers-l25zw6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/find-the-second-maximum-element-from-an-array-r4ukq4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/basic-coding-assessment-questions-7g60md</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/replace-each-node-in-binary-tree-with-sum-of-inorder-i6oay7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/grid-walking-piud1p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/construct-a-binary-tree-from-parent-array-representation-8g7w3u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-smallest-window-in-a-string-containing-all-lst5ap</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-profit-by-buying-and-selling-a-share-at-most-k-times-xgeh3p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/divide-string-halves-and-check-if-right-half-forms-16d3qk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-magic-parents-in-a-binary-tree-xfr15j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/shortest-path-to-collect-all-flowers-visiting-each-shop-once-prb2x2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sliding-window-minimum-or-maximum-for-window-size-k-9ue63k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/calculate-item-sale-prices-and-indices-using-lower-equal-es3ase</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-the-missing-number-in-an-unsorted-array-lx01lt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-middle-of-linked-list-and-related-operations-suk62h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-deep-copy-f7yx8v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/display-top-k-tweets-from-a-stream-irymg9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/convert-string-input-field-to-integer-ewr7s3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/duplicate-2s-in-place-in-array-k1fjkw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximize-total-effectiveness-of-ad-scheduling-u9noed</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/validate-arithmetic-expression-string-0eqjy9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-student-with-6th-highest-rank-without-limit-or-top-kg9paf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/divide-two-decimal-numbers-rounded-to-3-decimal-places-kb4ru2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximize-customers-served-given-waiting-and-service-times-4fbl4b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/connect-adjacent-nodes-at-the-same-level-in-binary-tree-fb16xh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-platforms-needed-for-railway-station-lv1rx2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/segregate-odd-and-even-nodes-in-linked-list-preserving-order-vem8yk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/square-root-of-a-floating-point-number-wuz9k8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/regex-substring-matching-with-start-and-end-anchors-5qevfj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-pair-with-target-sum-in-array-4kdm9g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-every-nth-node-from-linked-list-k8bhpr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-all-root-to-leaf-paths-with-target-sum-in-binary-tree-k0x2pa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/generate-all-possible-substrings-of-a-string-iksiz2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/connect-binary-tree-nodes-at-each-level-into-linked-list-4wglnu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-equilibrium-point-in-an-array-itnpd5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/add-large-numbers-stored-in-two-separate-files-qv0dqv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sql-query-for-direct-and-indirect-reportees-30uy9o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/generate-bst-path-encoding-for-array-element-without-rrz27i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-triplets-in-array-that-sum-to-k-rb212a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-subsets-that-sum-up-to-k-b01oll</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/identify-geometric-shape-in-a-2d-matrix-pb9vpg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reach-destination-number-using-basic-math-operations-zm1v04</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/valid-anagrams-and-test-case-optimization-2brkzs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/array-processing-with-priority-queue-xqi7vp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/time-required-to-rot-all-apples-in-matrix-hd0kl4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-all-nodes-at-distance-k-in-binary-tree-dm67kp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-duplicate-characters-from-string-k5uevf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/top-k-most-frequent-words-in-a-large-file-o93kmx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/first-circular-tour-visiting-all-petrol-pumps-25oeu1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-binary-tree-to-doubly-linked-list-ob718w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/second-largest-number-in-array-of-numeric-strings-kw6npw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-complex-string-in-up-down-pattern-7ddr19</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-binary-tree-is-a-valid-bst-0awtxw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/mean-median-and-mode-x9tzit</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimize-consecutive-differences-pc9c24</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/peak-element-in-array-1uu5b3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rotate-matrix-inplace-5c9kt6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sorting-algorithm-analysis-3pv6bc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/balanced-bst-mhr75k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/searching-better-than-binary-search-l4xnj2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/atm-problem-logic-zq5oc4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/find-the-frequency-of-each-element-in-an-array-7jmxh1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/write-a-code-for-factorial-using-recursion-n2f1iu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-trailing-zeroes-in-a-factorial-of-a-number-q74cd8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-perimeter-of-a-square-plot-enclosing-n-apples-on-a-grid-3s6n3h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-all-possible-paths-from-top-left-to-bottom-right-in-a-08z5ak</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-inorder-predecessor-and-successor-in-bst-with-parent-wkp6gs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-excel-column-name-from-a-given-column-number-3l1j1r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/coin-in-a-line-problem-h19l49</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/longest-palindrome-subsequence-gfg7cv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-total-number-of-buildings-that-receive-sunlight-gubyj1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximize-first-array-using-elements-from-second-array-l8zmqd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-tree-t2-is-a-subtree-of-t1-and-return-its-size-kb5kcb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-median-of-an-unsorted-array-16ielj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-frequencies-in-a-large-unsorted-array-hd6ahl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/validate-a-date-and-throw-exception-if-invalid-x6i79o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/balanced-parentheses-with-quotes-kspsz3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/replace-with-greatest-on-right-u700ci</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/remove-alternate-duplicates-xc37k3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/zombie-infection-y8fegf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximize-consecutive-1s-by-flipping-one-0-09dqu6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/min-swaps-to-convert-binary-tree-to-bst-4bhkxs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-cycle-edge-in-tree-s7ob17</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/min-length-subarray-sum-k-50ra91</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-anagrams-yhnp5x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/topological-sort-for-dependencies-xsxbj5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-contiguous-sum-hx3r6m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-bst-subtree-922t2t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-elements-in-sorted-array-84dikn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/line-passing-through-vertical-segments-5r8pdy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/longest-sequence-satisfying-custom-recurrence-relation-x8zxhl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/explain-binary-search-tree-and-tree-types-910u7x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/array-element-insertion-and-time-complexity-ta11v4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/implement-fibonacci-recursively-and-iteratively-cti76k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/dynamic-memory-allocation-in-c-bn6995</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-numbers-where-sum-equals-target-n08gvy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/implement-queue-from-scratch-a5xelz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/pointers-and-pointers-to-pointers-565g6w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sha-256-encoding-mechanism-1f0zxl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/java-constructors-and-execution-7jv124</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/optimizing-a-complex-database-query-sfcs6n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-three-elements-occurring-even-number-of-times-zb56gw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rotate-n-x-n-matrix-stored-in-1d-array-in-place-1k3349</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-number-of-full-nodes-in-a-binary-tree-4l8m8i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-two-elements-with-odd-occurrences-kx68xi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-window-substring-containing-all-characters-of-7garfe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/arrange-odd-elements-at-odd-indices-and-even-elements-at-h62btl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/queue-element-processing-and-function-evaluation-9dxufi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-distance-between-two-2d-points-y93dit</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-adjacent-swaps-to-make-string-palindrome-vrzj7e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sort-array-elements-by-occurrence-frequency-with-low-space-c8a8fd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/stock-buy-and-sell-to-maximize-profit-r3ogp9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/2d-matrix-manipulation-using-prefix-sums-vwsum7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/friends-pairing-problem-llp8g9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximize-subsequence-score-under-constraints-1oz6ij</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-prime-numbers-using-sieve-of-eratosthenes-9dkcan</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-numbers-from-1-to-100-using-3-threads-lnpl30</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-duplicate-characters-in-a-string-447mgd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-index-of-nth-closing-parenthesis-1hlaqd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/run-length-encoding-string-compression-w30zah</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/next-greater-number-with-same-set-of-digits-lserj0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-a-binary-tree-in-2-dimensions-tmem1r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-if-a-binary-tree-is-a-subtree-of-another-a6qhfd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reach-target-mean-by-adding-k-elements-nl3lph</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/replace-question-marks-in-string-avoiding-three-consecutive-nct6eq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-number-of-islands-and-area-of-largest-island-kkmxp7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/print-duplicate-characters-in-a-string-yc0bo6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/error-handling-and-crashing-in-android-wb08fc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/burst-length-string-reduction-tci704</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/sub-sequences-of-length-3-4gswhq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/robot-movement-coordinates-nh34lw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/distance-to-nearest-zero-j2ftlu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/sort-0-1-2-linked-list-d9y3gz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/count-occurrences-of-a-number-7867m0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/supported-or-bleak-numbers-dnydg1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/pathfinding-in-linear-space-oskw2x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/string-truncation-4ytp5s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pairs-with-sum-less-than-k-87cnqg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/symmetric-binary-tree-n9fuc7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/optimize-recursive-solution-yq5euu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sorting-algorithms-ouk2kl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/bst-insertion-lk7tzn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/first-non-repeating-element-in-an-array-mnjzx0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-next-highest-palindrome-k50aai</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reorder-a-linked-list-j6822n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/convert-string-to-integer-with-edge-cases-engco7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/connect-all-leaf-nodes-of-a-binary-tree-to-make-a-linked-eo5k8t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/length-of-largest-palindromic-substring-ypmt9h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/length-of-longest-substring-with-consecutive-characters-5pju87</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-microsoft-excel-evaluate-function-wole70</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-the-second-largest-element-in-one-pass-l379iz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-if-a-given-9x9-sudoku-configuration-is-valid-6yew4h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/coin-combination-puzzle-totaling-100-q2x6w4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/get-100-using-four-7s-and-five-operators-qa3d1p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/calculate-pow-x-n-kz5qds</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/best-fit-algorithm-in-memory-management-d57be4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/task-scheduling-with-parallel-processors-and-cyclic-nc61ky</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/arrange-numbers-to-form-the-biggest-number-es2qrd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/merge-sort-on-a-doubly-linked-list-y6vppc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/python-oop-code-output-evaluation-d7kjja</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/double-matching-adjacent-elements-and-move-zeros-to-end-ia8fpx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-middle-collinear-points-from-2d-coordinate-linked-9s2nij</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-sentence-vertically-without-extra-space-akht23</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/compare-strings-under-custom-lexical-ordering-with-multi-f50wxf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-number-triangle-pattern-based-on-powers-of-11-y3m2cc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-common-elements-in-all-rows-of-a-matrix-8gdnks</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/check-if-duplicates-exist-in-an-array-of-size-n-with-values-fp8qx6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-trie-for-pattern-matching-viqq9w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/extract-and-validate-business-date-from-log-file-in-perl-hs4art</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/validate-ip-address-using-regular-expressions-acrub2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/get-file-or-directory-permissions-script-y2psog</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/fix-bst-where-two-nodes-are-swapped-u0csq9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-10-most-frequent-words-using-linux-shell-commands-j3bklb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/detect-a-cycle-in-a-graph-4oii99</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/count-numbers-on-fingers-jp04mz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/sort-the-linked-list-before-xth-element-rt5ptk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-if-two-rectangles-overlap-77z69b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-numbers-1-to-100-without-loops-or-recursion-am62hn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-moves-for-a-bishop-on-a-chessboard-sqvr43</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/trapping-rainwater-problem-at16vs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/reverse-an-integer-and-handle-overflow-z5h2ja</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/check-if-array-elements-form-an-arithmetic-progression-ik8ds7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/square-root-of-a-decimal-number-to-4-decimal-places-ya8nqb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/print-address-of-a-variable-without-using-a-pointer-d6pnmh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/query-third-highest-salary-from-employee-table-3bpnv9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/next-smallest-and-largest-numbers-with-same-number-of-set-8r4rbo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/intersection-of-three-arrays-ob0p1d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/calculate-difference-between-spaces-in-two-strings-e05sb4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/longest-monotonically-decreasing-subarray-length-yw0q1n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/generate-the-factor-tree-of-any-given-number-55tpvn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/minimum-number-of-refueling-stops-pf6lwn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/sort-array-after-converting-elements-to-squares-7u7dkk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/count-triplets-from-three-sorted-arrays-n6lmy7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/delete-minimum-characters-to-make-substrings-identical-os9j9u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-sum-lis-excluding-elements-uvp887</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/longest-palindrome-from-concatenated-strings-o11m5g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/minimum-sum-of-tax-reports-after-grouping-employees-poj477</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/minimum-distance-of-the-longest-trip-after-road-relocation-wsqoa3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rearrange-linked-list-alternate-odd-positions-44n74k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-platforms-required-for-trains-zskch6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/set-next-pointers-for-tree-nodes-hj4v0k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/construct-bst-from-preorder-and-optimize-rpz33b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-all-leaf-nodes-are-at-same-level-7gfh4v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/random-key-from-hashmap-in-o-1-85i52f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/construct-a-trie-g5c50z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sum-xor-possible-subsets-ww5x34</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/swap-two-variables-without-extra-variable-or-function-62zgcf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-two-prime-numbers-with-given-sum-uivw8z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/bit-manipulation-and-word-break-dp-problem-5cfdyi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/function-overloading-vs-overriding-with-real-life-examples-jjir82</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/linked-list-operations-and-middle-stack-deletion-67hwlz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/division-using-only-addition-and-subtraction-cz7bea</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/stock-max-profit-bst-to-sum-tree-and-pair-sum-5ii11h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/tree-sum-replacement-sliding-window-min-max-and-3-sum-rz1hwq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-substrings-with-exactly-k-distinct-characters-f9zwco</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-maximum-average-subtree-sum-jq7hig</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/asteroid-collision-lb3q45</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/3sum-emdp1b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/validate-arithmetic-expression-3uhu3o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-number-of-overlapping-intervals-45a8r3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/group-stream-of-three-object-types-b7zaxe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/palindrome-checks-and-valid-palindrome-permutations-ev2lgx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/iterative-post-order-traversal-of-a-binary-tree-z1l7e8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/delete-node-with-key-without-additional-variables-5pthq6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-frequency-of-elements-in-range-0-to-n-1-c6ccr9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-if-0s-or-1s-form-a-perfect-square-in-matrix-tfx7ev</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/swap-variables-without-extra-variable-and-find-single-non-2ipdw3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/rectangle-overlap-check-with-minimum-comparisons-wdk4z1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/lowest-common-ancestor-for-n-ary-tree-p7ddr0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/maximize-last-song-volume-o4sktg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/minimum-changes-for-non-adjacent-identical-elements-ht48k6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-the-number-of-1-s-in-a-given-binary-number-q6z0aw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/determine-winning-team-based-on-match-inputs-e7xnvi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/check-dice-roll-evenness-08snaw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/sum-of-primes-with-prime-rotations-qo64ih</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/merge-two-sorted-arrays-and-delete-nth-node-from-end-tkgvq6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/code-debugging-for-common-algorithms-fk7yhn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/factorial-oops-examples-and-isomorphic-strings-6nnpok</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/number-to-words-and-next-palindrome-conversion-iq4czn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-of-subarrays-and-substrings-with-k-distinct-02v5cf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-time-from-digits-and-evaluate-division-0foqrn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/people-in-shop-queries-and-o-1-data-structure-69zoah</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-width-of-binary-tree-1l0ja3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/leaf-nodes-linked-list-using-right-pointers-jphwn9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/distinct-elements-in-contiguous-sub-arrays-of-size-k-9kw4h9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-a-list-of-numbers-gie0s8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/shuffle-a-deck-of-cards-w6g0ca</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/merge-sort-time-complexity-analysis-0v9bcz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/water-jug-problem-jv2ymt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/reverse-second-half-of-singly-linked-list-t404is</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/array-problem-similar-to-hackerrank-candies-jyybq6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/segment-trees-and-memory-management-stack-vs-heap-iuj7bz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/pronic-number-in-string-1bga2w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/predict-output-of-java-nested-inner-class-example-y3dc18</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-two-smallest-elements-in-an-array-03rxcs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-two-numbers-whose-sum-is-closest-to-a-max-distance-bm99l9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-longest-common-prefix-in-an-array-of-strings-odi46t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-pairs-of-strings-composed-of-identical-characters-w07nf7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/calculate-simple-interest-per-employee-in-sql-3j8dkb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/determine-surviving-fish-based-on-sizes-and-swimming-ay4ltt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/implement-merge-sort-algorithm-and-solve-merge-sort-y4pejd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/find-the-longest-increasing-subsequence-using-dynamic-uvc8s6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-largest-number-formed-starting-with-digit-k-2t4u5m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-the-longest-common-prefix-among-an-array-of-strings-b40gua</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-matrix-rows-and-columns-45s3kn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/implement-heap-sort-and-write-pseudocode-c4rfus</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-the-second-highest-employee-salary-in-sql-3ojy2a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/favorite-subject-and-basic-ds-questions-xsid6r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-fifth-largest-element-and-common-ancestor-vj3kjb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/heap-sort-duplicates-and-tree-insertions-3v0t93</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/8-queens-algorithm-and-complexity-llcl72</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/towers-of-hanoi-and-favorite-program-k0aphf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-two-numbers-closest-to-k-5z5rey</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/path-to-cell-containing-9-in-matrix-r9vm6y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-traffic-to-a-stadium-city-in-a-tree-like-graph-lwy1kk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/number-of-islands-and-order-matching-3hptwx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/people-heights-order-and-longest-increasing-subsequence-in-1b9hss</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/reverse-linked-list-and-max-average-subset-j5ncn0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/job-scheduling-with-constraints-6qshag</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/next-greater-number-from-set-of-digits-y1z1k5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/distance-between-two-nodes-in-binary-tree-5szkix</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-day-of-week-given-a-date-2gngri</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/linked-list-operations-corner-cases-1cye3b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-all-valid-words-from-letters-390if2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-population-year-8srpdm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/possible-words-from-phone-digits-uwdzi2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/buildings-seeing-the-sun-bt0iml</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rearrange-array-with-negative-before-positive-04a7dg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sum-of-leaf-nodes-at-minimum-depth-bl6f2c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/custom-string-comparison-with-special-character-priority-ec6b3f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/merge-k-sorted-arrays-5iht79</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/intersection-point-and-loop-detection-in-linked-list-cqo0ar</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/construct-bst-from-preorder-and-inorder-traversal-0gihia</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-maximum-sum-of-a-linked-list-of-length-k-znr7wd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rotate-an-array-by-k-positions-inplace-nffp08</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rotate-a-matrix-by-90-degree-2dodx4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-majority-element-in-an-array-jxr9vr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/add-a-digit-to-a-linked-list-representing-digits-i8ih35</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/remove-all-equal-neighboring-characters-from-string-wcger3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/equal-sum-partition-subset-sum-0lfbyj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/check-if-second-half-of-string-is-a-palindrome-d5unu5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-insertions-to-sort-an-array-24dl3l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/longest-common-subsequence-lcs-dcx0kf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-digit-repetitions-in-time-interval-vqgz9m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-maximum-length-cycles-in-a-directed-graph-2fpr60</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/implement-a-digital-calculator-and-solve-a-maze-search-17lz6n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/ants-on-an-equilateral-triangle-z4sd33</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/form-a-large-square-from-smaller-unit-squares-udzmm9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-the-first-number-with-x-factors-q1bpt6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-a-specific-pyramid-star-structure-cdrpv2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-min-and-max-product-of-array-elements-k79am9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/cause-and-rectify-a-deadlock-in-code-3vdol8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maximum-profit-with-at-most-2-stock-transactions-hcup9k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-index-to-replace-0-with-1-for-max-consecutive-1s-8glny7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-all-possible-subsets-of-a-string-2k8wu1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/analyze-output-of-java-inheritance-code-snippet-hj1vnt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/equalize-stick-lengths-with-minimum-cost-2q5aig</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/filter-words-starting-with-a-given-prefix-ud3b7f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-modifications-to-satisfy-sequence-constraint-bh1tlc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/next-closest-time-using-available-digits-zt8qmr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-diameter-of-a-binary-tree-6bdzod</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-path-existence-in-a-matrix-36qz5s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-sudoku-solver-and-analyze-complexity-aocs0x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/construct-sql-query-using-left-join-opzu8u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/convert-normal-bst-to-balanced-bst-os3t16</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximize-guaranteed-score-in-two-player-array-game-33jkfd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/group-sequence-of-words-into-anagrams-wo7n9c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/smallest-subarray-length-with-sum-exceeding-threshold-6cqh05</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/row-index-with-maximum-ones-in-binary-matrix-gdpb7r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-all-unique-pairs-and-triplets-summing-to-k-pk78xn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-missing-numbers-in-large-array-without-sets-7z7lxb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/write-sql-schema-creation-joins-and-group-filtering-oo4qb1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-array-of-employee-names-without-built-in-sorting-c1umtl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/convert-array-to-a-singly-linked-list-rqnz63</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/query-employee-names-with-manager-names-using-self-join-y36teq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/demonstrate-inheritance-and-polymorphism-in-cpp-s26v8x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-three-numbers-represented-by-linked-lists-9kl9v5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-majority-element-in-a-sorted-array-in-o-log-n-time-nho6c7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-minimum-values-in-every-sliding-window-of-size-w-04s6k3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-root-of-the-largest-bst-in-a-binary-tree-4ofzd5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-all-occurrences-of-a-given-value-from-an-immutable-gj64ob</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-minimum-absolute-difference-between-any-pair-of-fvd6ye</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/replace-each-node-value-with-sum-of-all-nodes-occurring-to-z9v495</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-two-elements-in-a-streaming-sequence-sum-up-to-10-680iel</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-rectangle-dimensions-closest-to-a-square-for-area-jqz1qn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-nearest-greater-element-on-the-right-for-each-array-g5949c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/convert-decimal-number-to-roman-numerals-t4n0cl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-maximum-product-of-a-triplet-in-an-array-f6ci0d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/implement-quicksort-and-explain-time-complexity-lvhd8p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-shortest-path-between-source-and-destination-in-a-graph-0ss2mu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/explain-dijkstra-s-algorithm-kruskal-s-algorithm-and-bfs-pkfcd8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/linked-list-frequency-printing-7h6mb8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/swap-two-numbers-and-reverse-a-string-q88y6l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/sql-queries-for-unique-values-and-top-records-inpas2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-a-tree-in-zigzag-order-ao9qgt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-two-strings-are-anagrams-v4rcw4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-sum-equation-in-character-array-01fhwx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rectify-corrupted-pointers-in-doubly-circular-linked-list-4v84ri</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-number-in-words-ri26a8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/job-and-task-scheduler-in-round-robin-fashion-8xjjei</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-string-with-alternate-character-occurrences-dropped-t9mp7l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bst-iterator-4y7y3n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/basic-calculator-5637s0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/paint-house-7g8yto</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-time-to-cover-all-1s-on-grid-using-bfs-mhge12</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-path-sum-from-root-to-leaf-1870pf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/target-number-formation-using-basic-arithmetic-operations-04r2a0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/conditions-for-deleting-a-node-from-a-binary-search-tree-bu5i2u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-path-between-two-nodes-in-a-binary-tree-20ytzz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/output-prediction-for-recursive-main-function-q1wj1e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-output-executions-in-nested-fork-calls-b0sadk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/graph-m-coloring-problem-variant-zbvs52</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-a-string-in-zig-zag-format-txm4ph</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/add-two-numbers-without-using-arithmetic-operators-hi19gg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/output-prediction-for-string-and-integer-concatenation-w5h18w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-second-minimum-in-an-array-pucj8m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-score-in-a-two-player-array-corner-selection-game-sjl8cd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/number-of-unique-binary-trees-from-n-identical-nodes-8wot7r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-path-sum-in-grid-moving-down-and-diagonally-jc9cv7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-k-th-permutation-sequence-of-a-string-f2zp08</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/diophantine-equation-solver-a6m4z3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/explain-the-working-of-bfs-and-dfs-traversals-pakqk1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/find-the-global-maximum-element-across-two-arrays-f03qed</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/count-the-frequency-of-numbers-in-an-array-xo62m3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-balanced-parentheses-and-count-parenthesis-1dmmtz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-a-string-without-built-in-functions-imej7e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-2x2-squares-inside-a-right-isosceles-triangle-46slrd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-a-linked-list-and-identify-failure-edge-cases-eh63or</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/detect-a-loop-in-a-linked-list-and-compare-trade-offs-g9u4ij</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/derivation-and-mathematical-proof-of-floyd-cycle-detection-8w854j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/scope-and-real-life-trade-offs-of-dynamic-programming-dgdab1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/form-a-spiral-matrix-from-a-given-1d-array-768b89</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-the-nth-term-of-the-collatz-sequence-0gwd0x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/range-query-and-update-data-structure-th94mh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/dfs-implementation-and-applications-p70ox2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maximum-element-in-a-tree-xx05i0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/binary-search-complexity-derivation-zheb69</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/polymorphism-code-example-w1ikex</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/in-flight-movie-pair-wwb6hl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-item-association-group-pw77yl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/currency-exchange-weight-resolution-a6n1nw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-score-path-in-matrix-0x9om2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/ant-family-interaction-bipartite-graph-6xy06c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/diameter-of-a-graph-sq7caq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/subtract-first-node-value-from-last-node-in-linked-list-8ap3pj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/design-array-wrapper-with-getminimum-and-update-m6cie5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-number-of-three-node-cycles-in-a-graph-e5riiv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-distance-between-two-characters-in-string-gaadx9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kindle-book-reading-schedule-1nrvlk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/graph-traversal-problem-solvable-by-dfs-bfs-tiq7xh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/print-second-highest-salary-3dpc1n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/palindrome-program-nh7xzg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-string-is-a-new-arrangement-e37qrk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sorted-linked-list-to-balanced-bst-0c1z92</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/merge-two-arrays-ladf2m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-binary-representation-nsa787</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-nth-node-from-the-last-of-a-linked-list-dp6xet</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-tail-5-command-in-unix-ejjts7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/convert-number-into-words-l7zqnd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-anagrams-using-isword-ki0fp5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/detect-and-prevent-deadlocks-xzbbu6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reduce-combined-process-execution-time-6s313w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/tree-metrics-calculation-aeny9y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/multi-table-sql-commands-g6jpq8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/string-manipulation-problem-e8ylnc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/detect-duplicate-names-on-same-date-432tok</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/edit-distance-f0u0vh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-rectangular-submatrix-of-1s-0aipqc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/auto-complete-search-query-hpder9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/infix-to-postfix-conversion-and-evaluation-4oub2i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sum-of-base-2-sequences-795vwe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/repair-broken-circularly-doubly-linked-list-5xbmfs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/minimum-length-unsorted-subarray-6k7zt6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/character-frequency-in-string-k4zn1a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/substring-rotation-check-hkyd4i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/grade-calculation-xhks97</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/reverse-a-string-and-find-maximum-element-in-array-f5i5qj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/nearest-number-divisible-by-m-srqu30</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-ones-in-palindrome-binary-representation-zxzk1y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/smallest-path-from-root-to-leaf-with-given-sum-in-constant-ivrrj7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-words-in-a-sentence-without-string-library-functions-04csun</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/join-all-nodes-at-the-same-level-in-a-binary-tree-13hei1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-connectivity-in-a-directed-graph-and-print-path-ilk1xv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sum-of-nodes-in-the-longest-path-of-a-binary-tree-tzx08u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/number-of-ways-to-get-sum-x-with-n-dice-pmv1ix</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-first-occurrence-of-anagram-patterns-qfh8jq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-even-or-odd-without-arithmetic-operators-8a8scp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/depth-and-diameter-of-a-binary-tree-0sisqq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/modify-linked-list-nodes-8eqhzw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maximize-money-won-in-array-game-w3xjqx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-size-of-the-smallest-connected-team-y9v5gz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/write-segmentation-fault-code-and-explain-debugging-steps-w3cf6q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/search-an-element-in-an-unsorted-3x3-matrix-86wiaj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sql-query-to-find-nth-highest-salary-d9nq03</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximize-continuous-ones-by-flipping-one-zero-me9977</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-in-order-successor-in-binary-tree-with-o-1-space-wycxu9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-binary-tree-vertically-ca23ph</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-element-in-sorted-stream-of-unknown-size-3v0e6h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-integer-to-roman-numerals-i5emw2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-subarray-with-equal-zeroes-and-ones-3dl7oc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/conditional-digit-sum-function-vd5sdq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-contiguous-substring-of-ones-f7z7jg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-depth-of-leaf-with-target-path-sum-agg4p7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-trailing-zeros-in-n-nniw9u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/random-candidate-selection-with-uniform-probability-pd0z9g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-substring-occurrences-s5g6xp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/matrix-diagonal-zigzag-traversal-89pecl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/insertion-and-deletion-in-linked-list-yef32x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maximum-concurrent-logins-1wipbv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/print-all-leaves-of-a-binary-tree-a2aoxe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/filter-and-sort-strings-containing-digits-1-2-3-pyjd3q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/smallest-number-from-m-n-pattern-a2ztrb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/maximum-consecutive-repeating-character-mmqwc0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/count-frequency-of-numbers-in-series-ou0d6p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/frequency-count-without-hash-table-u2f5zi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/binary-search-and-bubble-sort-a01mj0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/sort-and-find-second-largest-lezyg7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shuffle-an-array-envne5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/stack-with-mid-operations-gl35v2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/word-frequency-in-document-gh2rc1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/connect-siblings-in-binary-tree-ulvq4x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/3-stacks-in-one-array-grdxn0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/schedule-matches-between-teams-1x6tfj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/implement-bubble-sort-c6gdvu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/remove-duplicates-from-a-given-string-jwz0qg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/restore-ip-addresses-vpxtn9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-subset-sum-with-consecutive-element-constraints-mx0le5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-same-value-subtrees-in-a-binary-tree-8gnr0j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/sap/form-weights-from-1-to-40-kg-using-minimum-bases-0lq9bs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/evaluate-a-boolean-expression-represented-as-string-and-km5wwy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-an-equation-string-and-find-longest-increasing-path-rq8pnl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-square-root-library-function-jjjn5b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/binary-complement-of-a-number-eq3bz8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-postfix-to-infix-with-minimal-parentheses-be06he</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-maximum-element-after-end-deletions-in-o-1-pg6x3q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/remove-duplicate-characters-from-string-case-insensitively-t9s3y8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/explain-and-implement-binary-search-algorithm-3zwdgs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-next-greater-number-with-same-digits-00i02u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/sum-of-two-maximum-elements-in-array-x3cxfi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/run-length-string-encoding-wj8njw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-matrix-rows-by-last-column-zfn83c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-ceil-in-sorted-array-5ohnpd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/check-even-or-odd-without-modulo-operator-nfj5ie</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-strings-matching-pattern-structure-j8pvlq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/generation-with-maximum-hydra-population-rta740</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-sequence-of-non-repeating-triple-coach-types-maxh5n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/dfs-on-tree-with-doubly-linked-list-last-level-8a7j10</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/dictionary-implementation-using-tries-s8a3hg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/next-greater-element-problem-5d9mo1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/process-vowels-numbers-and-sum-from-string-qdf1n1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/tree-traversals-esw8h6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-level-order-traversal-of-bst-ued8ay</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/zig-zag-traversal-of-bst-hho1qk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/sort-employee-objects-fwk4bs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/max-profit-from-stock-prices-ippsl3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-error-in-sorted-array-jei9fp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/parentheses-combinations-8l5nv5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/iterative-root-to-leaf-paths-a31ow6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-nodes-between-levels-iktx4e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/mirror-images-of-trees-kpx688</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/build-bst-from-traversals-ff9u7m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-boundary-nodes-bg7ckn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rotate-linked-list-git5qm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/identify-swapped-nodes-in-bst-4j98qf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/distance-between-nodes-in-bst-4s6jdc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/tree-height-from-parent-array-eiglx9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-area-of-island-3pl6f0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-element-repeated-more-than-twice-q1xldi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/arrange-array-by-odd-and-even-positions-4t08zq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-string-to-palindrome-with-minimum-deletions-2d6hik</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-common-element-in-row-sorted-matrix-0iqr9m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/linux-command-for-deleting-files-containing-text-lgi090</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/minimum-subsequence-length-for-array-lcm-8yfjli</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/search-and-graph-traversal-algorithms-zrp8fm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/python-csv-processing-and-sql-query-gxsdh9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/python-data-structures-and-js-async-handling-pxag5t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-alphabets-common-to-all-strings-0gsoux</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-leftmost-and-rightmost-nodes-at-every-tree-level-lzban6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/generate-strings-by-substituting-wildcard-characters-y0oqk9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-and-convert-tree-to-children-sum-property-0f6kk7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-1-million-largest-integers-from-1-billion-integers-1blohy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/cab-service-scheduling-algorithm-in-oop-1rik6l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maximum-pieces-of-pie-7mg41y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/knight-shortest-path-on-a-chessboard-o2j7zk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/difference-between-b-tree-and-bst-93173f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/best-sorting-algorithm-9wjmmm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-highest-number-in-array-tyk4yi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/construct-binary-tree-from-preorder-and-leaf-info-7jym73</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/magic-balls-collision-umk130</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-rotis-for-workers-9l6b64</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/largest-number-from-array-2r0s6f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/array-sorting-ch3isz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/implement-bst-and-find-depth-e3gt99</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maximal-square-2s1km1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/remove-even-elements-from-vector-1wh0x9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-changes-to-convert-one-string-to-another-098yz5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-repetition-frequency-of-numbers-in-a-series-x36ljv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/compress-a-string-in-place-402qbp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-first-element-of-the-un-rotated-array-d8vet1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/find-missing-invoice-numbers-for-companies-mi62cm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reduce-array-to-single-integer-using-pascal-s-triangle-f30opg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-operations-required-to-convert-number-x-to-y-wpu8so</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reverse-a-stack-without-using-extra-space-j85pqi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-binary-search-tree-to-greater-sum-tree-58rwl2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/smallest-subarray-with-sum-greater-than-or-equal-to-target-oqe0e6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-two-farthest-nodes-in-an-n-ary-tree-c2pw8y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/subarray-sum-ymmpe9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/modified-fibonacci-series-unw2ca</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/gcd-using-euclidean-algorithm-hjul5r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/sort-array-elements-wn1czl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-smallest-element-yfya7p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/array-burst-remove-k-consecutive-characters-98v2wg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/recurring-sequence-in-fraction-akv27c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/row-with-maximum-1s-x6955i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/remove-duplicate-elements-from-an-array-g41dbp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/find-number-of-index-pairs-based-on-get-function-32fw5v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/minimum-cost-after-deleting-a-subarray-of-length-at-most-k-3841bl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/find-first-and-second-maximum-in-an-array-ma24lt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cisco/infix-evaluation-approach-t9ij0m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/quadrilateral-formation-z2cpoc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/largest-square-sub-matrix-of-1s-sclp2a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/leaf-nodes-at-same-level-zs5gi8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/wall-tiling-with-bricks-khfva8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/prime-check-and-square-calculation-xk7usq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/car-collision-problem-vbucv6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bst-node-replacement-ht10dv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/alphanumeric-keypad-conversion-iod5m9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lexicographical-combinations-dvw1ip</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pairs-with-sum-k-in-bst-n6m0u8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-difference-in-array-em54pb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/dictionary-word-split-mq32ro</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/vertical-order-traversal-d9iowj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/palindrome-check-and-modification-y3i187</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/merge-sub-arrays-qves0t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/java-features-inheritance-and-exception-handling-p28kvl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/count-vowels-and-print-pattern-lj41y8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/average-of-numbers-divisible-by-3-and-house-of-cards-levels-chhmx3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/write-quick-sort-implementation-l15tk2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-if-a-number-is-power-of-2-1nwvbi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-employees-per-department-w7selh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/remove-duplicate-entries-from-table-kt4oc1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-the-next-number-in-a-custom-sequence-3q47ud</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/write-inner-join-query-v8dkp7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/quick-sort-implementation-wjt1on</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/diagonal-sum-in-2d-matrix-ao1kyb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/smallest-matching-character-length-across-strings-6jpr30</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-numbers-by-frequency-and-value-dyf0gx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/spiral-order-of-tree-using-one-data-structure-ynv9hz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/shortest-path-between-cities-1dyh5m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/aptitude-and-data-structures-mcq-sl85gg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maximize-subarray-sum-expression-qb5xrz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/minimum-cost-to-color-balls-into-k-groups-zb2az4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/frequency-of-digits-in-a-large-number-cbv3d7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-middle-node-in-linked-list-m1djr8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sorted-array-to-height-balanced-bst-uxkz8b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/string-manipulation-6hglmx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/shuffle-substring-nzei69</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/layer-wise-k-ary-tree-traversal-pg403s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/set-elements-above-the-diagonal-in-a-matrix-to-zero-knd101</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/write-a-react-functional-component-using-usestate-3d8nrt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/count-string-length-excluding-spaces-st0jzq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/analyze-road-sensor-data-for-traffic-and-speed-statistics-lboe4s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-duplicates-in-o-n-time-and-constant-extra-space-r1zghb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/minimum-moves-for-an-injected-fish-to-eat-all-other-fish-bczk6l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-given-frequencies-in-ascending-order-91r8cu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-the-number-of-words-in-a-given-string-g2045x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/maximum-sum-pair-triplet-and-snake-and-ladder-minimum-dice-2ei20q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/lru-cache-and-stock-span-problem-4ynsta</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-2nd-largest-number-and-prime-factors-54h5e4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/validate-a-sudoku-puzzle-in-a-single-traversal-3zpvex</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-smallest-element-in-sorted-rotated-array-6q0742</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/number-of-ways-to-traverse-steps-seadv0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-duplicate-in-array-e9genx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/common-ancestor-and-tree-structure-dw4qdv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-steps-to-reach-end-of-array-2thafx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/design-minstack-zhct4s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/phone-number-prefix-search-s42uf4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-range-of-target-in-sorted-array-rmye63</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/sort-10gb-file-with-2gb-ram-lsa0vi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/segregate-odd-and-even-numbers-33z2yx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/balanced-tree-operations-h3n5mj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/unique-strings-and-frequency-count-pm9xih</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/sql-query-for-student-count-dz0t2e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-closest-points-to-origin-gqex9w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/demolition-robot-ea3ltk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/magic-numbers-qc2jza</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/expression-evaluation-r61q9v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/subtract-two-numbers-in-linked-lists-u7ldyl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/boundary-traversal-sum-8pouv1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-palindromes-in-paragraph-28yxni</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/transfer-data-from-running-jvm-to-another-8p93ja</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/solve-sql-queries-using-self-joins-qgt3zz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/explain-heapsort-algorithm-f6ay8k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/oops-concepts-and-inheritance-amma2p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/sum-of-even-numbers-and-multiplication-without-operator-10483e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/subarray-with-zero-sum-and-indices-s2zzny</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/difference-between-malloc-and-new-vz0yng</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/maximum-number-of-overlaps-n6rc7h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/virtual-keyword-and-backend-vtable-mechanism-4yf6a8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/overload-pre-and-post-increment-operators-meo9oc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/normal-constructor-vs-initializer-list-constructor-9z6wb5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sorting-numbers-in-java-zo437m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/dbms-keys-and-joins-4m2b5u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/calculate-average-of-30-numbers-in-cpp-q5ovkf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/elements-between-min-and-max-in-an-array-9qz9ly</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/evaluating-top-n-competitors-of-amazon-echo-v9dq80</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-nodes-at-k-distance-from-root-k1zlt6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-leaf-nodes-in-a-binary-search-tree-psey2s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/clone-a-stack-441sdx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/linked-list-and-queue-6iyo14</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/swap-even-location-elements-mfpw78</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/adobe/pair-with-given-sum-x0jnpu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-avl-tree-u0bbiu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/bank-counter-queue-puxze8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/binary-tree-node-update-ysjc8b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/check-palindrome-reverse-string-and-maximum-sum-jh7w99</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/add-two-linked-lists-from-msb-wmy9y8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-subarray-kth-largest-zero-rearrangement-and-hybrid-qyski6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/array-comparison-count-and-large-number-exponents-e5sqx6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reversal-algorithm-for-array-rotation-8pzk4g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/clone-circular-linked-list-8choqf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/compare-factors-and-factorial-properties-gyaok0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/merge-elements-into-a-sorted-array-with-empty-slots-sd4fi1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/angle-between-hands-of-a-clock-4lym1s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/find-intersection-of-two-linked-lists-960hyt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/tree-traversals-and-node-insertion-logic-k555le</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/predict-output-of-java-inheritance-code-aft72a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/bank-coin-ratio-and-work-time-aptitude-problems-w8t64s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-atoi-v9rug7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/lca-for-binary-tree-w2r6yw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/basic-java-oop-concepts-and-simple-array-implementation-td7fw9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-k-numbers-occurrences-in-a-given-array-and-unique-paths-9qwn1f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/edit-distance-and-word-break-ii-4yzr45</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/debug-switch-statement-code-and-arrange-even-numbers-at-even-xfk0r3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/left-view-of-binary-tree-and-paint-fill-problem-v9awe3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/second-largest-element-in-array-and-string-rotation-check-sna5t7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/sorting-techniques-and-implementation-6ofmsm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/print-100-odd-numbers-xtk7h4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/longest-palindrome-in-a-string-kj1esp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/root-to-leaf-paths-with-given-sum-c6x053</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/meaning-of-nan-in-javascript-96wom7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/output-of-string-and-number-addition-in-javascript-zu1vct</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/output-of-python-code-with-super-keyword-9y277u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/transmit-a-binary-tree-over-a-network-i5jn65</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/uncompress-a-string-stored-in-an-array-wrv6vq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/create-a-non-repeating-song-shuffle-function-shk90w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/technical-discussion-on-oops-dbms-and-cpp-concepts-rpu1oh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-sorted-array-to-binary-search-tree-ifx5qn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reverse-alternate-elements-of-linked-list-and-append-dixeu0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/top-5-frequent-words-in-a-stream-of-strings-jb5zis</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/java-synchronization-serialization-and-keywords-mqw53v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-for-mirror-tree-r0z2u3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/stack-with-push-pop-getmin-getmax-in-o-1-lc8mlf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/data-structure-with-popmin-and-popmax-vvzjy6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/generate-combinations-by-replacing-characters-using-hashmap-cped54</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-all-cousins-of-a-given-node-in-a-tree-1kr1o3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-median-of-unsorted-array-in-o-n-r573x6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/zig-zag-traversal-of-binary-tree-4wj2ga</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-length-from-input-node-to-leaf-u9adgj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/cpp-mcq-snippets-on-templates-vectors-pointers-and-sizeof-gk1i27</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/event-management-interval-operations-u9n6mf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/implement-a-stack-and-handle-out-of-space-whuz3c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-missing-time-intervals-within-a-range-8wyn7u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/log-file-analysis-is63fj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/voting-system-optimization-40un1o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/common-nodes-in-two-bsts-3wvmdp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-a-phone-directory-0h8h08</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-duplicates-from-linked-list-uznsd3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bst-to-linked-lists-qsr7uk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/queue-using-two-stacks-go25kl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-binary-values-1-to-n-5uq4x2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/lca-with-parent-pointer-qb3hic</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/sort-array-by-adjacent-swap-ul2zlu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/array-vs-linked-list-and-binary-search-qi8bg3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/four-sum-problem-62dl3i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-immediate-ancestor-of-a-node-jz7toc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/modify-random-pointer-in-binary-tree-0pesa3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/valid-unique-parentheses-combinations-b9uo4a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/construct-special-binary-tree-from-in-order-1irb8s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/first-occurrence-of-1-in-sorted-binary-array-4t5nep</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-duplicates-from-string-in-o-n-96mz7x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/first-occurrence-of-1-in-sorted-infinite-binary-tree-31srck</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/digit-count-in-array-7mqwll</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-stock-supply-3hng24</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/simplify-fraction-addition-p23i5n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/optimal-path-for-coin-collection-20xb3m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/optimized-character-count-jgshk7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/print-single-occurrence-in-original-order-2w5nqf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/missing-and-repeating-element-l9ut1x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/equilibrium-index-of-an-array-u3bgnw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/candy-crush-k-consecutive-elements-v2copz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/cousins-in-a-binary-tree-sgth3m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/word-search-in-matrix-dg2pw7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/populating-next-right-pointers-e2tqk9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/target-sum-problem-gwj0yj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/sum-of-odds-and-evens-in-a-number-3ogh4w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/add-and-delete-nodes-from-linkedlist-zk31l6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/puzzles-stock-buy-sell-and-permutations-prcw7s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/median-of-very-large-data-blocks-and-fourier-transform-58qf7r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/armstrong-number-and-mystical-array-transformation-cha3oe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/sql-join-20unsd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/matrix-pattern-printing-b9zex2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-moves-to-emergency-exit-in-grid-2qq4l6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/player-score-and-rank-data-structure-685mmp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/numbers-with-at-least-two-greater-elements-gihe59</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-prefix-for-each-string-e986za</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/string-permutations-greater-than-original-t03vq8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/year-with-maximum-population-9bmctw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/grid-traversal-with-traps-for-max-score-ga13lr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/validity-of-tic-tac-toe-board-configuration-y89opq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/elevator-stop-order-data-structure-n726jz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/knapsack-variation-with-item-array-output-m0v2l1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/print-all-anagrams-together-qff738</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/test-whether-graph-is-tree-7q34wo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/pairs-with-given-sum-in-sorted-arrays-zj3man</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/clone-linked-list-with-next-and-random-pointer-u25ynh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/webpage-authentication-login-form-cdxp2f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/k-largest-or-smallest-elements-in-an-array-3ggxcl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-pair-with-sum-equal-to-k-f51u7q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/min-coordinate-distance-uheuz8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-bigger-number-with-k-swaps-tss6y2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-sum-subsequence-fle6dx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/flatten-multi-level-linked-list-r9dncx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/ways-to-reach-distance-n-3yay6l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/write-code-for-fibonacci-series-7qshoq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/identify-first-repeating-integer-in-an-array-u8bejm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maximum-bugs-in-minesweeper-matrix-9qco5a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-mirror-image-of-a-tree-9j35ph</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/pairs-of-numbers-with-mutual-divisor-sums-j81jnm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/transform-string-by-replacing-prefix-matches-with-asterisk-1uh482</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-subarray-with-given-sum-handling-negatives-gwk1c8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-unique-characters-in-a-string-6oodj9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-substring-matching-pattern-1-0-1-zs2pxz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/optimal-strategy-for-a-game-nf7um3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/number-of-ways-to-decode-a-string-1o2iau</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-palindromic-permutations-dhxw32</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/clock-hand-angle-calculation-4tuwr7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/stack-using-two-queues-6h9ojp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/median-of-an-array-in-o-n-43w143</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/determine-code-output-zg6te4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-tests-to-determine-rope-strength-2vkbaq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/lexicographically-smallest-subsequence-drak3e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-fees-for-three-cricket-courses-9k7f6u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/generate-and-take-union-of-binary-numbers-by-flipping-bits-or4cvo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/jump-game-reachability-1xwvhm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/delete-n-contiguous-identical-characters-bq6s80</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/linked-list-traversal-lv9ixy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/find-height-of-a-tree-5llfmp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-leaf-nodes-at-max-depth-jye9se</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/triplet-sum-jbya5o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kth-smallest-element-5ynxgc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rotate-matrix-90-degrees-vyq59m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sorted-dll-triplet-sum-qn6dyh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-subtree-0hdquu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/full-binary-tree-level-fq8usg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-sum-of-subsequence-with-no-adjacent-elements-fes2w2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-stack-data-structure-using-an-array-pxze8r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/transform-binary-tree-to-store-child-sum-in-internal-nodes-5f7w60</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-minimum-guesses-to-reach-a-target-number-from-1-to-1000-f3zeo6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimize-pollution-filters-x7h3v5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-similar-cars-yp8j3r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rotate-2d-image-i435x5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/root-value-of-a-number-nd9ug5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-substring-without-repetition-grl73g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-merging-node-of-two-linked-lists-qku5mq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/tiling-a-floor-cpa8pu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-missing-variable-in-equation-22etbg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/linked-list-concepts-8jic7l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/reverse-a-linked-list-and-unique-paths-in-grid-20roo4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/cpp-vs-java-memory-management-and-dijkstra-kb48h0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-distinct-elements-and-unique-elements-in-sorted-array-o3hki8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/java-features-oop-principles-and-sql-joins-wcs7nu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/run-length-encoding-least-greater-element-and-substring-zozca9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-nth-element-from-last-and-convert-number-to-base-4-7eyr9v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-comments-from-c-file-and-add-two-polynomials-wl4r5x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/traveling-salesman-variant-with-plane-and-taxi-coupons-jtouo2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rotten-oranges-minimum-time-w3t5ef</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/recover-a-tree-from-preorder-traversal-f6c8gc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/max-gold-coins-with-division-operations-w6yy39</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-distinct-pairs-with-target-sum-3nbl8w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-unique-number-in-sorted-array-with-repeats-o2sopw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-row-with-maximum-1s-in-2d-boolean-array-l99hcq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/construct-tree-from-inorder-and-postorder-mof2xa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-number-of-levels-in-a-binary-tree-6i882m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/armstrong-number-and-function-modification-r2fp1x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/fibonacci-sequence-in-python-jvnq9n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sql-external-join-x7okh7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/b-tree-operations-fb916u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-nodes-at-odd-vs-even-height-pgz6d4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/swap-kth-nodes-4z33fu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-loops-in-linked-list-a2e53x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-length-palindrome-jzx1zd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/largest-word-in-dictionary-ooth77</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/python-list-slicing-nyemi7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/vowel-counter-9ts4g3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/removed-k-largest-digits-in-a-number-5zqtga</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-numeric-characters-in-alphanumeric-string-qfy1lg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/wildcard-pattern-matching-problem-11skex</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/string-compression-and-goldmine-problem-0u33u7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/cocubes-aptitude-debugging-and-coding-test-jeta5y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/python-concepts-and-final-year-project-m3e47l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-student-with-highest-score-and-trapping-rain-water-jy91lj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/kth-smallest-element-in-bst-and-top-k-frequent-words-mpvs22</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/longest-palindromic-subsequence-external-sorting-and-t07s61</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/package-compilation-ordering-3p9not</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-palindromes-up-to-n-nstlk6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/java-code-review-comments-q0h7hf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/graph-node-value-synchronization-time-n632n2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-character-occurrences-in-sorted-string-15sgi1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/knight-shortest-path-on-chessboard-2gizjt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/stack-with-o-1-findmiddle-operation-798zj9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/coin-change-ways-for-amount-x-qia81q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-position-of-single-set-bit-wnpm7r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/iterative-in-order-tree-traversal-yi04t3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/lexicographically-maximum-string-after-deleting-duplicate-rjo909</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-maximum-subarray-length-which-first-increases-then-fkrd91</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-number-of-leaf-nodes-without-using-recursion-14kvlu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/inheritance-polymorphism-and-constructors-in-cpp-km1kw7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/matrix-cell-zeroing-row-and-column-livbf9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/javascript-arrow-functions-ps6vu7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/postfix-evaluation-a3ug6t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/dice-throw-puzzle-3gqrl7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/roots-of-quadratic-equation-q99yyg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/linear-equation-in-one-variable-adf0dy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/locate-all-permutations-of-a-string-in-another-string-0o4mcn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-occurrences-of-an-element-in-sorted-array-0uycj6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/snake-and-ladder-implementation-d167m5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/random-number-generator-in-arbitrary-probability-cozd18</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/distribute-coins-in-binary-tree-5c1se3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/kruskal-mst-related-question-7vzvwn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/addition-of-3-linked-lists-x4wdqs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/level-order-traversal-in-spiral-form-4lxdyi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-substring-occurring-more-than-once-0imlb9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rightmost-character-with-count-1-8ot57t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-word-in-a-newspaper-8c4exz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/merge-two-balanced-binary-search-trees-mzbn3r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/iterations-to-fill-binary-array-with-1s-904wa4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/fill-matrix-rows-and-columns-for-cells-with-1-in-o-n-2-s3e665</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/cognizant/difference-between-hashmap-and-hashset-32tp1e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/maximum-xor-subset-xvn40n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/swap-two-nodes-in-a-linked-list-22g9ov</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/two-nearest-points-in-a-2d-plane-4yn398</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-nearest-points-to-a-target-a1h0yb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/matrix-row-and-column-zeroing-nz8sch</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/list-possible-words-from-dataset-td8e9z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-unique-number-in-pairs-e1od4n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-3-stacks-in-an-array-wm2vg3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-path-with-one-bend-tjvnk9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/compute-sum-of-two-fractions-p036gy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-string-and-bubble-sort-descending-di20hm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/google/find-first-1-in-an-infinite-sorted-binary-array-b4ld2x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/find-minimum-moves-to-reach-target-on-an-infinite-line-kc27xl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/print-all-strings-generated-by-replacing-with-0-or-1-ddug5f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/hashing-implementation-and-time-complexity-aumns7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/wipro/cpp-and-oop-principles-x64rjp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/find-the-next-higher-palindrome-number-bgc9bt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/coin-change-ways-39b60u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/profit-range-queries-n17tdy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-all-triplets-summing-to-k-3d5bj2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-in-stepped-array-06f274</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/android-pattern-lock-and-keypad-combinations-dxk5n6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/knight-walk-problem-jbrp9o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/intersection-point-of-two-linked-lists-v3r0dy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/count-squares-on-a-chessboard-7mpedc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-rectangular-area-in-histogram-be9ku1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/border-traversal-of-complete-binary-tree-pis9wo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-sum-sub-matrix-e3a9bb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/max-heap-problem-with-complexity-derivation-2t3y50</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/delivery-man-order-filter-sql-query-zhyw1p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/intersection-of-two-linked-lists-with-circular-check-qi34pe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-pools-in-a-binary-matrix-q9lzg8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-node-with-only-pointer-to-it-q78ipz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/implement-a-snake-and-ladder-game-cbpyw1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/reverse-a-string-word-by-word-ak075c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/capitalize-the-first-letter-of-each-word-m0hwme</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/reverse-a-list-xkvz5n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/binary-strings-without-consecutive-ones-p7mm7i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/paths-in-bst-with-given-sum-jae8n8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/rotate-array-by-k-steps-cegq7v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/valid-anagram-n4qqgp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/look-and-say-sequence-8gnhtn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/simplify-unix-path-78awzj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/simplify-polynomial-expression-zprn1s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/swap-elements-to-make-sums-equal-nfd1lk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/coin-game-of-two-corners-kuh4rm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/replace-node-with-sum-of-greater-nodes-hj9ugi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-depth-of-left-nodes-vyra0y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-run-length-encoding-of-a-string-p79171</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-spiral-traversal-of-a-matrix-mufy1b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-permutation-of-a-word-forms-a-palindrome-y7pnzs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-the-next-greater-element-in-an-array-sx7kar</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-a-non-greatest-number-in-an-array-in-o-1-hc5o8w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-maximum-frequent-numbers-in-an-array-q838nf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-characters-from-string-present-in-another-jq2u61</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-number-of-subsets-in-a-set-rytki1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-starting-petrol-bunk-for-a-circular-tour-9y983q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/construct-tree-from-preorder-and-inorder-traversals-wv1crj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-inorder-successor-in-a-tree-nw3au0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/threaded-binary-tree-inorder-traversal-983xxv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-length-of-contiguous-ones-in-a-binary-string-m7knc3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/length-of-longest-arithmetic-progression-15o1um</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/search-word-in-2d-grid-with-8-direction-zig-zag-traversal-riyg8i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-existence-of-2d-euclidean-points-for-multiple-queries-slsg03</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/insert-math-operators-into-digits-1-through-9-to-sum-to-100-r806d6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rearrange-string-characters-so-no-two-adjacent-characters-yf88kr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/check-if-a-string-contains-three-palindrome-substrings-xza2px</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/inter-process-message-passing-between-java-programs-using-32as3i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-array-alternating-positive-and-negative-numbers-29e5dl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-a-binary-tree-to-its-sum-tree-02d8dt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-index-preceding-first-occurrence-or-insertion-point-in-tp0a0m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/connect-next-pointers-of-n-ary-tree-children-in-spiral-order-ghsfi7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-two-strings-with-symbols-and-spaces-are-anagrams-6ojgxt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-cars-into-designated-parking-spots-using-minimum-9msfmn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/transition-points-in-sorted-strings-63qghy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/common-elements-in-two-sorted-arrays-da91e1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/deep-copy-of-a-linked-list-with-friend-pointers-qz54a6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-nearest-numbers-to-x-in-sorted-array-rcu58d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-cars-produced-across-two-assembly-lines-mo018j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-jumps-to-reach-end-5ct0rk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/distinct-passwords-with-even-index-swaps-fm13sj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/chocolate-distribution-to-k-friends-ar9is6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/total-ships-in-power-layers-3j4er4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/nodes-in-distance-range-in-weighted-tree-cfi169</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/first-letter-of-every-word-uy7sc9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-iterative-sequence-differences-m9a2zu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/nth-largest-element-in-bst-2wpt42</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/row-with-minimum-zeros-in-sorted-matrix-goin8x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/partition-linked-list-by-parity-ntg9hl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-number-of-disjoint-sets-ishm7w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sliding-window-minimum-ochxi3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/explain-stack-queue-and-merge-sort-sehjx1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/compare-or-add-two-strings-of-digits-2j3c5y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-largest-subarray-with-distinct-elements-mpov03</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/convert-binary-tree-to-n-ary-tree-with-level-connections-vnq6km</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-largest-bst-subtree-in-a-binary-tree-wr98i3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/python-fundamentals-and-execution-jvnx8u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-unique-prefix-for-every-word-ks92i7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-element-where-array-starts-decreasing-4g2aks</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximal-product-triplet-in-array-i7kckz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/construct-binary-search-tree-from-postorder-traversal-72iovi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/connect-nodes-at-same-level-using-next-left-pointer-nopey0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-k-nodes-in-bst-with-minimum-difference-to-target-m-xj6dg9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-subarray-sum-divisible-by-k-3mof6e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/prime-factor-representation-of-a-number-c0uwr6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/minimum-nodes-to-add-to-make-a-tree-balanced-9b67uy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/self-balancing-in-an-avl-tree-my1g9w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/minimum-spanning-tree-algorithms-comparison-ypnv66</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-intersection-and-find-point-for-two-linked-lists-t62uj6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-two-numbers-with-target-sum-t3h1it</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/stock-buy-and-sell-maximum-profit-l67hvr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-path-sum-in-grid-moving-right-or-down-0j2jud</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-zero-sum-consecutive-sublists-from-linked-list-y6gmsy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/number-of-digit-2s-between-1-and-n-j09vg1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/construct-a-special-binary-tree-from-preorder-traversal-q4l6qm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/multiply-two-numbers-without-using-multiplication-operator-vssss5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-unique-product-ids-from-a-large-file-ww59ex</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-key-in-linked-list-and-swap-with-previous-node-ca7f7l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-missing-numbers-in-unsorted-array-of-unknown-range-rqgd5u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/shortest-subtree-including-root-with-target-sum-8k9hij</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sort-an-array-of-rgb-colors-in-linear-time-16u7bt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/validate-ipv4-address-string-lxql5d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-sequential-page-visits-from-user-log-file-yup7j2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/count-numbers-ending-with-2-5-or-7-p71fxz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/sort-array-by-number-of-set-bits-vqk709</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-edits-to-convert-string-with-dictionary-constraint-5jcdal</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-closest-100-stars-from-a-billion-lqsel6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/distribute-chocolates-to-friends-in-rounds-t1vh7y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/shift-all-zeros-to-the-right-swbc9c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/monkey-jumps-to-reach-building-ceit9t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-semesters-to-complete-all-courses-rfaey3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-characters-so-no-two-adjacent-are-same-v2yvxy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reach-destination-city-with-fuel-constraints-j58u8q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/round-robin-scheduling-average-waiting-time-z5smwa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-unique-element-in-sorted-array-of-duplicates-tr8l3p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/time-to-infect-all-humans-with-zombies-yvke1v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-floating-point-decimal-number-to-binary-on7zen</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/swap-kth-node-from-start-and-kth-node-from-end-pyw1j2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-unique-names-in-a-large-product-file-nv20ew</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-first-missing-number-in-a-sorted-array-knw8rr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-number-of-ways-to-climb-stairs-n5qp0c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-first-index-of-any-duplicate-in-sorted-array-mp74xi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/calculate-win-probability-in-modified-snake-ladder-game-9ggmfa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/petrol-and-distance-circular-tour-problem-xs30ue</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-last-10-lines-of-a-very-large-string-6tr54r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/trim-bst-nodes-outside-given-range-674prl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/insert-element-in-sorted-circular-singly-linked-list-odrp7z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/zero-out-rows-and-columns-for-matrix-zeros-vz1mve</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/dfs-traversal-of-n-ary-tree-99f7gw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-managers-with-at-least-2-subordinates-2cp29h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-total-number-of-distinct-years-from-string-edfp7k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rearrange-odd-and-even-values-alternately-in-ascending-order-a8abux</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-substrings-and-find-longest-repeated-substring-mean64</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rows-in-table-a-and-not-in-table-b-without-multiple-select-wk36fj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sort-directory-paths-so-parents-come-before-children-o8sfz2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/kth-largest-element-in-an-array-it7zu3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/0-1-knapsack-variant-ovcyd9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/thread-safe-class-tgri7x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/search-word-in-large-file-qy2ta9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/dice-throws-f6lf0v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/mirror-trees-l1hms9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/reverse-triplets-in-linkedlist-z4g4oc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/frog-jump-problem-nn5l3a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/3rd-largest-number-hpz2e3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/bubble-sort-8bxqwz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/farthest-co-prime-447kux</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/number-of-trends-8axhq0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/subtree-check-4naa7u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/leftmost-node-in-last-level-rv12b7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-k-nodes-rn7dgb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/lunchbox-queue-tk1jrx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/course-registration-h9tloi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-binary-searchable-elements-in-unsorted-array-sung3f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-triplets-with-sum-divisible-by-3-6h08or</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-the-pow-function-1o2o03</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/swap-consecutive-bits-of-an-8-bit-integer-it0o2e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/merge-two-sorted-linked-lists-with-unique-elements-yipz06</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/city-path-cost-queries-42woyo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/intersection-of-two-rectangles-sk0ejg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-and-say-string-compression-sxx18i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/type-ahead-word-suggestion-system-gxdi7p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/bitwise-xor-of-binary-number-input-7ezx7m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/evaluate-postorder-expression-using-stacks-j5d6bv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/design-a-stack-with-getmax-support-d6zsx9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-farthest-co-prime-in-array-range-a9wvsm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-trends-in-a-linked-list-etchj9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-subtree-and-count-nodes-hfunw2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/write-a-program-for-if-else-and-prime-numbers-xt6eyy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/encapsulation-and-cpp-vs-java-xa0ovg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/virtual-functions-in-cpp-j9qebi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/digit-sum-condition-check-3fq9y4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/next-smallest-palindrome-ebv511</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/smallest-number-after-removing-k-elements-f1chma</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-deletions-for-strictly-increasing-sequence-3lhd7q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/word-break-variation-for-fewest-words-z3zgz5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/biased-coin-from-unbiased-coin-function-07a64g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/pairs-with-absolute-difference-k-pw8khy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/max-guests-time-interval-7sl3vn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-anagrams-of-string-0td8ua</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/binary-search-coding-problem-oezq1n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/difference-between-java-and-javascript-6lhms9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/string-and-number-palindrome-logic-68m641</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/string-immutability-ueye8h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/pickling-and-unpickling-in-python-m5g62h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/dynamic-method-dispatch-code-1e1w02</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/abstract-class-and-abstract-methods-in-python-lalax0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/method-overriding-rules-for-static-private-final-z8bsh8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/static-class-and-static-fields-e4sxkz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/characteristics-of-elements-in-list-and-dictionary-u7n95b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/overriding-clone-method-in-java-9g6fze</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/extensible-framework-5meotm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/python-platform-independence-97d68b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/constructors-in-parent-and-child-classes-qi825l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/not-equals-operator-o89knr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/even-numbers-generator-btj6nw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/dictionary-generation-with-squares-ppr2tk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-address-of-unsorted-node-cehc4g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/volatile-int-and-main-function-differences-t9n6wr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-binary-tree-to-left-aligned-down-right-pointer-tz74zk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-cycles-from-a-graph-k72zvr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/docstring-in-python-0dvj4s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sum-of-two-primes-0rajx7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/transpose-of-a-matrix-en0cpc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/create-table-using-select-99aolb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/nth-highest-salary-c27ltq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/shallow-vs-deep-copy-p7w1p8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/min-deletions-for-palindrome-hlwrl1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/collections-framework-7vjln0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/hashmap-vs-concurrenthashmap-716a7w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/comparator-vs-comparable-0nxstd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/static-keyword-x3qszm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/count-characters-in-string-teika8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/chocolate-distribution-7y1v4d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/substring-reverse-check-s95buv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-linkedlist-jzvt30</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/disconnected-components-ynd2w7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-path-in-tree-4fe1ue</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maze-probability-ctkzo8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/nth-stair-ouuiq7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/jumping-numbers-151w4j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/split-string-and-remove-matching-joint-characters-u9sr99</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/query-daily-candy-consumption-based-on-priority-u8ta8z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/determine-if-a-path-exists-between-two-cities-using-an-api-gmg62w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-parentheses-string-using-wildcard-x-nkjg51</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-two-nodes-in-bst-with-sum-n-with-space-less-than-o-n-kbox90</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/split-array-into-two-subsets-of-equal-average-3y7dge</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-the-number-of-islands-in-a-2d-matrix-o2l5ij</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-array-into-increasing-then-decreasing-halves-sa2d5i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-if-a-string-is-a-scrambled-form-of-another-v7yywj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/solve-sudoku-without-guessing-or-backtracking-and-provide-mezw9w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/game-theory-missing-difference-selection-game-6eh2pr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/min-operations-to-include-all-vowels-in-a-string-bb622z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-the-nth-element-of-series-1-1-2-4-8-16-32-vj06j7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-stack-using-arrays-k2wtdp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/clear-last-4-bits-in-a-single-line-of-code-kifm6h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-3-numbers-where-sum-of-two-equals-the-third-d5dlig</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/house-and-hill-peak-matching-mm9fm8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/postman-delivery-reachability-eqayo1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/decode-the-pattern-m92xup</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/bst-operations-and-applications-xz4l5s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sort-stack-with-temporary-stack-6n8pnc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rectangle-overlap-check-pptyw8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/string-substring-search-l1ls43</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/coin-change-sum-tlly1w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/modify-first-half-of-linked-list-avqf43</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reverse-alternate-levels-of-binary-tree-5zfvzo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/min-stack-implementation-t3k19r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-cost-to-merge-coins-9ebh6y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/first-and-last-index-in-sorted-array-9rwwnp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/custom-lexicographical-comparison-t3g21n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/urlify-string-x71tm3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/max-value-in-treenode-array-veyo3g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/segregate-even-and-odd-nodes-rdusm3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/min-difference-between-three-arrays-0fwnx9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/compute-power-function-ttpc22</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/construct-tree-and-find-min-depth-rl01ym</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/pairwise-swap-linked-list-nodes-24t21x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/matrix-level-order-fill-07ipkw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-distance-between-two-nodes-zk40el</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/form-biggest-number-from-array-4caawo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/smallest-subparagraph-containing-n-words-n44oz6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/smallest-window-in-a-string-and-k-queues-in-a-single-array-x7ucx9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/calculate-total-cycles-to-run-tasks-with-machine-cooling-k7oe1m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/restructure-tree-to-make-target-node-the-root-u4yre8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-inversions-in-running-stream-of-integers-w4dud3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximize-final-capital-by-selecting-k-projects-yid0tq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-distant-coordinate-pair-m5e702</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-increasing-consecutive-sequence-in-unsorted-array-c4mifl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-cost-to-convert-a-square-to-a-magic-square-y4m6ep</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/add-two-character-arrays-representing-floating-point-numbers-gcr9ko</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-if-9-is-reachable-in-a-grid-0m1acj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-maximum-in-an-initially-increasing-then-decreasing-5l2lr5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/decompress-a-compressed-string-kyy05u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rearrange-a-given-linked-list-in-place-h2h4ka</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/compare-words-using-a-custom-alphabet-system-yqq1mb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/urlify-a-string-and-fastest-way-to-loop-2d-array-i2exg9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-reverse-of-a-linked-list-without-reversing-h0ccr2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/book-pile-data-structure-with-specific-operations-c8398o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/venn-diagram-intersection-functions-jlc4mc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/search-an-element-in-an-array-nsd3pp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-armstrong-numbers-in-range-24son1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/pointers-in-java-q20a4c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/consecutive-b-s-in-string-3pr7pr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-tags-in-o-n-qlazq0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-element-in-rotated-array-hfr06y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/multi-source-bfs-hospital-v9zcmh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/subset-string-concatenation-ybbao8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/add-numbers-separated-by-zero-in-a-linked-list-in-place-h80uzk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-leaf-nodes-with-target-value-in-binary-tree-o14wv6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-alternate-nodes-in-a-doubly-linked-list-5azl9h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/search-dictionary-words-in-a-2d-character-grid-j79r50</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-knight-moves-on-a-grid-with-obstacles-aw04i8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sort-a-singly-linked-list-with-two-sorted-halves-5zljpn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/perform-and-optimize-operations-on-a-binary-search-tree-zohg8c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/select-a-random-lottery-buyer-with-uniform-probability-86d37k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/devise-and-optimize-a-custom-sorting-algorithm-x3p040</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/race-car-minimum-instructions-problem-ypui99</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/length-of-shortest-unordered-subarray-yv65xn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/0-1-knapsack-without-an-upper-bound-d3zrxo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-for-collinear-points-zt64kl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/partition-words-into-lines-with-a-maximum-character-limit-ll3ys2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/modified-minimum-cost-path-in-a-matrix-with-obstacles-84r7d0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-sequence-of-characters-by-occurrences-while-maintaining-k35qoe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-unsatisfactory-queue-positions-based-on-labels-6lvhy6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/print-prime-numbers-in-a-given-range-d0ajb8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-m-th-smallest-value-in-k-sorted-arrays-4oeagi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-duplicate-elements-gf2lcl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/merge-two-non-ascending-arrays-16i42u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/swap-kth-element-from-front-and-back-xkn8y6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/row-index-with-minimum-ones-pa52o8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/js-variable-logging-yt13l7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/js-type-coercion-9u610y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/typecasting-4kxgog</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/string-to-array-1j3h2g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/static-methods-z081x7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/nan-xji9bk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-points-in-circle-without-same-tag-g8sx0j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/populate-previous-pointers-in-a-tree-5yi937</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/string-permutations-without-duplicates-6rbyr3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/gas-station-circuit-dcs3tj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-initial-energy-required-to-cross-street-4dix3v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/convert-rand2-to-rand3-and-rand4-2z2zht</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/minimum-and-all-shortest-paths-in-8-directions-lzy08x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/goldman-sachs/game-of-stones-6pm03x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/longest-non-repeating-substring-u4y3qa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/max-value-expression-parenthesization-30064g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/difference-between-binary-tree-and-trie-23ulaz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-middle-node-of-linked-list-t43phh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-two-missing-numbers-in-an-array-fd5os8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/add-two-numbers-represented-as-base-2-bit-sequences-rekb5n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/fix-broken-circular-doubly-linked-list-cg4hmo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sql-queries-and-data-modeling-for-business-problems-952blp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-k-missing-elements-to-achieve-target-mean-5j5ssf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/replace-question-marks-to-avoid-three-consecutive-same-y8sngw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-character-uniqueness-within-variable-window-around-kx34ip</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sort-elements-by-frequency-in-decreasing-order-g0b3jt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximize-moves-deleting-pairs-with-equal-sum-ck4wsa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/time-taken-for-graph-vertices-of-degree-at-most-one-to-stop-cja16a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-three-elements-from-three-sorted-arrays-with-target-sum-yz1hnx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-triplets-where-sum-of-two-numbers-equals-the-third-37d977</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/segregate-even-and-odd-nodes-in-a-linked-list-gnt6e7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimal-length-substring-of-s1-not-containing-s2-as-a-w2rz6p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/swap-pair-of-adjacent-nodes-in-a-linked-list-2qc4nx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-three-decreasing-elements-at-increasing-indices-ocah9o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-removals-from-ends-such-that-twice-minimum-exceeds-ul0gli</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-equilibrium-index-where-left-side-product-equals-right-sgho5r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/generate-valid-parenthesis-combinations-for-k-pairs-tyuwm7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-tree-center-ball-to-minimize-tree-height-when-lifted-0o60er</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-number-of-platforms-needed-for-train-schedules-7colxp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-ransom-note-can-be-constructed-from-magazine-text-u2s9r5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/largest-subset-with-non-zero-bitwise-operation-result-079zvr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-cost-to-delete-adjacent-duplicate-characters-oe8rzf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-element-repeating-n-2-times-without-extra-space-0k0756</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/partition-incompatible-material-pairs-into-two-trucks-using-qlruj8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/determine-if-a-string-is-an-interleaving-of-two-other-1ugeii</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-lowest-common-ancestor-in-a-bst-0cek9z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/calculate-larger-angle-between-clock-hour-and-minute-hands-63v7fa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-bst-to-greater-sum-tree-recursively-and-iteratively-sfj1sc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-matrix-elements-in-spiral-order-hp43j9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximize-task-allocations-to-cpus-based-on-core-requirements-adtbd0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-neighbors-of-a-target-element-without-stl-t9wu97</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/separate-digits-uppercase-and-lowercase-characters-08bgt3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/lexi-string-problem-statement-and-logic-crzh1n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/islands-problem-statement-and-approach-2re8hs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/modified-koko-eating-bananas-duyej3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/coin-grouping-problem-j0jske</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-anagrams-of-a-pattern-in-a-string-utbvn0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shift-all-zeroes-to-the-right-of-an-array-3ubrml</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-number-of-factors-not-divisible-by-a-square-1jpc44</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/house-robber-with-path-printing-ybq9k8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-onions-in-parenthesis-expression-0jjx15</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/n-ary-tree-right-view-with-zigzag-order-ttt01y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-0s-and-1s-into-fibonacci-sequence-counts-fak6ov</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/number-of-ways-to-travel-cities-ng4w60</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-pow-function-in-logarithmic-time-9bnhhk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-substrings-containing-only-vowels-paeb4d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-linked-list-elements-alternately-from-ends-hejd77</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/alien-dictionary-alphabet-order-ndvlv0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-unique-pairs-with-given-sum-shwv1v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/keypad-number-string-translation-jrkaz2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/strobogrammatic-number-e1g5t0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-least-number-of-api-calls-u3n2eg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/motion-sensor-detection-path-vme4bs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/crawl-hyperlinks-and-find-dead-pages-zb44wk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/cpp-code-output-analysis-cokr4c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/swap-adjacent-array-elements-0yj431</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/character-shift-33ydvf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/solve-for-x-in-equation-2ie8o9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/min-max-in-stack-vl4enk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/diameter-of-a-tree-lwe4d1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/convert-n-to-1-6k5759</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/product-of-min-and-max-3uixe5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sort-matrix-rows-tmo3hd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/in-place-string-compression-vszp8s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-spanning-tree-ufs8ff</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/course-schedule-dependencies-qa250v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-two-strings-are-anagram-g8vxvs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-salary-hike-for-employees-based-on-ratings-wfb6ek</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/robot-path-loop-detection-r4czb6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/hash-map-with-o-1-insert-retrieve-and-o-n-key-lookup-4wgfnf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-distinct-clusters-of-ones-in-a-graph-mfa5ye</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-nth-largest-amount-using-sql-5e8l0e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/validate-bst-without-external-dynamic-memory-gppe62</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/database-design-and-sql-logic-for-a-given-scenario-qswm3c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/dangling-pointer-explanation-and-code-tpfs9s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/multithreading-in-java-implementation-and-explanation-vaf198</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/factorial-without-arithmetic-operations-vnz9s2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/pairs-from-array-whose-average-is-present-in-array-tjny4j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/database-joins-and-left-join-sql-query-ty6rvm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/path-with-highest-sum-in-a-matrix-with-obstacles-rn1qua</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/validate-string-against-regular-expression-28syd0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/box-stacking-problem-for-k-dimensions-oy5ms2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/graph-representation-and-code-for-adjacency-list-jaw4qu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/linked-list-reversal-iterative-and-recursive-4wixer</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-transition-point-of-an-increasing-step-function-ll7u4i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/data-structure-for-a-banking-system-wod7aq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/swap-two-variables-without-a-third-olh7kv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/stack-and-queue-concepts-evtg9e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/smallest-prime-factor-of-a-number-with-two-prime-factors-7b6nje</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-element-in-n-n-spiral-matrix-at-r-c-9kapzx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/modify-string-based-on-index-ranges-z1sf23</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/lca-of-two-nodes-in-an-n-ary-tree-wv8ijw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/update-bits-of-n-with-m-in-range-i-j-pu7b6b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-coins-for-change-k84paz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/special-stack-with-getmin-in-o-1-j59ydb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-all-possible-4-digit-numbers-from-4-given-digits-379s8p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/polymorphism-definition-and-code-rdayv4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sql-update-and-delete-queries-0s0hw7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/find-missing-terms-in-a-number-series-1co2sn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-value-of-i-j-with-a-i-a-j-6pb4xd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-sum-substring-divisible-by-k-r6cjwi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/most-viewed-product-from-a-log-file-6dkq33</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/dfs-of-graph-and-n-ary-tree-090cxg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-anagrams-of-a-string-in-a-file-2suvbm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-and-print-all-paths-in-a-matrix-1occjl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-bombs-to-destroy-matrix-cells-1pphwe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-majority-element-7cf9ic</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/diagonal-traversal-of-a-tree-lz2f24</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-distance-between-two-nodes-with-parent-pointers-and-ekd17o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/time-required-to-pass-information-from-root-to-all-nodes-a8pu2w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-a-row-wise-and-column-wise-sorted-2d-array-a13ejb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/range-minimum-query-with-updates-u449v4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/balanced-and-valid-brackets-with-priorities-47we3e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/filter-even-numbers-and-sort-vca5gv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/rest-api-frontend-consumer-5oca0e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/balance-brackets-in-an-equation-0bzcrq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-increasing-subarray-9c9qv0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-variable-dependencies-e1xn56</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/alternate-even-level-order-traversal-of-binary-tree-mw99ab</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-occurrences-in-sorted-array-of-unknown-size-q3cyjv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-subarray-to-delete-for-non-decreasing-order-q01fdf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-reflection-of-a-node-in-a-binary-tree-9oqncx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-profit-from-stock-prices-2nhsc6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/calculate-total-fine-for-cars-6g3pzl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sort-list-ignoring-k-least-significant-digits-6evfg8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/phone-dialer-prefix-search-3fqbpx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/root-to-leaf-paths-with-sum-t0bpir</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-rotation-count-in-rotated-sorted-array-n055h9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-palindrome-for-string-and-number-0c3os2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/heapsort-algorithm-3j6gpu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-number-of-decodings-kv6tym</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/parliament-voting-winner-1yrwon</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-tic-tac-toe-3anixv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-path-of-consecutive-integers-ky8zue</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/determine-race-finish-order-ejn2wb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/replace-substring-with-map-value-bor9c1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-connected-components-wl5br5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/subsequence-of-size-k-16ka81</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/duplicate-zeros-mt75c0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/subsequence-subarray-with-given-sum-hbtjl5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-locking-in-a-binary-tree-0zd7ch</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-k-consecutive-identical-characters-from-string-0053cm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-minimum-distance-of-open-points-to-nearest-person-in-a-gvo4u1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-a-linked-list-and-analyze-merge-sort-time-complexity-9w21fw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximize-partitions-and-priority-queue-number-multiplication-aa9rp2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/compute-execution-time-for-scheduled-jobs-with-slot-capacity-c06neu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/recursive-linked-list-reversal-add-numbers-and-cycle-fk76yp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-sum-from-equal-coin-amounts-in-subarrays-and-sliding-g6bxlw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-square-root-of-a-number-r5ctr3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/longest-palindromic-subsequence-length-5ro5hh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/graph-traversal-basics-xa5lqa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/clone-an-undirected-graph-uqteu0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/isomorphic-string-mapping-8zcvdh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/elements-appearing-more-than-n-3-times-s7aoqj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/in-place-sort-of-5s-6s-and-7s-b8cxzq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sum-of-k-smallest-elements-in-a-bst-6q33bq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/increment-operators-and-loops-gyuav8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/merge-two-sorted-arrays-in-place-9t9zqa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-number-divisible-by-2-3-and-5-2e521l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-a-matrix-with-sorted-rows-agg0vm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/height-of-special-binary-tree-ec7cmn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/matrix-chain-multiplication-f2tfhn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-standard-heap-operations-1o0ev8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/tic-tac-toe-winner-from-linked-list-uaq5qt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/set-matrix-rows-and-columns-to-1-8ieu22</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/copy-linked-list-with-arbitrary-pointer-qy3wgm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/maximum-number-from-string-of-integers-using-count-sort-cmw4rf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/merge-k-sorted-arrays-with-no-extra-space-bz8zik</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-path-sum-in-tree-with-up-to-2-parents-and-2-children-yik5dy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/replace-spaces-in-a-string-with-0-fgs7dk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/determine-if-a-tree-is-binary-81sbjq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-duplicates-in-a-string-efficiently-4oof50</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/word-frequency-counter-with-ordering-and-special-characters-z4dcty</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/minimum-flips-to-balance-parenthesis-expression-38p70g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-if-two-strings-are-anagrams-with-o-1-space-8i1mcv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/subarray-sum-equal-to-given-number-8os4vd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-elements-in-a-given-range-3nx2w3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/tournament-matches-and-line-ordering-data-structure-n7i8zg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kindle-library-dependency-resolution-pwfan4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-k-nearest-stars-to-origin-336xgo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/palindrome-linked-list-in-o-1-space-pfur48</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lowest-common-ancestor-and-minimum-distance-between-nodes-7ez751</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-concurrent-people-in-conference-room-mlie41</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/uncommon-characters-in-two-strings-using-one-map-lz20xe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/equalize-distribution-of-chocolates-3ror4s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/add-two-large-numbers-represented-as-strings-f5qm2e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-path-in-rectangle-avoid-circular-obstacles-ygu344</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/box-stacking-with-single-box-constraint-kso65b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-elevator-steps-to-reach-floor-b-e2s4pw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/convert-excel-file-to-csv-in-python-hky2b6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/code-for-establishing-database-connection-b9azec</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/post-order-binary-tree-traversal-implementation-u679zi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-nodes-at-distance-k-in-binary-tree-j9vefo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lca-of-deepest-leaves-in-rooted-tree-n77jg7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-subsets-with-target-sum-15axq3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/prefix-search-in-string-list-using-trie-zlnjt7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/package-installation-sequence-via-topological-sort-had94c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-pairs-of-strongly-connected-pixels-xhzx9a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/pair-leaf-nodes-in-n-ary-tree-without-sharing-common-path-w7kfmn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-leftmost-node-at-same-level-given-node-pointer-242h6j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/in-place-convert-c-string-to-ascii-representation-x0h12a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-anagram-substring-of-s2-in-s1-in-o-n-1n86j5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/schedule-meeting-for-multiple-employees-given-time-interval-0xi3mn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-words-can-form-a-chain-matching-suffix-to-prefix-z1dqsn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-subsequence-with-alternating-diff-less-than-k-j9951t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reach-target-coordinate-from-1-1-via-additions-7remzb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-non-empty-partitions-of-a-set-into-two-groups-byt179</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/backspace-string-compare-in-o-1-space-po88en</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/design-a-stack-with-o-1-middle-element-operations-ztj4xj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-path-from-target-key-to-root-in-binary-tree-cw05gg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-kth-largest-file-in-directory-tree-a55hn0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-ways-to-climb-stairs-with-broken-steps-5nm4m8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/simulate-movement-commands-on-2d-plane-ce68cl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-positive-and-negative-numbers-alternately-in-o-1-loi1pd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/move-zeros-to-end-with-minimum-swaps-dh617v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-intersection-node-of-two-linked-lists-l6mnjo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-occurrence-of-second-string-from-first-string-in-cpkm8e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/insert-into-sorted-circular-looped-linked-list-with-s0tjey</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/recurrence-relation-for-writing-distance-with-reusable-880ihb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-largest-sum-subtree-in-binary-tree-vgq6o4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-kth-minimum-element-from-two-sorted-arrays-z6ogmm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/fold-and-merge-a-linked-list-wwlir8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/prime-check-for-biginteger-iq8a9l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-nth-node-from-the-end-euix9c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/multithreaded-fizz-buzz-plb02c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-min-and-max-in-one-pass-nu6zk9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/search-in-sorted-list-with-empty-strings-skif7h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/regex-matcher-with-wildcards-uv93yl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/valid-parenthesis-with-wildcard-elpxu8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/the-celebrity-problem-lc945e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/josephus-problem-in-circular-linked-list-rt0c0c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/two-sum-in-a-bst-ho0vib</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/core-subjects-and-inheritance-basics-discussion-u0ucg0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/spiral-level-order-traversal-and-topological-sort-nvro3d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/spiral-order-traversal-in-trees-with-complexity-analysis-3n350t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/c-vs-cpp-classes-virtual-functions-and-virtual-tables-f5ejv2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/oop-properties-keys-postfix-conversion-and-graph-traversals-kxt7rl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/nearest-k-coordinates-and-grid-distance-9brrty</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/first-spectator-with-a-unique-nationality-7zamh7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/os-scheduling-cache-implementation-and-database-kikkv5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/array-vs-linked-list-shortest-path-and-high-level-design-5tnn2a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/coding-optimizations-complexity-and-real-world-scenario-umh0dw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/nearest-perfect-square-qv8g0l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-node-collisions-in-horizontal-distance-q0zaqv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/max-min-sum-subarray-of-size-k-9n5x58</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/nested-list-weight-sum-graph-variant-iwt5ed</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/frequency-of-array-elements-qdjrw7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/bitwise-and-operation-pwg58p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-word-occurrences-using-z-algorithm-h96fx7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/dictionary-access-kypgt1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/min-bits-to-flip-for-alternating-string-9fv72p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/conditional-string-capitalization-57zi8t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/matrix-zeroing-gxd83s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/author-book-sales-query-s9s385</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-lcm-of-two-numbers-using-command-line-arguments-vqas7p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-3-points-forming-a-triangle-with-no-inner-points-utsim1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/next-permutation-and-word-search-ovo6ib</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/prefix-with-equivalent-frequencies-64too8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-middle-node-in-list-with-loop-and-find-majority-dlih7y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-node-given-address-nth-from-end-and-validate-bst-5cpdaz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/bit-swap-bst-to-dll-and-sorting-0s-1s-2s-in-linked-list-o19zwu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-characters-and-reverse-alternate-k-nodes-in-linked-rxdf6s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/spiral-matrix-remove-duplicates-and-memoization-27b6jl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/validate-bst-lca-in-bst-and-reverse-pairs-in-linked-list-up7u2s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximize-array-elements-and-count-word-occurrences-in-matrix-n09fon</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/normalize-a-file-path-in-place-a56x9q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-all-downward-paths-in-binary-tree-with-sum-n-l01fn8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/determine-metallic-ball-coordinates-from-x-ray-projections-58k4ww</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sum-two-numbers-ipqet8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/check-if-a-number-is-even-yhpp12</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/generate-fibonacci-sequence-0sba1j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-divisibility-of-binary-stream-by-n-m2m465</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/spiral-traversal-of-a-matrix-from-any-corner-in-both-mdkzc9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-cost-to-connect-all-cities-mst-ozyp0r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-smallest-number-to-append-to-make-palindrome-maglc0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-bst-keys-outside-given-range-d8da5a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/repeatedly-delete-kth-node-in-circular-linked-list-until-one-034gdh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-pairs-or-combinations-that-sum-to-k-in-tree-and-array-i9qtti</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/best-time-to-buy-and-sell-stock-for-maximum-profit-3ngwfi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/replace-zero-nodes-in-linked-list-with-sum-of-intermediate-60f6b2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/flatten-a-multi-level-linked-list-in-sorted-order-u0kxnz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/detect-and-count-cycles-in-a-directed-graph-l8vtce</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-string-formed-by-concatenating-other-array-strings-al330x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/decode-string-with-entity-mappings-from-a-hash-table-dbhiq6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/decimal-to-binary-conversion-zmf7ph</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-synonymous-strings-32agwg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-number-with-k-swaps-a2lzw9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/distinct-elements-in-windows-of-size-k-kncn4o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/closest-element-to-k-in-bst-vzvqo2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/smallest-range-from-k-lists-1ha0e1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-sum-without-adjacents-mm9os8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/missing-number-in-array-pgt4oh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-itinerary-from-a-given-list-of-tickets-0dr2x9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/two-sum-closest-binary-search-problem-65srsk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/swap-nodes-in-pairs-mo4vnz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-all-subsets-of-the-given-array-102i4v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/search-in-row-wise-and-column-wise-sorted-matrix-hjp0a9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-itinerary-from-tickets-and-multi-source-bfs-nu52la</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-k-duplicate-elements-n1rtoa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-j-i-such-that-arr-j-arr-i-uto52c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/convert-uppercase-letter-to-lowercase-letter-ice69l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-sum-continuous-element-sliding-window-jrsts1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-minimum-disjoint-friend-groups-iznge2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/amicable-numbers-r1r3e7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/online-coding-questions-80hlvv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-integer-and-missing-numbers-hmztl9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/n-ary-tree-serialization-m0xtbj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/square-root-implementation-a7vcio</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-next-greatest-number-using-digits-xw9hzi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-value-of-ai-i-aj-j-igy67d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-bst-and-implement-in-order-successor-kpbo3i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-stack-using-arrays-linked-lists-and-queues-y67cwp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-queues-using-stacks-nzrsu2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/node-appearing-maximum-times-in-tree-with-duplicates-wy67zn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/generate-all-possible-subsets-5b4y1i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bfs-modification-on-a-grid-and-pseudocode-d0w6yg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/append-two-arrays-function-memory-scope-5iduot</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/image-carousel-in-vanilla-js-qcn0m6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/5-star-rating-component-29umc7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/whatsapp-last-seen-dynamic-component-j5fafi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/organizational-social-network-friend-recommendation-hj3jf7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/if-else-application-and-pattern-printing-4a5gty</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/deletion-operation-on-doubly-linked-list-ds7rcf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-iterations-to-rot-all-oranges-4z6ka9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-distinct-elements-in-every-window-of-size-k-1c06ya</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/add-2-link-lists-cld3j0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reverse-link-list-6t4qzu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lca-in-binary-tree-lxbda6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lca-of-k-given-nodes-in-a-n-ary-tree-3hluka</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-number-of-unique-rows-in-a-boolean-2-d-matrix-nqac7r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/make-code-thread-safe-415yf7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/modify-binary-tree-to-preorder-using-right-pointers-1bli9o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-strings-not-a-prefix-of-any-other-v2w9z3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-number-of-platforms-igp997</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/linked-list-with-next-and-arbit-pointer-7jpgz4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/union-and-intersection-of-unsorted-arrays-bzmwc0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-height-of-a-tree-kggzh5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reorder-linked-list-dcgyc6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-turns-in-a-path-qbit6e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/range-sum-query-zrdb6e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/evaluate-bitwise-expression-e3rnxj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/deepest-left-leaf-node-91twb8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/extract-leaves-to-doubly-linked-list-g8p9jp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-alternate-nodes-g8axou</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-string-zj3tzb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-string-by-custom-order-0wlrer</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/nth-fibonacci-number-7u6ur0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-endmost-nodes-in-zig-zag-fashion-tnw1sv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/snake-and-ladder-problem-kvi4oi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/optimize-max-sum-triplet-with-constraints-igbkn8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/reverse-a-string-manually-3gruis</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/check-for-all-alphabets-in-a-string-4p3dsg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/string-construction-with-no-adjacent-duplicates-nqg4b5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/equalize-array-sums-with-one-swap-5snk8o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/flipkart/n-digit-lock-with-deadlocks-xvi088</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/file-management-system-implementation-0a3nak</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rare-vowel-string-q24m12</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-median-of-an-array-j1g8y6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/maximum-length-distinct-substring-69muc0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/combinations-to-score-n-runs-f1vq20</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/kth-element-from-right-end-of-singly-linked-list-5gbzwy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/split-string-into-two-balanced-bracket-substrings-fr2yvt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-days-ideal-for-camping-based-on-rainfall-9xbw82</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-triplet-in-array-whose-sum-is-closest-to-given-number-0yx687</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-path-in-a-binary-maze-jv5mr5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/merge-3-sorted-arrays-with-removed-duplicates-mhm3am</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-minimum-people-so-no-two-are-adjacent-2ooht4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/design-a-global-iterator-over-n-sorted-lists-8f6w88</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-time-for-fire-to-reach-node-in-binary-tree-lwn3sm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-a-node-in-a-binary-search-tree-b2shnp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-all-possible-words-from-phone-digits-7f7pw3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-kth-visited-number-in-a-spiral-matrix-traversal-gqdq4z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/modify-linked-list-by-subtracting-corresponding-elements-gu8oqw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-nth-pattern-string-based-on-alphabetical-sequence-747xha</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/clone-a-graph-7v3lol</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-row-with-max-1s-in-a-boolean-matrix-2vopom</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/form-largest-number-after-k-adjacent-swaps-kw0x9q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-frequency-of-each-number-in-large-array-av28ig</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/multiplication-of-two-20-digit-numbers-ip9uxk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/excel-sheet-column-number-and-name-conversion-iw59e6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/rank-of-permutation-in-increasing-order-1j67bp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/separate-positive-and-negative-numbers-in-large-array-4uzx2x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/generate-all-unique-integer-partitions-ukiv0f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/check-palindrome-and-find-all-palindromic-substrings-d98poy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/process-unique-and-repeated-strings-with-concatenation-check-xywu5p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/insert-node-in-the-middle-of-linked-list-hl6hev</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/smallest-number-formed-by-rearranging-digits-numbers-lkg3p9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/initialize-a-linked-list-and-manage-memory-yjle9g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/explain-and-code-red-black-tree-hepo4f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/file-processing-and-api-matching-c58e0t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/towers-of-hanoi-algorithm-with-3-and-4-piles-i354xl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/level-order-traversal-for-binary-and-n-ary-trees-9j72lr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/gas-station-circular-route-8d1jby</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-leaves-and-right-view-of-binary-tree-3bd94d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bottom-view-of-binary-tree-via-bfs-and-dfs-wb90k2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-concurrent-files-in-directory-over-time-v05krg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/cycle-detection-in-a-directed-graph-5d2vio</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/bounded-knapsack-problem-ce4rho</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/virtual-function-implementation-and-polymorphism-51tvih</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/linked-list-operations-and-swap-without-extra-memory-8onjdg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-rare-vowel-string-group-anagrams-tb26m6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/covid-spread-ft4x0j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/calculate-difficulty-of-a-given-sentence-n8245s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/calculate-slope-changes-in-a-linked-list-8rh11u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/calculate-pow-x-n-without-recursion-gwugk6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/determine-and-resolve-rectangle-overlap-mkv9ky</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-tic-tac-toe-configuration-validity-djmrp0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-the-range-enclosing-a-given-key-in-a-sorted-array-q4r0cu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-a-given-string-in-a-specific-diagonal-pattern-ibmon3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/standard-bfs-in-a-matrix-z8xc15</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-order-statistics-using-priority-queue-oz5bqs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-rows-covered-with-given-milk-and-dark-chocolates-v2bhu9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-subarrays-with-equal-number-of-1s-and-0s-tmbar3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-linked-list-in-groups-of-size-k-by-chunk-sum-t83ch5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/gear-box-rotation-calculation-4arzk3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-binary-search-algorithm-76ooxh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/bst-binary-tree-views-and-graph-bipartiteness-7kcdj8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/make-array-elements-equal-via-additions-and-subtractions-x07jwc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/dice-throw-dp-problem-0ubkxo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-subarray-with-given-sum-50xvm2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-carries-in-addition-domc9k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/shift-negative-numbers-con55b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/multiply-linked-lists-y9mkfx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rotate-linked-list-in-groups-k5q9j5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sort-row-wise-matrix-a2jb42</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sql-transaction-query-46vkx4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/bulb-toggling-pattern-v165j6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/count-warship-groups-id3gtd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/non-repeating-words-from-two-sentences-2hbbkg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-island-size-86wzj1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/replace-with-immediate-greater-element-40q1rd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-in-each-k-sized-window-1pgxtn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/dual-value-tree-data-structure-1n0hft</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-possible-decodings-47xo62</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/top-k-persons-by-friend-count-8bnd12</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-distance-between-coordinates-0934ec</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-leftmost-right-cousin-in-a-binary-tree-92jtgw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/words-containing-other-words-as-prefix-q1wmtd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/snake-and-ladder-and-graph-creation-constraints-4t4j3x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/position-of-required-string-in-spaced-list-0al5gj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/numbers-occurring-even-number-of-times-5pjfsp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rotate-2d-matrix-clockwise-by-90-degrees-inplace-a12efy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-values-of-full-nodes-in-binary-tree-jii7k4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/search-for-element-in-array-with-minimal-comparisons-tfj0wf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-index-of-element-greater-than-given-number-jg7gwt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/k-th-smallest-element-in-row-wise-and-column-wise-sorted-3zdogh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-time-for-all-oranges-to-become-rotten-ew1eib</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/all-pairs-shortest-distance-xr6qkm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-duplicates-from-1-billion-numbers-in-o-n-a378c8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/oop-principles-polymorphism-and-java-features-4nti68</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-path-in-grid-without-plants-1iizjm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kth-lexicographically-smallest-permutation-with-rules-7a1ybi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-duplicate-ip-addresses-with-optimized-space-anm3yp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-path-sum-without-space-complexity-k9ukt2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/anagram-substring-search-i4ndn9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-hops-between-friends-5vkb1k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/nodes-receiving-light-from-left-in-tree-pa8o24</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-subarray-with-zero-sum-0wm8qz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-hops-on-number-line-2niuyc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/data-structure-for-best-fit-algorithm-mqr8ml</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/memory-access-conflicts-lwpms2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/remove-spaces-and-count-pairs-with-given-sum-b8vv92</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-pairs-with-given-sum-in-sorted-array-g22fgq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/evaluate-an-expression-string-without-bodmas-yecm3h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-array-to-alternate-positive-and-negative-numbers-7xn4nq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-kth-largest-element-in-two-sorted-arrays-jgk8k2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/determine-top-3-most-occurring-k-page-sequences-6v3qg5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/floor-square-root-without-using-sqrt-function-5dan9t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/replace-each-array-element-with-its-farthest-coprime-0xwtor</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/return-factorial-of-a-number-as-a-string-ifc7g3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/return-size-of-subtree-if-b-is-a-subtree-of-a-xnxg1s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-number-of-unique-pairs-summing-to-x-in-sorted-array-p1egpg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/level-order-traversal-with-level-prefix-on-each-line-x6vq8k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-a-string-contains-all-unique-characters-p980jk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/assign-nextgreater-pointer-in-modified-linked-list-of5m9c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/right-rotate-a-picture-matrix-by-90-degrees-1utl85</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/space-optimized-check-for-bst-n0q2h3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/create-linked-list-with-elements-of-first-list-not-in-second-te2nyl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-all-pairs-in-unsorted-array-summing-to-n-1ro5uf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/determine-triangle-type-from-three-points-5so9eh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/implement-atoi-and-strstr-f4lnsw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/what-is-parenthesis-checker-bm6nj3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-a-stack-using-arrays-9p26e7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-depth-first-search-traversal-on-a-graph-z8b0ge</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/solve-the-two-sum-problem-using-hash-maps-ozf1xx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-a-priority-queue-using-a-binary-heap-72y05i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-longest-contiguous-sum-in-an-array-2u8ssf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/detect-loop-in-linked-list-and-find-starting-point-2vw6cq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-kth-largest-element-in-a-binary-search-tree-01jdwl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/calculate-the-date-of-the-next-eclipse-t8ggfi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/calculate-simple-rate-of-return-and-annualized-return-fm4u3t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/calculate-total-brokerage-fee-for-stock-transactions-yfz01w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/add-two-numbers-without-arithmetic-operators-w9ljy2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bst-path-from-array-insertion-order-rs37hd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-the-decoding-for-a-given-digit-string-fu705t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/efficiently-extract-a-message-from-a-printed-stream-tse0f0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-diagonal-of-1s-in-a-2d-matrix-dp7kmn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-number-divisible-by-30-from-array-elements-3cp29x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-nearest-neighbors-in-a-bst-9o60fb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/range-maximum-query-with-constrained-values-cu4xk1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-missing-numbers-in-a-sequence-2rp7tw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/top-10-largest-strings-in-a-continuous-stream-nyy48e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-all-peak-elements-in-an-array-nsw7pa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/populating-next-right-pointers-in-each-node-1090y8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/python-lambda-functions-and-string-reversal-9qhfw9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/zigzag-pattern-printing-g7a9ta</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sql-update-without-select-3ciied</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/replace-elements-with-nearest-smaller-on-right-2cqt23</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-pair-with-sum-k-lr0tue</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/avl-tree-concepts-yex6yh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-all-valid-permutations-of-parentheses-82iise</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/determine-if-linked-list-nodes-are-odd-or-even-in-count-a9lbrh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/segment-tree-implementation-hz76nb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-bst-to-contain-greater-element-sums-w0ctto</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-k-closest-elements-to-an-element-in-an-array-a3erk4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/delete-node-from-linked-list-with-tail-pointing-to-mid-1tad5i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/circular-buffer-array-problem-ai5r1p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/explain-algorithm-behind-sudoku-solver-is2hqb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/difference-between-arrays-and-structures-v620pd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/pointers-and-parameter-passing-differences-rv7y07</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/difference-between-sets-and-dictionary-7x6p7u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/spaghetti-programming-in-c-3fssiu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-binary-representation-of-n-is-a-palindrome-b8eilz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-absolute-difference-from-three-sorted-arrays-zlm6wj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/convert-string-to-integer-atoi-7c28ra</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-queue-using-single-and-two-stacks-9kznlt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-unique-pairs-that-sum-to-a-target-4k3iqk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-single-element-in-sorted-array-where-others-appear-hblb69</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-distance-to-nearest-door-in-a-grid-335s0o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/word-break-ii-variant-ka4a8i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/aws-specific-scenario-using-binary-search-rbi00g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-occurrences-of-anagrams-of-a-word-in-a-text-66wpqd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-right-sibling-of-a-binary-tree-node-with-parent-f076rx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-subarray-problem-in-one-pass-q85yte</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/write-cpp-code-for-oop-features-and-constructors-oxin40</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-division-without-using-division-operator-7mux1a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/buy-and-sell-stocks-to-maximize-profit-1-action-per-day-41z5j4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-child-node-in-binary-tree-given-level-and-child-index-42lta0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/build-a-boggle-game-om0vqp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-anagrams-from-a-list-of-words-x587cm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sort-an-array-of-unspecified-size-in-descending-order-wj9b6u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-the-pivot-element-in-an-array-6okuuw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/replace-all-0-with-5-in-an-integer-s112yx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-subsequent-distinct-and-contiguous-sub-array-0l0sqo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/verify-amazon-logo-on-every-page-wkj303</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-a-stack-using-two-queues-at0ze5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/contiguous-elements-in-an-array-whose-sum-is-k-4d10y9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/stack-with-getmin-and-getmax-in-constant-time-5itvej</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-character-stream-to-valid-sentence-jd1bst</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-continuous-non-repeating-sequence-clg3hn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-largest-palindrome-number-9mf6qz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-10-largest-numbers-in-an-infinite-stream-dvi7ym</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/nodes-at-distance-less-than-k-in-a-graph-tay1vy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/query-for-10th-highest-salary-1gixtn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/convert-base-4-string-to-base-2-in-place-6vjcxv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-duplicates-from-string-in-o-n-time-and-o-1-space-c46y1l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sub-array-where-all-pairs-sum-greater-than-k-q63d21</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-minimum-in-a-rotated-sorted-array-69ackm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/difference-between-sum-of-odd-level-and-even-level-values-in-k9lbqy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/tapping-rain-water-problem-rk7tfg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/query-html-format-string-e7hyxb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-if-a-number-is-lucky-yrlj1q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/common-element-in-row-wise-sorted-2d-array-gnkrb8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/length-of-longest-palindrome-list-in-linked-list-v1dqgj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sum-of-leaf-nodes-at-same-level-and-multiply-sums-v409dm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/min-sum-of-absolute-differences-from-three-arrays-whwk6v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/detect-arithmetic-overflow-and-underflow-nclk3o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reconstruct-circular-seating-arrangement-from-neighbor-chits-ms6g8a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/group-anagrams-together-preserving-original-order-v09qx3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-start-indices-of-pattern-anagrams-in-text-21jde3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-minstack-using-one-stack-u6zb90</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-palindrome-from-string-characters-mvva63</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-length-substring-containing-all-pattern-characters-d5bfh2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/array-product-excluding-current-index-s7sfdd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-topper-of-each-subject-using-sql-g2lcat</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/buy-and-sell-stock-variants-q72grt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-connected-components-in-binary-matrix-k6hmba</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/min-removals-so-max-element-is-at-most-twice-the-min-i3qz2c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/connect-nodes-on-same-level-to-their-left-sibling-t7pvr3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-leaves-corresponding-to-tree-diameter-d9dka6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/data-structure-with-o-1-insert-delete-count-and-get-d6h790</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/stickler-thief-u9onok</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/distance-between-two-given-nodes-m213tu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/delete-a-node-from-singly-linked-list-without-head-me1b2e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/create-an-html-validator-w6zl0u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/implementing-a-simple-neural-network-in-python-anps6f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-second-largest-salary-and-top-5-salaries-exk6t6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/code-merge-sort-j9bkhn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/dijkstra-s-algorithm-for-shortest-path-ak0chz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sorting-an-array-consisting-of-0s-1s-2s-3ev2bf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/throw-dice-problem-2vg53y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/n-staircases-with-age-based-steps-k6rz3q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-k-largest-elements-in-a-1-gb-file-wm1jg4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-a-given-matrix-in-spiral-form-k2ean4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/reverse-a-linked-list-in-the-pair-of-two-v371t8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/write-a-program-to-draw-the-diamond-shape-dcku5a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-kth-character-in-string-after-n-iterations-l2ku6v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/merge-sort-vs-quick-sort-preference-k0howx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-a-given-word-in-a-dictionary-4widah</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/hamiltonian-cycle-and-graph-questions-wr6rww</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-sum-consecutive-elements-with-modifications-wqeb41</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/matrix-zeroing-and-missing-element-in-sorted-array-qb6xvw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/character-with-most-occurrences-in-a-string-5mld6t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/python-lists-and-duplicate-element-syntax-b6m4fu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/palindrome-check-with-multi-byte-characters-2708q9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/n-th-node-from-tail-9crlb6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/k-most-recently-used-apps-dyh35q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/row-with-max-1s-9ncyd4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-single-element-in-pairs-dne8xe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-substring-without-repeats-s5hctt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-in-circular-array-ucu8bg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-path-in-a-graph-diameter-ksk3wx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-higher-palindromic-number-using-same-digits-sn12vl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-complement-and-2s-complement-gd6poe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-unique-function-signatures-in-string-t8p0k6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/largest-free-area-in-box-3fvjg9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/aesthetic-packing-of-smaller-boxes-vw42df</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/area-of-a-triangle-using-command-line-arguments-y8stfy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-the-average-of-an-array-3mav6y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/reverse-alternate-k-nodes-in-a-linkedlist-mtn2m7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-nearest-smaller-numbers-on-left-side-in-an-array-5xicc4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-a-given-tree-to-sum-tree-9wll8m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/alien-dictionary-r9ion1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sql-queries-for-employee-table-ncyk6j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/longest-common-palindromic-string-yo71hq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/minimum-time-to-fill-matrix-with-1s-0ppwv1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/student-state-transition-simulation-ho872x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/staircase-problem-8b9gn7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-subarray-sum-with-multipliers-ndwy6s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/minimize-maximum-difference-of-k-numbers-eov355</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/series-generation-q87w52</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/jdbc-connection-code-4njju0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/print-balanced-parentheses-h5n53i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-string-without-temporary-variable-lvr0ru</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/aggregate-and-average-values-by-timestamp-itcgd6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/least-unique-integers-and-minimum-cost-to-connect-cities-4lcpd0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-smallest-positive-number-missing-from-an-unsorted-kd70kd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/directory-path-from-shell-command-execution-108aa2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-all-pairs-with-a-given-sum-5j4bt4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-frequency-in-sorted-array-with-lower-upper-bound-22921e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/convert-a-given-matrix-into-a-lower-triangular-matrix-p6lq9q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/code-word-to-matrix-and-print-transpose-e34rvv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-water-in-a-glass-a46jpi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/zero-out-rows-and-columns-if-cell-is-zero-5srhou</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-two-numbers-with-given-sum-in-sorted-array-uechf4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/add-two-numbers-x2ruhv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-weight-in-binary-tree-6nf90j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-distant-nodes-from-origin-k6mrd3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/practical-implementation-of-arraylist-irbhc3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-sorted-sub-sequence-1cue43</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-a-stack-h9gwvu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/clock-angle-problem-sw07c8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-swaps-to-sort-array-g71gym</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-decreasing-subsequence-k5vzu4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/students-position-in-row-s5w0bg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/transform-bst-to-greater-sum-tree-4dmgwd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/time-to-burn-tree-d476q4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-hashmap-with-insertion-order-m21l01</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/oops-networking-and-dbms-basics-5pcxf1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/encode-and-decode-string-45ovc4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-elements-after-nth-iteration-on-array-xf4ktn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-nearest-leaf-node-from-given-node-in-binary-tree-cai0tc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-first-k-largest-numbers-from-large-file-size-qp36xj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/cross-product-array-summation-delgl4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/design-unlimited-children-tree-and-print-levels-cdsg2k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-anagrams-from-huge-file-4sravk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-greater-element-sorted-array-to-bst-row-with-max-1s-li6lei</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-greater-element-in-bst-and-palindrome-linked-list-2i56k3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reorder-linked-list-and-producer-consumer-problem-fop19g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/median-of-integer-stream-mirror-tree-reverse-list-1uyck4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-subarray-sum-and-contact-suggestion-system-n90agu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sort-0s-1s-and-2s-and-number-of-islands-fi7jg2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/print-name-without-semicolon-and-core-programming-concepts-bspxy1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/binary-tree-boundary-traversal-and-largest-island-perimeter-np5ypv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/graph-reachability-and-bst-minimum-deletion-qah10v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-min-and-max-of-all-subarrays-of-size-k-civ16y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-k-most-frequent-words-from-a-file-or-stream-wthjh5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/first-non-repeating-string-from-stream-in-array-n1z8rd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-sum-path-from-one-leaf-to-another-in-binary-tree-8ttw12</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-distance-between-peak-nodes-in-linked-list-t6fzwk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-second-largest-number-in-table-using-sql-pi9iul</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/binary-search-tree-and-linked-list-basics-qp9p8m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/design-insert-and-delete-for-a-2d-sorted-linked-list-unal1d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/write-a-generic-hash-function-from-scratch-cuce1g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-singleton-class-gzjd3k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/stock-buy-and-sell-time-problem-without-loss-e2kzyl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-post-order-traversal-6y4bg8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-memcopy-from-scratch-in-c-d93xep</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/parenthesis-checker-with-pairs-cdfj5v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-groups-divisible-by-3-s6yef4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/integer-to-roman-w1gx41</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-leaf-nodes-with-specific-value-luu9h4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximize-number-by-digit-replacement-e57vk4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-all-substrings-x4b3gy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/code-a-dfa-for-grammar-check-8g218f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/calculate-power-and-add-1-to-linked-list-number-s1vekw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sorting-elements-7qnvyq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sort-range-array-and-find-row-with-max-1s-0e9izs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/async-file-read-timestamp-log-merge-and-address-book-l3rvm2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/connect-ropes-with-minimum-cost-and-reverse-alternate-k-iqkqr7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/coin-change-substring-index-and-overlapping-rectangles-n9t2ae</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reverse-alternate-nodes-and-valid-substring-pvbr6q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/special-stack-bottom-view-of-binary-tree-and-subset-sum-a30r4v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/demonstrate-multi-level-inheritance-qm3fpi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/explain-and-code-static-keyword-u0m95h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/real-time-example-of-oops-concepts-s7qkv7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/call-by-value-and-call-by-pointer-example-ltod3f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/find-repeated-element-using-hashmap-z64mbu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/write-exception-handling-code-s1hkyl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/inheritance-example-in-programming-7f4zft</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/smallest-value-in-array-larger-than-x-ni13ex</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-linked-list-sorted-by-absolute-values-ov9lqi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/swap-numbers-without-temp-and-memory-allocation-q36i1m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/polymorphism-overloading-and-copy-constructors-4xirhz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/program-compilation-without-main-function-fsne3m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sql-join-query-1k7qi6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/excel-sheet-column-title-6o91jd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/package-dependency-compilation-r9r9vy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-th-maximum-in-stream-6t2pu3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/generate-all-bsts-from-inorder-kd4wxc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/max-length-non-palindrome-substring-3e7u40</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/nuts-and-bolts-matching-78n8ex</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/producer-consumer-problem-bgy4fg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimize-sum-difference-16n399</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/array-rotation-2wj8nt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/pair-sum-in-sorted-array-nqe12n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/array-reordering-893m8i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lexicographically-smallest-possible-rotation-of-a-string-4vebjz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/balanced-parenthesis-qo0kk8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-possible-paths-in-a-matrix-from-0-0-to-n-1-m-1-q0yyok</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/explain-and-optimize-quick-sort-b6s80m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/unique-paths-in-an-m-x-n-grid-q1eo0y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/find-missing-invoices-for-given-start-and-end-years-9sgxkc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/explain-selection-sort-8rv55b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-cycle-in-graph-and-print-nodes-z124ux</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-distinct-subsequences-k9kxjh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-tree-diameter-with-at-most-single-turn-wu4c3u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/chain-array-of-strings-to-form-a-circle-5v953s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/efficient-data-structure-for-range-updates-and-point-queries-3xuwee</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-last-k-nodes-in-reverse-09d1ai</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-graph-is-a-tree-a1mygw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/partition-set-minimum-difference-bctd1v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/leap-year-check-j7ze7r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-contiguous-1s-w7q84d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-ap-length-o390xc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-nodes-with-path-sum-k-ac2474</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-rotations-in-pivoted-array-bk2ni0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/design-a-payment-gateway-service-scenario-7x8q23</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/clear-a-bit-at-a-given-position-in-a-number-fydyc8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-distance-in-matrix-and-vertical-order-binary-tree-705at8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-element-in-array-with-adjacent-elements-differing-by-q507c3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-top-5-frequent-words-and-reverse-linked-list-in-k-42oh5i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/discussion-on-educational-background-projects-and-dsa-63la69</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/min-elements-to-remove-for-max-2-min-7bvl85</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-size-of-generated-set-from-array-mapping-uwz0q5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-left-and-right-most-elements-at-all-tree-levels-myx32v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-minimum-element-at-given-level-in-binary-tree-kiem1v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/total-paths-for-robot-in-a-grid-iq6on9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/circular-array-and-string-programming-questions-3cti52</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-median-and-mode-of-given-values-xzg57a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/generate-combinations-of-balanced-parentheses-pl48j9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/binary-palindrome-set-bits-93vqxa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/in-place-string-encoding-mc0p8i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-unique-anagrams-from-a-file-psf9t4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-all-ancestors-of-a-node-in-a-binary-tree-5ws3gd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-k-th-smallest-element-in-bst-77uvnt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/substrings-with-similar-first-and-last-characters-90ofch</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/stone-game-winning-strategy-eytp7q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-matrix-in-diagonal-pattern-spu0xm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-cost-path-g1qx8d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/design-a-queue-using-only-one-stack-1mr9co</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-employees-who-worked-without-career-break-xky2f9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/iterative-postorder-traversal-of-bst-k3dph1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/four-digit-multiplication-puzzle-2d1t2l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/debug-react-bugs-ljn3fl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/core-java-c-and-matrix-multiplication-wk4ebi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sum-of-n-numbers-and-word-search-in-file-system-jvim3e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/java-concepts-html-tags-and-input-type-check-a46l03</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/lru-cache-kth-smallest-element-and-arithmetic-data-structure-hc9bcs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-length-square-string-a8twbd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/return-starting-indices-of-word-in-text-file-efon73</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/sort-employee-records-by-salary-then-name-649tfu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/find-best-path-between-source-and-destination-with-dh3teg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-total-files-and-find-top-10-files-by-size-ed116p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/convert-sorted-array-to-balanced-bst-7d3xzb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/shuffle-array-so-no-similar-characters-are-adjacent-jv5jhd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-number-of-squares-in-a-chessboard-2bg5b8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/basic-pattern-printing-s8l3ys</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/basic-characteristics-of-object-oriented-programming-6fs3s6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/right-rotation-of-the-array-ako5b8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-next-smallest-integer-with-unique-digits-w560js</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-nodes-with-even-kth-ancestor-tz8qhm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-middle-points-on-straight-lines-in-linked-list-4u1ahf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/winning-strategy-for-pile-of-objects-game-r62kqt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/pointer-in-c-6pldg0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-pairs-of-strings-with-a-difference-of-1-right-rotation-19ro5d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-first-faulty-version-with-fewer-api-calls-8lviix</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-index-of-the-first-unique-element-in-a-list-cteyi7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rotate-2d-array-clockwise-and-anti-clockwise-90-degrees-b3r9qc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-n-tree-collapse-and-decollapse-7gx5au</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-merge-point-between-two-lists-42rrc4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-path-with-maximum-candies-in-a-matrix-lhs68l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/eliminate-duplicates-on-the-fly-from-a-continuous-stream-vcpm2s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-shortest-path-between-two-profiles-using-friend-list-dz83gl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sort-an-almost-sorted-array-with-two-swapped-elements-ufsw1h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-nodes-greater-than-k-jts1k8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/clone-a-binary-tree-wlpkm4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/retrieve-identical-rows-in-a-shelf-rack-tutx3l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-duplicates-in-a-stream-of-integers-2zvq7h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rearrange-infinite-stream-of-characters-without-duplicates-9bjw81</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/identify-if-a-square-can-be-formed-from-coordinates-7tac16</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/convert-pre-order-traversal-of-bst-into-bst-kq4t9b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/identify-leaves-of-bst-through-pre-order-without-2da10s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/make-a-linked-list-from-leaf-nodes-7z8xdg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/level-order-traversal-of-binary-tree-iterative-and-recursive-8dvtmd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-head-to-tail-through-valid-dictionary-words-ul5t4q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-tree-t1-is-a-subset-of-tree-t2-mfjqj4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kth-minimum-element-in-row-and-column-wise-sorted-2d-array-qc9srq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/spiral-matrix-puzzle-ngc2bv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/write-custom-power-function-xtqv19</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/construct-tree-from-ancestor-matrix-bog69m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-k-maximum-selling-items-from-file-d3us5r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-next-greater-element-for-every-element-in-array-1a6obb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/store-xml-file-in-memory-caw55k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-every-node-is-sum-of-children-mf2csi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-tree-so-nodes-equal-sum-of-children-lesr9m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-three-numbers-satisfying-a-2-b-2-c-2-pcyl8n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/search-pattern-in-a-given-string-v6nzsb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/validate-sudoku-board-state-etq01v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-string-characters-frequency-with-one-variation-60ign2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-subarray-contiguous-and-non-contiguous-0psraq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/connected-cell-in-grid-lmo6px</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/height-difference-between-two-nodes-in-a-binary-tree-ord1ku</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/time-instant-with-maximum-people-in-office-bmg2js</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/reverse-queue-elements-in-groups-of-size-k-rz37bx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/max-sum-product-of-an-array-iim0bi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/bridge-building-problem-across-cities-hlvy82</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/rectangle-overlap-given-diagonally-opposite-coordinates-ev16ld</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/vertical-traversal-of-a-bst-pcf64h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-proper-suffix-from-array-of-strings-qe6w7m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/reduce-code-complexity-and-rewrite-functions-h0weml</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-characters-occurring-specified-frequency-sequentially-p9jz5y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-min-and-max-in-array-with-optimized-comparisons-ey5cck</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/reverse-words-in-a-company-name-string-7w9grt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/machine-learning-algorithms-q2qvug</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/heap-sort-stacks-and-queues-l41p6t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/graph-and-dp-algorithm-explanation-and-complexity-7tk64x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/why-bubble-sort-is-named-bubble-sorting-5kcieg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/multiply-large-numbers-represented-as-strings-d56qxd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-strings-are-rotations-oydt77</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-top-3-students-using-inheritance-8jjc7h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/print-fibonacci-numbers-hka2pi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/merge-sort-and-bubble-sort-complexities-x0t3vd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/explain-hashing-f4i0pl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/tree-data-structure-modification-and-multiple-parents-urxkw1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/finding-peak-elements-in-an-array-mad6ys</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/print-a-diamond-pattern-8iy8w3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/string-pair-vowel-sum-and-unordered-pairs-b0gpcz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/calculate-the-expression-2-3-5-0l56mm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-kth-largest-integer-in-a-bst-ibmsf3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/form-largest-number-from-array-dh4ero</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/identify-pythagorean-triplets-2qgkds</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-non-unique-characters-in-a-string-8v3arf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-the-missing-coin-denomination-4e491m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/select-3-pages-with-alternating-types-7gp713</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/validate-braces-qq3mv9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shuffle-a-list-of-songs-84mdez</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pair-sum-divisible-by-k-f14tup</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/what-is-flutter-and-widgets-f8lzjo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/root-to-leaf-paths-sum-in-binary-tree-6qgicz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-height-common-subtrees-kjzyf6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-palindrome-by-replacing-characters-k6ok2o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/design-a-unique-shuffle-button-for-a-music-player-81yyko</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/traffic-car-parking-slot-rearrangement-v7el3g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/stock-buy-sell-profit-and-trapping-rain-water-lfho0u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-anagrams-for-a-set-of-words-7wbr0l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-diameter-of-bst-in-o-n-p8fxsq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bst-node-insertion-and-least-common-ancestor-mm1jk0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/wait-and-signal-method-of-counting-semaphore-yu02w6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-continuous-sum-in-array-and-circular-linked-list-hi71i6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/stock-buy-and-sell-for-single-and-multiple-transactions-pw4l13</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-jumps-for-snake-and-ladder-8cgcda</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/written-round-duplicates-matrix-rotation-bst-to-dll-and-kth-fe58ah</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-two-numbers-with-sum-k-in-bst-without-extra-space-e4lbo4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/square-root-without-library-functions-xqovz8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/stack-with-o-1-push-pop-and-findmax-ih9hgz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/write-python-code-to-implement-neural-network-n5moq2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/check-if-a-linked-list-is-circular-tkhoi6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-a-massive-file-by-pincode-with-limited-memory-hij206</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sql-query-to-find-3rd-maximum-student-marks-ku02gs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/construct-binary-tree-from-preorder-and-postorder-traversals-xi42kk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-in-a-sorted-array-of-unknown-size-6saqn8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rotate-image-dvxns8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/partition-list-cflr24</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-distance-between-two-numbers-709r9n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-positive-and-negative-numbers-alternatively-r80pha</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimize-exam-cheating-avl8uu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/stable-stock-problem-ycuf20</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-in-a-sorted-matrix-g24d0j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rook-attackable-squares-ike8is</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/buildings-facing-the-sun-k28mdo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rotate-a-subarray-ti2tq4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/three-closest-elements-from-sorted-arrays-22fbrg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/keep-m-nodes-and-delete-n-nodes-in-a-linked-list-50r0q3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/replace-bst-node-with-sum-of-larger-elements-7ociym</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/root-to-leaf-path-sum-equal-to-value-in-bst-lu8q0i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/group-anagrams-from-a-large-file-wq9aa9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/knight-reachability-and-minimum-hops-on-finite-board-tel6i4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-number-of-disconnected-components-in-a-graph-a354f7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-number-of-arrays-that-result-in-the-same-bst-6z6isd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimize-cost-of-combining-elements-from-array-h5bv14</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/design-a-stack-supporting-o-1-push-pop-top-min-and-max-d5icp5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-second-string-is-a-substring-of-first-9cwina</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-two-rectangles-overlap-12a0uy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/fill-string-row-wise-and-print-column-wise-486web</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/mobile-keypad-letter-permutations-for-numbers-5pr55s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-integer-part-of-square-root-s2jt6w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/replace-each-element-with-next-higher-element-on-its-right-j720fl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/polymorphism-implementation-in-java-o2c5qe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/exception-handling-and-finally-block-in-java-l2dsrz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/insert-a-node-in-the-middle-of-a-linkedlist-in-java-ux3lgl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-one-matrix-based-on-another-matrix-8u5uxj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-amazon-orders-a7yjvq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/string-operations-with-reverse-and-insertions-1theut</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/infection-spread-time-t7zeer</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-removals-for-palindrome-66oti9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/merge-sorted-linked-lists-in-decreasing-order-0x8yi8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-sorted-array-of-0s-and-1s-1hlmss</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-smaller-element-70sqv1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/top-view-of-bst-3ilj1n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-most-frequent-words-tt4ue2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/delete-kth-node-kjx3sj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-elements-in-range-mos8e1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/prune-tree-based-on-path-sum-uv6nch</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/mirror-a-bst-xjqe0o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximize-sum-of-weighted-array-cjw68r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bit-analysis-of-32-bit-integer-zc1tym</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/iterative-postorder-traversal-m9qo0x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/zig-zag-array-arrangement-4ux9cz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/delete-node-in-dll-gx5ahw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/smallest-string-with-swaps-40h6z7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/write-a-program-code-on-fibonacci-series-rpa77r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/break-array-into-three-sub-arrays-with-same-sum-chqb0v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-substring-containing-vowels-in-even-counts-gep1wd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-dynamic-bst-to-complete-tree-4kthr7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/generate-nth-catalan-number-dynamically-kjgg04</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-string-has-anagram-as-substring-ml7apf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bst-to-doubly-linked-list-and-vice-versa-tgev19</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reach-number-on-number-line-with-incremental-jumps-mjj99l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-length-subarray-with-sum-equal-to-zero-mkgo7o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/return-largest-bst-from-a-bt-vja6ih</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/matrix-zero-one-propagation-and-cost-optimization-0urhxl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/space-complexity-of-recursive-function-xw3arw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/fsm-for-divisibility-by-3-9qncoz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/big-endian-to-little-endian-conversion-er6ewd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-first-index-of-1-in-binary-array-kek5ak</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/optimized-solution-to-print-range-of-prime-numbers-414efn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/digits-check-addition-sum-q6z41h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/arithmetic-expression-evaluation-with-operator-precedence-jakl9f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-number-creation-in-byteland-number-system-pg8tbg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/dictionary-data-structure-for-word-length-and-character-ia3kd4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-and-print-all-possible-decodings-of-digit-sequence-ffy5fc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-non-adjacent-subsequence-w7yy3b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/profit-sort-elements-in-range-899hui</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-immediate-higher-palindrome-number-d1ujcw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/simulate-android-pattern-locking-df4h5a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/print-matrix-column-wise-fo1vtz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/binary-search-program-jk13sv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/code-quick-sort-ibwa5a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/longest-substring-with-k-unique-characters-4i93i8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/generate-palindromic-permutations-in-sorted-order-p14mqp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/data-structure-for-maximum-element-in-a-list-izc1cq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/edit-distance-with-custom-costs-5pf91y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reverse-string-in-k-length-blocks-hgzc06</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-steps-in-infinite-grid-z9tvo3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-triplets-i-j-k-from-three-sorted-arrays-gdvj1v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-subtree-with-equal-t-and-f-nodes-rp9lla</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-anagram-substring-exists-5eofsh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/the-celebrity-problem-with-twist-wmor3j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-two-numbers-with-odd-occurrences-9x5w7c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-two-missing-numbers-got2pw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-cost-path-with-four-directional-movement-and-5sgrls</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/coins-in-a-line-game-strategy-bm1gms</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-a-large-file-line-by-line-ufe71s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-bst-nodes-outside-range-nyr0kf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/print-all-substrings-in-lexicographic-order-32aqcz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/convert-decimal-to-roman-numeral-w9olo8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/populate-next-right-pointers-in-each-node-3tovv6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-an-almost-sorted-array-5kq59y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/distance-to-closest-door-in-grid-yd8qn2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-path-in-grid-with-special-diagonal-jumps-6bxx29</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/accommodate-horses-in-k-stables-ph9uwp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-ways-to-tile-a-floor-k8uipe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/binary-strings-with-consecutive-1s-p87sj3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimize-difference-of-elements-from-k-sorted-arrays-23eq21</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/ratio-calculation-855ztj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/count-vowels-consonants-and-spaces-atiz2h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/reverse-a-number-via-command-line-8dpgys</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/segregate-0s-and-1s-h52dt7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/topological-sorting-6sdbcj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/place-k-elements-with-max-min-distance-6mr0fx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sorting-algorithm-selection-2e58a2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/check-increasing-array-with-element-replacement-operation-dd8hky</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/format-string-with-forward-slashes-c1jhru</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/problem-solving-approach-2vd4vp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-distance-between-jumping-frogs-1nh2k6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-characters-to-equalize-blocks-of-consecutive-letters-9baxjd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-every-5th-element-from-a-map-12qobn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/pattern-searching-in-a-string-i477kn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/shift-elements-in-an-array-with-no-extra-space-bibz8o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-cost-to-reach-station-n-with-chocolate-trade-rules-20rwjo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-all-nodes-at-distance-k-from-a-given-node-in-a-binary-r3a6fo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-kth-largest-or-smallest-element-in-an-array-4jwdux</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/alternate-reversal-of-linked-list-in-groups-of-size-k-577sqm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-matching-and-non-matching-characters-in-two-strings-0nz6cy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-steps-to-reach-destination-string-with-obstacles-c3tkc6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/determine-if-ant-family-interactions-are-valid-jbx9wb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/factorial-of-a-number-n2a2ak</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-number-of-pairs-in-a-binary-tree-with-sum-k-exzz5r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-greatest-object-with-non-transitive-comparison-wj145h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-non-repeated-words-in-a-sentence-0gn8eu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/serialization-and-reconstruction-of-a-binary-tree-kutmg4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/led-matrix-state-toggle-cascade-kp6wkt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-last-remaining-card-in-a-deck-2ww6e2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-distance-between-two-words-in-a-paragraph-3d0232</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/word-transformation-ladder-9oox0b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-an-alternating-ascending-and-descending-linked-list-3fvtvj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-the-lcm-of-two-numbers-1bkp59</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/frequency-of-elements-in-an-array-6t40lw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-steps-from-start-string-to-destination-with-s3b2pd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-difference-between-max-and-min-in-all-subarrays-of-29f677</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/determine-if-a-family-interaction-graph-represents-a-good-zo9fkg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/segregate-non-zero-numbers-and-count-minimum-swaps-7kdvsl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-occurrences-of-pattern-and-its-anagrams-in-text-zt5mt0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-dictionary-words-represented-by-a-string-of-digits-8nv5jz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-number-of-conference-rooms-for-meetings-gg29j1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implementation-of-doubly-linked-list-using-a-single-pointer-z7jfld</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/left-view-and-right-view-of-an-n-ary-tree-in-a-single-5scogm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/iterative-power-function-in-o-log-n-time-without-extra-space-5qqtvt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pre-order-traversal-of-a-binary-tree-without-recursion-5ru1yn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-distinct-decoded-strings-from-a-number-mapping-iur43f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-bst-keys-outside-a-given-range-zu9569</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maintain-top-100-numbers-from-an-infinite-stream-454hfb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/put-positive-and-negative-elements-alternatively-in-an-array-7bk2zf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimize-cash-flow-among-a-weighted-directed-graph-of-ey8mog</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-possible-decodings-of-an-integer-3y926s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/fulfill-product-orders-sold-in-specific-bundle-sizes-k5p5bo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-closest-value-to-k-in-a-bst-l6r15e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-greatest-person-among-n-people-given-partial-o0840c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-candies-distribution-23v6va</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/leaf-deletion-traversal-y4v3yf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximized-string-partitions-a28v5i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/substring-count-ejoo42</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/smallest-window-ehdy3q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-closest-elements-h8nc7g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/string-expansion-xtqkt5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bubble-shooter-game-fozbi2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-larger-element-fmt7h0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-sum-path-rxi9ii</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/4sum-with-o-n-2-time-complexity-0eklq7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/vertical-traversal-of-a-tri-nary-tree-qg04j2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/odd-even-linked-list-variation-in-o-1-space-2ipnm7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/right-view-of-a-tree-considering-vertical-depth-wzjt6n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/smallest-unique-prefix-alias-generator-edz3vu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-length-subarray-where-product-equals-lcm-qj24a5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shift-string-characters-by-3-places-rk3q6k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-number-and-its-negation-if-both-present-x8lgg6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/range-sum-queries-using-segment-tree-and-sqrt-decomposition-w8zdi0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-nearest-delivery-guy-in-a-blocked-grid-h1vitk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/house-robber-problem-on-a-circular-street-4srcet</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/choose-row-to-maximize-gold-cells-after-army-cells-o28f2a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/devise-an-optimized-sorting-algorithm-5eswp0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/variant-of-burn-the-binary-tree-qclu9v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/optimal-sort-and-search-in-an-array-gimpi3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/return-list-of-direct-and-indirect-reporting-employees-4hqbc0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/count-total-number-of-files-in-a-directory-recursively-bi7kg4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/parenthesis-and-bracket-balancing-validation-pho6cg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-for-pattern-anagrams-in-text-3ipg1i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/segregate-positive-and-negative-numbers-in-linked-list-saq0ii</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lru-implementation-using-stacks-39r6cl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximize-customers-in-compartments-interval-scheduling-6iwfri</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-array-based-on-relative-order-of-another-array-60m516</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kth-maximum-element-in-a-file-iy4tfm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/prefix-and-suffix-sum-array-problems-9hlw0j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-larger-node-in-bst-9sn5i3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-size-of-private-arraylist-using-getitem-ytquj0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-repeated-substring-s2yyvx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-one-edit-distance-string-in-dictionary-15isan</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/cube-sum-problem-0dnwk0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-weight-subtree-in-a-binary-tree-jn3gjf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-iterations-to-pass-information-in-an-n-ary-tree-btu9sg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-n-th-maximum-and-minimum-in-bst-v9bvah</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/implement-bubble-sort-on-a-linked-list-i7drbw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/explain-dynamic-programming-and-applying-it-to-binary-search-ji7grt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximize-number-of-1s-after-flipping-a-subarray-93gtkw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-array-can-be-sorted-by-swapping-elements-at-589pdi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-nodes-not-lying-on-path-with-sum-k-qa4ejd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-minimum-element-in-sorted-rotated-array-dfzja3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-products-sold-per-product-id-in-a-continuous-stream-athg47</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-in-order-traversal-of-a-binary-tree-with-circularly-zkp1ad</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/large-number-represented-as-string-modulo-11-8ujlv9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/meeting-rooms-ii-minimum-rooms-required-gxkj4j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rotten-oranges-mangoes-infection-time-6qbx64</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-top-100-most-frequent-urls-in-a-stream-3l7b3l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rod-cutting-problem-gt41is</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/file-transfer-across-systems-matrix-rotten-oranges-variant-huuk9s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-array-of-custom-objects-using-custom-comparator-2fpmke</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/word-ladder-with-preprocessed-queries-yw7q56</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-sum-such-that-no-two-elements-are-adjacent-ng9ouh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-a-given-word-in-a-matrix-of-characters-82l9f0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/check-whether-a-given-number-is-a-happy-number-knl0oj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-all-possible-strings-with-spaces-1bwinn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/set-next-right-pointer-in-a-binary-tree-nmdbe5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-longest-continuous-repaired-road-patch-8i3nk6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implementation-of-least-recently-used-cache-9blxu4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/number-of-ways-to-reach-the-end-of-snakes-and-ladders-ji3xvy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-number-of-unique-tree-structures-with-n-nodes-r8b7vs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/nut-and-bolt-problem-0o76fx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/validate-parentheses-ignoring-letters-par6j6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/calculate-final-betting-game-amount-rg6ssm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-element-in-array-where-adjacent-elements-differ-by-at-ey20h0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-substring-in-str1-with-characters-from-str2-xq9x99</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/vertical-line-zigzag-traversal-of-binary-tree-10dbey</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/depth-first-search-of-a-general-tree-i0y4yu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-pascal-s-triangle-with-proper-formatting-r348sg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sum-of-fibonacci-series-up-to-n-terms-9w5m7k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sum-of-all-distinct-xor-subarrays-8x3ixi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/merge-two-sorted-linked-list-in-o-1-space-etwrn4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/valid-palindrome-6ktf9o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/java-fundamentals-vizc5d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-cost-to-equalize-sticks-slrt17</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/file-word-search-cyeb0x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/clone-linked-list-yds2qs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/identify-array-type-hfy4jd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-linked-list-based-on-an-array-order-f2j9cb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-all-paths-in-an-n-ary-tree-wv0o61</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-array-to-alternate-even-and-odd-numbers-wog3uo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/change-node-value-by-sum-of-children-values-g05q17</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-reachability-in-a-matrix-with-obstacles-v8qoon</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/determine-alphabet-order-from-a-dictionary-page-r0ic72</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-elements-from-a-list-of-lists-nn883a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-minimum-characters-to-make-strings-anagrams-0569by</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-element-smaller-than-left-and-greater-than-right-n19vp0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-kth-smallest-element-in-row-wise-and-column-wise-sorted-xk0ufv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-difference-between-child-and-parent-in-binary-tree-mdb4dn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/maximum-or-minimum-sum-of-a-subarray-of-size-k-ziaqz2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/compress-a-string-asz88b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/first-non-repeated-character-in-a-string-w0egpo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/balance-a-tree-with-custom-descendant-equality-condition-f6hzrf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/split-array-to-minimize-difference-of-part-sums-1pgazw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reconstruct-sentence-missing-spaces-using-dictionary-n3ofze</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/delete-a-given-node-from-a-circular-linked-list-pmpcr5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/decrypt-file-encoded-with-substitution-cipher-using-83wa4v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-peak-element-in-an-array-that-increases-then-decreases-ayhoa9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/construct-binary-search-tree-from-an-integer-array-m4bsme</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/generate-path-array-for-target-key-in-bst-b89qw8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-platforms-required-for-train-arrival-and-departure-dyau8a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-right-side-visible-nodes-of-a-binary-tree-m4fd2s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-documents-containing-all-search-query-words-3ea7yf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/binary-tree-traversals-and-unique-tree-reconstruction-8drbb5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-an-array-containing-only-0s-1s-and-2s-5tr6kv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/next-higher-number-with-same-set-bit-count-5lkz7k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/generate-all-valid-combinations-of-n-pairs-of-parentheses-tkx2q8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-distance-between-two-characters-in-a-string-5dppbb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/custom-case-insensitive-string-comparison-function-m62g01</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-all-prime-numbers-within-a-range-a-b-l0gxre</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/perform-insertion-at-the-inner-position-in-linked-list-ruu95h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/explain-quick-sort-and-bubble-sort-using-dry-run-htdvw2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/all-anagrams-of-a-given-string-dzzp8v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/order-students-by-competition-wins-and-losses-k6uwz4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-if-a-given-string-contains-duplicates-b4fdvm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-minimum-k-numbers-in-each-sliding-window-6efpxj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-all-nodes-at-k-distance-from-a-random-node-ax84l0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/total-number-of-ways-to-reach-destination-in-matrix-xn9wni</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-nodes-at-weighted-distance-k-from-root-vwbd5c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-groups-of-2-or-3-elements-with-sum-multiple-of-3-v1df2i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/in-place-conversion-of-bst-to-doubly-linked-list-2t7p8p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/unit-area-of-largest-region-of-1-s-sir6a4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-zeroes-to-be-flipped-to-maximize-consecutive-1s-84ruby</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/good-data-structure-for-storing-and-searching-2d-spatial-zme2f2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-integers-smaller-than-a-given-number-in-a-stream-a1pw3g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/difference-between-interfaces-and-abstract-classes-in-java-3sie59</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/constructors-in-java-svh01u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-subsets-of-string-present-in-dictionary-scj7l4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/replace-characters-not-in-dictionary-gzn907</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-duplicates-from-array-of-prime-numbers-p8qrlx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/nearest-elements-in-bst-f52wqn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-top-10-elements-in-an-array-1sw9pf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/calculate-a-b-in-floating-point-8d012u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/least-common-ancestor-lca-t82nex</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/copy-linked-list-with-orbit-pointer-kiz3r1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/top-100-elements-in-large-dataset-lt7khu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/number-of-inversions-in-an-array-o4y2nr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/implement-linked-list-and-avl-tree-87pvo7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/accenture/find-minimum-marks-out-of-three-papers-nph02u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/c-concepts-infinite-loops-and-python-libraries-6v41pa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/java-immutability-and-handling-large-data-input-vkd3i7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-path-in-matrix-and-maximum-space-truck-shipping-7gaq00</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-path-with-trace-and-inverse-function-lookup-3cmq3c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/alphabetical-decoding-next-greater-number-and-merge-sorted-jy4gjv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kth-distance-nodes-cousin-sum-and-row-col-sorted-matrix-adjc5w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-anagram-words-in-a-sentence-and-implement-decorator-9fpz4l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/merge-sorted-array-into-another-sv1h7h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-a-stack-using-only-push-and-pop-g78zxk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-moves-to-reach-nth-stair-ru152t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-stepping-numbers-in-a-range-hh54l1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/iterative-tower-of-hanoi-5myy7q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/first-non-repeating-element-in-a-data-stream-5amaic</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/delete-node-in-binary-search-tree-5jyu81</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximize-absolute-difference-of-value-and-index-pairs-4gpn1t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-maxheap-insert-operation-1k9gm4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-anagram-starting-indices-in-haystack-mvrb85</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/verify-alien-dictionary-ordering-validity-42y92n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/point-update-and-range-sum-queries-eude2f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/minimum-railway-platforms-required-bc97xh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/count-occurrences-of-substring-oqgu4j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sort-student-objects-by-salary-gfux8p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-apex-nodes-of-n-ary-tree-fedc82</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-element-in-complete-sequential-binary-tree-6exjuz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-maximum-value-in-complete-sequential-binary-tree-9qebwr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/boggle-word-search-wd5m8l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/remainder-of-10-yr1efs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/count-stack-pairs-with-difference-k-nhfp3a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/basic-mysql-query-and-os-command-76x22x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reverse-every-k-nodes-in-singly-linked-list-e2sf1k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/balance-an-unbalanced-binary-tree-without-avl-red-black-07yzpf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/group-anagram-lists-using-optimal-data-structure-2n4smo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-min-and-max-in-unsorted-array-with-fewer-comparisons-5h4v5q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-the-number-of-k-big-indices-7mszcs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/house-robber-variation-with-tabulation-0aq1v2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/reverse-a-string-without-built-in-methods-po7gbs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-kth-largest-element-in-an-array-jmu51z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-a-concurrent-mark-and-sweep-garbage-collector-81tmgt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/coin-denomination-problem-jrft6f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rectangle-overlap-problem-45m6p5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/string-matching-problem-v4xjvc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/divisible-by-3-and-5-mm2ka0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/angle-between-hour-and-minute-hand-mpq15i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reverse-bits-in-a-binary-number-eyf8cx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/get-kth-node-from-end-of-linked-list-p8jl15</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/multi-threaded-queue-enqueue-ha9add</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/delete-duplicate-occurrences-in-a-doubly-linked-list-zs6t3y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/root-with-maximum-sum-in-subtree-fipxc4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/first-occurrence-of-1-in-a-stream-1bfat5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-subset-with-absolute-difference-y-1yutel</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/number-of-pairs-with-sum-divisible-by-x-pv34y8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/string-matching-with-fewest-question-marks-0aiseg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-array-can-be-made-strictly-increasing-k3b9in</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-possible-palindromic-partitions-of-a-string-nyr7h4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/efficient-search-in-an-array-with-bounded-step-difference-s4nq6g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-array-elements-form-a-contiguous-range-kebw4s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/python-execution-model-and-array-element-swapping-l3vw1u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/maximize-score-in-timed-test-myo5hh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/evaluate-postfix-expression-with-negative-numbers-m65jmk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/select-maximum-number-of-people-ordered-by-height-and-weight-rjgg2f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimize-difference-by-picking-one-element-from-k-arrays-vmjq69</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-median-from-a-running-data-stream-4o6caw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-number-of-clusters-of-1s-in-2d-grid-skwvr1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/construct-binary-search-tree-and-level-order-traversal-fj084x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/mark-conflicting-appointments-rln53e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/separate-multiples-of-10-3dliy0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/cyclic-rotation-of-a-list-2yual8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/swap-variables-ede7fy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/swap-two-numbers-qo4rkq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/string-encoding-s0aru7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lis-variant-p909pd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-difference-from-k-arrays-iom8hw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/avl-implementation-kp7hps</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-rotation-count-k4ofdq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/design-o-1-queue-l8u131</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/ancestor-matrix-df6zin</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/string-search-in-matrix-jb65yq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-duplicate-element-6as55k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/in-place-string-subtraction-68o0pe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-subarray-with-all-distinct-characters-mxz27z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-occurring-element-in-concatenated-range-3ws44y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-odd-nodes-in-path-between-two-nodes-390eei</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-square-root-1wcyo0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-area-in-histogram-ydin3f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/inorder-successor-with-parent-pointer-x3b77j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-path-with-one-additional-edge-5tau1k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reverse-individual-words-of-sentence-3ysq8t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/string-with-min-and-max-character-occurrences-amqed1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-tree-is-balanced-q2hf1z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/disjoint-set-operations-for-2d-points-2lsoci</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-kth-bit-in-infinite-string-yxai87</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-large-file-with-limited-ram-ya1rxo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-all-subarrays-with-0-sum-0j074d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-patient-zero-in-infection-chain-72r873</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/number-of-ways-to-reach-top-right-corner-of-chessboard-cueiw6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-distance-between-two-cells-in-matrix-grid-8ux3ho</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-th-symbol-in-grammar-acmsj5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/camel-case-conversion-dh5s4u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/explain-a-math-trick-from-cv-6pg2uf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/general-formula-for-odd-numbers-divided-by-3-lu20kx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/explain-codevita-submission-attempts-vggo2a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-sum-of-i-array-i-with-rotations-pk3bwu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/explain-heap-sort-and-heapify-ig5fxn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-array-can-be-preorder-traversal-of-bst-whsf0f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/print-nth-term-of-fibonacci-series-bwj1f8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-index-of-specified-element-in-sorted-array-9j1uxv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/explain-codevita-dynamic-programming-solution-mm45bg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rotate-2d-array-by-90-degrees-b4e1hs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-phone-number-is-unique-1hemxp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-index-in-array-with-adjacent-absolute-difference-1-n55fle</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-median-of-two-sorted-arrays-when-merged-8dp15d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-number-of-factors-for-a-number-q3cu1c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-validity-of-sorting-algorithm-for-linked-lists-mwu85y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-length-subarray-with-at-most-3-unique-elements-58ubh4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-missing-card-with-k-suites-and-large-numbers-2tzwg8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-palindrome-of-a-given-number-without-extra-space-e8kto6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-greatest-number-in-bitonic-array-nu2c7z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/implement-queue-data-structure-p7pm5q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/group-string-graph-nodes-using-dsu-b3g8l4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-sorted-output-from-sorted-matrix-13zo48</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/greedy-algorithm-on-graph-rv5el3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/segregate-vowel-nodes-in-linked-list-1e4b39</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-repeating-numbers-in-range-array-8jza54</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/merge-sorted-data-frames-uhz1pk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/boxing-and-unboxing-pkd6y9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/inheritance-concept-ef6hpu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/call-by-value-vs-call-by-reference-1wbdo9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/procedural-vs-structured-language-7p6859</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-count-of-duplets-and-triplets-sum-multiple-of-three-z70ftu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-consecutive-numbers-3hdlma</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-k-sum-paths-in-binary-tree-0fvkqw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-non-adjacent-sum-in-n-ary-tree-2akgkx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/change-kth-bit-3kcmgf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sum-of-two-binary-strings-5wnnd6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/connections-till-kth-level-56qhx6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/output-of-static-variable-program-29qgpd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/array-logic-explanation-g1g0w7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/palindrome-and-sorting-ll4i6t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/fibonacci-and-matrix-manipulation-4jicve</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/management-chain-reportees-fcsit0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/meeting-room-booking-3hlfoo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/race-car-2wcue5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reduce-array-elements-smnfj2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rotting-oranges-wmy9pm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-all-combinations-of-balanced-parentheses-tj9xnr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sequential-digits-qj76k0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/boggle-find-possible-words-e5v0at</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/url-check-gp-sum-and-balanced-parenthesis-40eyha</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/array-rotation-and-group-anagrams-n36bre</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/flight-scheduling-and-oop-os-concepts-vo3rt4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/multiply-two-strings-7posha</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/multiply-large-integers-under-large-modulo-pfvis2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/decimal-to-binary-and-variable-swapping-in-python-7ukg6i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-remaining-dice-roll-values-for-target-sum-976y07</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-fountains-to-cover-garden-7iu70y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-kth-smallest-lexicographical-character-in-string-bgg9j2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/generate-all-palindromes-of-a-name-in-java-i8d457</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-trains-to-postpone-to-avoid-single-platform-q2zy8p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-all-unique-permutations-of-a-string-with-duplicate-30wuwm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/set-matrix-rows-and-columns-to-zero-using-o-n-space-e4c4jy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-minimum-root-to-leaf-height-in-binary-tree-2seuu3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-second-largest-and-second-smallest-in-single-traversal-btoi6s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/calculate-power-x-y-without-built-in-functions-sdne0k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-path-from-source-to-destination-in-matrix-with-2ebz46</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-nodes-whose-parent-and-grandparent-sum-exceeds-k-j2wgv0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-and-maximum-of-each-subarray-of-size-k-j1d2po</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-burning-nodes-of-a-binary-tree-per-second-j7ga0y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-replacements-to-convert-one-string-to-another-6wdlv7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximize-consecutive-ones-by-flipping-zeros-mlgd0g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-array-where-elements-swap-only-with-index-x-k-p3tbaa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/group-numbers-with-identical-digits-together-g6ncdr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-k-most-frequent-strings-in-a-book-85zuvi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-best-fit-box-size-for-a-given-product-pim3xs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-string-in-2d-character-matrix-in-eight-directions-1jcb50</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-pairs-in-a-bst-that-sum-to-a-key-value-0w7hlw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/delete-binary-tree-nodes-with-path-sum-less-than-threshold-rjrxx6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-unknown-variable-in-equation-string-a-b-c-7cmwbr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-row-and-column-with-maximum-sum-in-matrix-7o0g09</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rotate-matrix-layers-clockwise-by-one-element-1ewstf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-kth-node-from-end-of-linked-list-in-single-pass-98f4zd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/resolve-relative-linux-cd-command-path-yonn16</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/group-anagrams-together-from-string-array-hl96e2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/linearise-2d-linked-list-in-single-traversal-and-constant-638i0w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/filter-unique-strings-in-incoming-stream-within-10-second-n2ansp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-second-maximum-salary-of-an-employee-in-sql-wpdbn1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/write-code-to-check-string-palindrome-in-java-p2eoca</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/implement-stack-using-array-and-linked-list-agm6ig</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-a-number-using-recursion-pq2mru</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/difference-between-sum-of-odd-and-even-levels-diagonally-mwu5yw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-sum-path-from-top-left-to-last-row-7c0f5y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/compress-a-text-file-to-reduce-size-u36t1z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/merge-sort-explanation-and-complexity-81mdeb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/min-and-max-heap-operations-and-illustration-anle5i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-sum-path-in-n-ary-tree-with-positive-keys-w9cvdl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-height-of-special-binary-tree-with-connected-leaf-nodes-23or5l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-number-of-weeks-for-which-you-can-work-g51hgo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-a-tour-that-visits-all-stations-mt0cs0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/delete-operation-in-a-bst-d75226</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/add-two-polynomials-using-linked-list-8rszqw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/inorder-successor-in-binary-search-tree-yf9wbr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/relative-sorting-w19tqu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/boolean-parenthesization-to-evaluate-true-hl9383</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-sum-linked-list-from-two-sorted-lists-ku8mxb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/zig-zag-level-order-traversal-of-bst-p92u4g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-maximum-number-from-list-of-number-lists-w6w34i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/ways-to-fill-n-positions-using-m-colors-with-k-adjacent-hg6nmv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sql-query-to-find-second-highest-salary-j0x7y3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/array-pairwise-difference-sum-after-n-iterations-v20du8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-all-anagrams-per-email-across-emails-stream-7uzisu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/right-side-view-and-level-order-traversal-variations-of-a-b2myt9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-j-th-element-in-i-th-row-of-pascal-s-triangle-5isl1l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-height-of-binary-tree-from-inorder-and-level-order-gbz0cg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-square-root-of-a-number-up-to-3-decimal-precision-rqp79b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-rank-of-every-element-in-a-stream-3rgmav</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/basic-sql-queries-and-core-data-structures-problem-solving-d224sr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-string-contains-an-anagram-of-another-string-as-a-n8gyzw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-path-between-two-vertices-in-an-unweighted-graph-xw8lu8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-jumps-on-a-number-line-with-incremental-jump-lengths-9e8bze</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/row-with-maximum-1s-in-a-boolean-matrix-qdkp6y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/stacking-n-dimensional-slabs-for-maximum-total-height-1ogw0l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/delete-all-nodes-at-distance-k-from-a-given-target-node-z0atkc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-an-array-according-to-the-order-defined-by-another-3jt04x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/generate-alternate-0s-and-1s-pattern-following-recurrence-fnp6du</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/dfa-design-to-accept-streams-with-odd-a-s-and-even-b-s-ko6hxn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sliding-window-minimum-using-binary-search-tree-xg67nd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-file-system-permissions-optimization-7zso2a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-total-decodings-of-a-digit-sequence-vvdhb8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-value-of-x-in-an-equation-string-dpdd5y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-steps-by-knight-to-reach-destination-and-print-path-1li3n4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximize-1s-in-array-by-flipping-a-contiguous-subarray-xw8zfh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/subtract-symmetry-nodes-in-linked-list-6pv2rn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/calculate-a-b-m-for-large-integers-without-overflow-hwd4tm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/group-duplicate-contacts-based-on-matching-fields-7xslcz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-minimum-knight-moves-to-capture-pawns-on-a-chessboard-box7ge</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/design-user-repository-with-register-login-and-logout-wnyec1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-array-can-be-divided-into-pairs-whose-sum-is-46s78p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/standard-binary-search-implementation-vv7dsz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/doubly-linked-list-insertion-and-deletion-n9f230</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/traveling-salesman-problem-tsp-concepts-orrd2f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/fibonacci-number-using-recursion-4i3268</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-string-of-parenthesis-is-balanced-9mz10h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/word-occurrences-in-a-paragraph-0qaz21</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-bfs-xj20iv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/detect-cycle-in-linked-list-and-find-start-point-p2xjqa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/two-eggs-drop-puzzle-6njdnw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-min-heap-and-apply-min-heapify-w1bke3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/quicksort-for-linked-list-v3nw50</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/quicksort-complexity-and-randomization-eqk9rv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-non-intersecting-bridges-fu2mga</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/arrangement-based-on-hate-relationships-3rku0q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/math-expression-calculator-eji7qg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/transitive-connection-check-t4pkdo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/occurrence-of-a-character-in-a-string-e0f5st</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/odd-and-even-indexed-array-elements-8xemdw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-max-of-two-numbers-in-python-h7v7yp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sort-a-dictionary-by-key-in-python-vstu0z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-region-with-maximum-brightness-jky13e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-faulty-commit-using-deployment-function-p32gef</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-cycle-start-in-linked-list-and-sum-in-bst-amf6kz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/edit-distance-trapping-rain-water-and-sliding-window-max-pnn9iz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/replace-every-number-with-next-greater-element-sbs131</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/min-difference-in-array-heapify-and-bst-balancing-89cd39</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-dynamic-hash-table-and-string-character-erasure-km5f1y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/level-order-sum-product-and-max-1s-row-in-binary-matrix-kb6l64</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-time-to-burn-a-tree-from-a-leaf-node-gfyq91</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/backtracking-problem-fn9xuk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/product-array-puzzle-m8w3cw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/number-of-subarrays-with-sum-exactly-equal-to-k-23421u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/subset-sum-problem-km77n1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-coin-change-with-combination-8ew9r4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-edit-distance-is-at-most-1-uvn48m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-distance-between-two-leaf-nodes-r2bbks</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-smoke-mixture-problem-aeck8z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/word-ladder-minimum-alterations-t4cq20</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/regex-matching-with-dot-and-star-m26ld7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-product-of-three-ascending-integers-gy1a05</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/error-vs-exception-and-float-vs-double-9atkyd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/check-armstrong-number-u6s41s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/frequency-of-each-element-in-an-array-7ipdhy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-profit-from-stocks-ip7j5k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-heights-of-nodes-in-binary-tree-7pvtd8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-stack-with-getmin-in-o-1-sm53zr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-values-of-flattened-linked-list-2yg8e3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/print-star-triangle-pattern-4nuhwc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/first-non-repeating-number-in-array-kqx1wv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/string-construction-with-character-constraints-678u20</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/task-assignment-with-manager-priorities-li4lo8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bst-and-graph-traversal-2oaqft</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sql-injection-and-string-reversal-12bk61</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/inversion-count-and-lcs-tf77ef</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/divisibility-count-and-subarray-sum-n74max</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/parenthesis-combinations-and-closest-stars-jxzjk9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/number-placement-and-top-k-visitors-xgrff9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/expression-validation-qcc4xi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/account-trigger-for-opportunity-creation-7rwl5q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-1-operations-for-k-distinct-elements-3wf0vh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-atoms-in-a-chemical-compound-rspt41</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/superimpose-two-quad-trees-h52918</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/round-robin-scheduling-with-different-arrival-times-3gg0kt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/finding-path-in-matrix-oxvav6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-value-exists-in-level-order-sorted-complete-binary-g7xkrf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/alternate-sign-array-arrangement-6675ao</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/phone-keypad-letter-combinations-wlxm19</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/random-song-shuffle-function-2n5a12</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-subtree-which-is-a-bst-7hplba</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/clone-linked-list-with-next-and-arbitrary-pointers-0ynazr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-nodes-in-same-vertical-axis-fp34ka</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/palindromic-partitions-of-a-string-qusya5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-hero-and-super-hero-elements-in-array-01ytl1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-number-possible-by-at-most-k-adjacent-swaps-8l4itb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/closest-pair-to-a-given-sum-in-unsorted-array-w71et0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/special-stack-with-o-1-space-b4yh53</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-distance-between-two-integers-in-array-fcef3s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/alternate-positive-and-negative-numbers-without-extra-space-8b41lb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/replace-node-value-by-sum-of-its-children-uq9ucg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/glass-pyramid-problem-water-measurement-ec8twi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-n-byte-integer-from-little-endian-to-big-endian-et89wt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rate-limiting-requests-per-second-mtz9gr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/prevent-contention-among-dependent-processes-251ikp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-pivot-element-in-bitonic-or-monotonic-array-tucof0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-cost-to-combine-rods-w6hgua</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/replace-every-number-with-next-higher-number-to-its-right-2quzg3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/boggle-game-using-trie-qrbje5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/calculate-number-of-bsts-with-n-nodes-aax4zt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-swaps-to-group-characters-in-a-circular-array-ni0s1t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-sum-in-binary-tree-with-no-adjacent-nodes-d1pzid</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-adjustment-cost-of-an-array-mwt33p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/file-row-and-column-sum-6xfsjo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/construct-bst-from-skeleton-5m1m3u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/least-distance-in-binary-tree-w6l8vg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/stock-profit-maximization-4ti4nq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/in-order-successor-ojakt3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/external-sorting-of-large-file-vwlsi2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-connected-component-hlsf0l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/diagonal-sums-of-a-binary-tree-lcxz8y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-nodes-required-to-run-mutually-exclusive-jobs-hrkol2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-reachable-tokens-given-inference-rules-xghsh3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/server-meeting-requests-sorting-by-meeting-time-qott7s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/convert-number-to-words-and-determine-chess-board-square-m9g21c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-multiple-of-y-closest-to-x-hwlev7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/validate-password-and-apply-caesar-cipher-encryption-z92mgo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-for-pair-with-sum-x-and-clone-linked-list-7wpi75</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/replace-elements-with-greatest-on-right-and-minimize-1x8ycq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-bajaj-bikes-in-garage-sequence-and-sort-large-data-9kw27o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/explain-dfs-used-in-codevita-problem-cr0thj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/connect-n-ropes-with-minimum-cost-and-maximum-sum-pair-from-1kt25h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/decrease-even-rank-nodes-in-bst-and-find-minimum-in-rotated-nrn66e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/anagram-substring-search-and-trapping-rain-water-gnnbz5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lca-in-bst-tree-pointer-modification-coin-ways-and-loop-gs2jrk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/word-ladder-shortest-path-and-hashing-concepts-rhq5nu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/celebrity-problem-path-between-two-tree-nodes-and-tree-9vtlrw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/set-intersection-reduction-and-trie-data-structure-98kr6q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-frequency-in-sorted-array-and-max-coins-from-bags-in-k-kd5pjz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/html-and-css-basic-questions-5lpd9c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/convert-vowels-to-lowercase-and-consonants-to-uppercase-xzmk5p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rectangle-overlap-and-paragraph-matching-na3x16</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/top-k-words-from-millions-of-words-pwyh0t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-bsts-and-in-place-string-compression-a3vy72</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rotate-1d-matrix-linked-list-increment-and-row-with-max-hv5jnl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/fibonacci-code-and-spring-boot-concepts-352zzb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kmp-string-matching-algorithm-y61kq2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/binary-tree-views-and-semaphores-8hm0rs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-edges-to-make-graph-strongly-connected-rheb33</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-path-sum-5d8le1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/flattening-a-linked-list-y2op1w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-sub-arrays-with-even-sum-o24ppf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-consecutive-1s-by-flipping-at-most-m-zeroes-xtrrz2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/multiply-two-large-numbers-represented-as-vectors-8c9z9t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-difference-between-any-two-elements-1ounov</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/string-navigation-via-dictionary-words-j1t62t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kahn-s-algorithm-topological-sort-506ta2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reach-bottom-right-from-top-left-5c3x47</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/ways-for-bot-to-take-1-2-or-3-steps-fq83cc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/partition-array-into-zeros-and-ones-in-one-pass-j9gryi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/group-anagrams-into-buckets-7su79v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/partition-binary-string-into-powers-of-5-fmj6tu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-cars-to-initial-parking-slots-efa4ad</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-queue-using-array-with-no-space-waste-dwaj6h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-nth-value-of-geometric-progression-8njy52</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-drops-to-cover-lake-with-ripples-b12da1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/length-of-largest-region-in-a-matrix-and-cycle-detection-ex20yg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/validate-partially-filled-sudoku-9phjzh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-matrix-diagonally-m2j062</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-single-element-and-kadane-s-algorithm-5onjk6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/binary-tree-problems-and-lru-cache-so16z9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/select-unique-answer-student-first-fmxy7x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-number-with-k-swaps-5tfjsy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-unique-pairs-summing-to-target-and-subtree-check-chpj65</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/custom-lifo-data-structure-and-number-pattern-6mb50m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/numbers-without-greater-right-element-range-updates-and-gift-3utkyl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/excel-column-name-max-leaf-to-leaf-path-and-friend-requests-ppsyz9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/zig-zag-traversal-subtree-check-interface-vs-abstract-class-28rfih</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-k-closest-pickup-agents-and-string-transformation-36qz0w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/n-ary-tree-diameter-web-request-lifecycle-and-deadlocks-fr8se7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-chain-length-in-a-binary-tree-nxus3m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-word-transformation-steps-kdfet8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-verticals-in-a-modified-binary-tree-ieo2yr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/reverse-string-and-palindrome-check-sylca0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/java-exception-handling-code-h5hudf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/determine-if-a-matrix-is-a-cross-matrix-hj8b1e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-binary-tree-level-order-in-reverse-order-v46l3b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kadane-s-algorithm-and-linked-list-intersection-ies1la</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/design-o-1-max-stack-and-stock-buy-sell-profit-oupd14</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/top-k-searched-elements-from-continuous-stream-f6unaa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/linked-list-k-m-reversal-next-greater-element-and-tree-ifsyp2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/construct-custom-stack-with-delete-middle-in-o-1-c4sfu9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/virus-spread-in-binary-tree-and-product-array-except-self-jb35j6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-free-1-hour-slot-from-employee-meeting-times-r0vwa2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-generic-tree-reverse-order-and-top-1000-movies-qwdxk9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/compute-hcf-or-gcd-of-two-numbers-using-command-line-1yqk9z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-a-rearranged-string-can-form-a-palindrome-wft5sq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/c-syntax-doubly-linked-list-insertion-and-fibonacci-series-m8fmby</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/write-code-for-a-prime-number-feniz6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sql-queries-create-table-and-second-highest-salary-h3xi4f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sql-query-to-convert-elements-to-uppercase-p8fjo5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/recursive-factorial-function-88ti2z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/identify-identity-matrix-and-matrix-multiplication-5tjuo3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/prefix-to-postfix-conversion-ec6bhp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/the-stock-span-problem-grepe3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/decode-a-recursively-encoded-string-7eu6pd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-sum-with-no-adjacent-elements-on-tree-levels-57xqu9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/matrix-explosion-and-reachability-l94yfx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/game-of-subsets-variation-v47qfc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/valid-sudoku-u15vuj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/valid-bracket-combinations-1neirw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reconstruct-string-without-spaces-tza5xh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/swap-linked-list-values-by-kth-intervals-se0tzb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-stack-of-slabs-in-multi-dimensions-a4xb8x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-chain-of-pairs-g37ym3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/closest-greater-number-on-the-right-side-2rdm6l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/run-length-string-encoding-with-constraints-iqzfq2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-conflicting-events-a07cl7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-row-sum-plus-column-sum-in-2d-array-bmm07a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/assign-neighbor-pointers-in-a-bst-autp64</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/calculate-parking-price-and-design-data-structure-nvc7vp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/spirally-traversing-a-matrix-hbp9wl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-conflicting-appointments-u81e71</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lca-of-a-tree-with-parent-pointers-3du0al</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/word-pattern-match-cfo08e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-pairs-from-two-arrays-with-given-product-kpk4o8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-all-sub-rectangles-in-n-m-matrix-jzcv3m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/optimal-package-selection-from-warehouse-nqfx7o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/calculate-time-taken-to-cover-distance-gv7t5s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/split-array-into-two-parts-with-equal-average-8uwtsd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/retrieve-latest-visit-date-for-each-patient-n9tkdu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/read-and-display-roll-numbers-of-10-students-7bxi1q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/subtree-verification-75wcfy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/area-of-unblocked-regions-h5wuuy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/intelligent-20-question-game-design-89z6hl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/alternating-merge-of-linked-lists-f5s04q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lexical-ordering-of-unknown-language-mmni8j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/trie-implementation-and-analysis-1v56cx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/round-up-radius-area-and-caesar-cipher-string-conversion-gwxk3t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/write-code-for-linear-search-0k3pcj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-substring-with-unique-letters-and-sub-matrix-sum-isgub1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kth-smallest-element-in-bst-and-search-in-sorted-matrix-8nrbqk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-loops-in-linked-list-and-construct-mst-j0amf3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-next-higher-palindromic-number-y8f9z1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/weight-sorting-puzzle-and-trapping-rain-water-ll4ds9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/segment-tree-build-max-subarray-with-zero-sum-and-lca-in-17riqm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/median-in-running-stream-tree-views-and-cache-implementation-7xuzu1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/youngest-common-manager-lexicographically-previous-faxrg6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-of-minimum-values-along-all-paths-in-a-2d-matrix-8if9zd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/determine-if-an-ant-colony-is-good-based-on-interaction-h5cyks</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-mean-median-and-sum-in-an-array-od9mhn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/form-two-numbers-from-an-array-of-digits-with-equal-or-near-2fomye</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-in-an-infinite-array-i62p5c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-intersection-point-in-y-shaped-linked-lists-cwxx82</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/min-heap-implementation-problem-l5r3pj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/gas-station-circular-petrol-pump-eadq48</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-an-element-with-value-equal-to-its-index-in-sorted-cjku2r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/ways-to-construct-an-n-x-4-wall-using-1-x-4-bricks-099on9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-binary-tree-nodes-in-spiral-order-with-constant-space-05702y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-subarray-interval-with-maximum-sum-3p47jc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-the-second-largest-number-in-an-array-5ce6wi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-product-of-two-consecutive-elements-v1jy3b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/nearest-palindrome-to-a-number-ucvkp5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-first-duplicate-element-5lj3dw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-digits-until-single-digit-o038pl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-continuous-streak-of-1s-after-flipping-m-0s-68fnjv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/serialize-and-deserialize-a-bst-ggx49m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/total-decoding-ways-kxiav1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/total-decoding-messages-6ihcnc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-common-prefix-xrz3zq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/random-gift-exchange-sequence-t5thwc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-words-appearing-k-times-hgds0i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/multiply-polynomials-as-linked-lists-cu4mem</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-max-size-bst-in-binary-tree-mw4t0b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/java-programming-tasks-l4998v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/euler-s-totient-and-inversion-count-56wizb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/stock-profit-and-pattern-subsequence-aq1bp2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/connect-ropes-and-graph-traversal-a8yxny</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/spiral-traversal-and-water-overflow-2p5nng</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bst-check-and-linked-list-sorting-u94fbx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bracket-validation-and-merging-arrays-koid7i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/merge-lists-and-closest-locations-cbn925</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/collision-probability-and-tree-components-67q0k9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/dice-throw-and-event-scheduling-86uy1q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-th-largest-in-bst-and-subset-of-rectangles-4vw7bq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rabbit-and-carrot-optimization-tvv0ev</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/palindromic-paths-in-matrix-er2ym9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/smallest-and-second-smallest-distance-2bwrnp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/custom-sorting-pf7qy9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/hits-and-pseudo-hits-n5qawa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-0s-and-1s-n7og8c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/ternary-expression-to-binary-tree-t8kay8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/infection-spread-in-matrix-n66bi7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/car-crossings-jh7gil</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/linear-search-ihs42d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/data-structure-basics-pbhdx2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/infix-to-postfix-gevbh8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/byte-stream-parsing-4etxj8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/optimal-merge-pattern-cq7jgw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/array-and-string-operations-z5l4ny</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-greater-number-po3leq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/print-the-second-highest-element-from-a-set-of-integers-ou5pfs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/as-far-from-land-as-possible-bgdck3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/second-maximum-number-xy77nb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/recover-bst-q38x9p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/min-distance-in-weighted-graph-yr7hxr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-all-numbers-in-sorted-order-from-a-row-and-column-wise-221rj2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-a-given-key-in-a-sorted-stream-of-array-efficiently-5tuvm4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-three-numbers-fitting-pythagoras-theorem-in-an-array-hr69d8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-number-of-islands-in-a-matrix-with-edge-condition-ax3upp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-dictionary-anagrams-for-a-given-string-3oobrn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-frequency-of-a-number-in-a-sorted-array-and-binary-1jqeag</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-frequency-and-second-largest-number-in-an-array-1fkq2q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-middle-element-and-merging-point-of-linked-lists-oh0by4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/write-code-for-a-linked-list-8t9icm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/non-standard-binary-search-optimization-zjblq4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/detect-and-remove-cycle-in-a-linked-list-bl5ws6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/solve-for-missing-variable-in-a-b-c-ee0rqz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rotate-ring-matrix-anticlockwise-3a1brs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-almirahs-by-height-7sm7bk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/swap-alternate-nodes-3rhmgf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/prune-bst-ja966k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/string-interleaving-aan9on</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/video-interval-coverage-qoe0bd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/java-basics-and-patterns-7i17gf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/method-overloading-implementation-6nbwbr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-range-in-bit-array-to-maximize-1s-after-flipping-y3je0n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-element-appearing-odd-number-of-times-iq5i1w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-largest-palindromic-substring-l6vass</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/html-form-snippet-with-float-integer-and-submit-button-l2gvr6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/java-syntax-and-keywords-fundamentals-yqj81g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/insertion-sort-optimization-and-data-structure-selection-6543vi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/search-techniques-using-hash-tables-and-tries-ota8qt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/store-mobile-numbers-of-citizens-using-trie-g91vzk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/search-historical-ancestor-in-a-large-family-tree-90ait7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/carrot-field-epidemic-grid-modification-honbz6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-path-in-a-grid-with-obstacles-elimination-1oiebx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/shift-string-characters-by-a-numeric-key-p2dmp8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-highest-number-with-same-digits-esjn8l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/product-of-remaining-digits-786nh2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-list-in-x-form-k7we8z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-continuous-1s-by-flipping-one-0-9jxxak</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/robot-path-counting-9np46u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-nodes-with-path-sum-less-than-k-o0nfrz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bst-to-dll-b0hgpj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/rectangle-overlap-szm0av</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sql-even-rows-oiz2f9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/divide-linkedlist-into-k-segments-and-print-in-reverse-order-be7b07</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-if-there-is-a-path-between-two-vertices-in-an-8tljsu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-dimensions-of-an-overlapped-rectangle-7cm7fk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rotate-matrix-by-factor-k-z9oq1s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/postfix-to-prefix-without-using-recursion-sfkr6y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-number-possible-by-concatenating-array-of-numbers-zqw29i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/write-the-heapify-code-sjt2vz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/level-order-traversal-of-a-tree-5369p0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-distance-to-nearest-door-in-a-matrix-sqh2vl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/merge-k-large-files-that-do-not-fit-in-memory-on5vei</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/oops-and-dsa-concepts-amuuj5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-all-leaves-are-at-same-level-65xutb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/binary-string-reversal-r7ixll</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/infosys/fibonacci-sequence-z0vnkn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/phone-keypad-strings-h2krx1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maze-exit-pw8pw5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/overlapping-intervals-5wjo4f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/correct-deformed-bst-w3w953</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/dijkstra-algorithm-67bq0b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/pairing-elements-for-equal-sums-24kh7n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/probability-of-remaining-in-rectangle-8j5g15</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/applications-of-heap-orefq3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-nodes-at-a-level-n4zptl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/url-string-escape-fxf433</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-smallest-distances-zqugo8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/4-numbers-sum-in-bst-79xegx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/count-negative-elements-in-sorted-matrix-b1efhp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/encode-array-of-strings-9vg3wy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/delete-nodes-from-binary-tree-xzb9k6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/phone-keypad-words-l93kqo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sort-50gb-file-h815t1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pair-sum-to-zero-3oc4d0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/buy-and-sell-shares-hjx8zb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-rooms-required-2yt1xh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-1s-in-binary-matrix-jeaij4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/permutations-of-two-strings-5cki4d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/generate-valid-ip-addresses-0flf9w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/connect-leaf-nodes-of-binary-tree-to-dll-8u7gz9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/remove-alternate-duplicate-characters-in-place-9t3164</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/favorite-genre-problem-xw48ot</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-number-to-roman-numeral-rxp15s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/return-non-intersecting-pairs-68xszz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-robot-moves-in-a-circular-fashion-cdivn3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-matrix-spirally-j3p34z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/function-call-timestamps-query-system-g6fysk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/subarray-having-least-average-581fpx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-higher-permutation-of-a-large-number-979u8s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/best-fit-for-memory-block-in-bst-7mge91</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/first-repeating-element-in-character-array-o7nn1j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-difference-between-two-elements-sm38st</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/in-place-merge-sort-for-linked-lists-2ug5yt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-island-in-a-matrix-qnkq7t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-area-histogram-and-triplet-sum-i3mdx5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sql-query-for-nth-salary-5dckst</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-max-n-elements-in-bst-xqswb4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/row-with-maximum-zeroes-in-a-sorted-binary-matrix-evt1z2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-all-cycles-in-a-directed-graph-evbc8x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/nth-smallest-element-in-a-sorted-2d-array-9hnsr6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/smallest-number-with-digit-product-equal-to-n-j0ehgw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-binary-tree-to-sorted-in-order-tree-in-place-058vnd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-element-removals-for-max-2-min-9vk10t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kth-minimum-element-in-a-complete-bst-uf7i7y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-square-submatrix-with-all-1s-xs7q69</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-third-largest-element-in-an-array-f8lo2i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-list-based-on-different-parameters-rq7kbz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-array-according-to-absolute-difference-rsq5o1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/construct-balanced-bst-from-sorted-list-pwunc2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/add-two-numbers-in-c-w8uumo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/lower-and-upper-32-bit-representations-from-char-array-13195s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximize-1s-by-flipping-bits-in-binary-array-dw3818</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/generate-k-length-combinations-from-string-v6o7fe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/square-root-of-integer-to-decimal-places-i1refw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/merge-two-balanced-bsts-c14vte</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/different-ways-to-evaluate-expression-8mw1n6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/array-vs-linked-list-5041yg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-number-of-islands-using-dfs-phq6t8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-correct-pairs-and-orders-of-parentheses-r7flmo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/modify-tree-nodes-to-store-subtree-sums-5yku98</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-two-numbers-with-overflow-handling-wzbk8d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-sum-from-array-ends-with-daily-multiplier-bu0yxs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-greater-palindrome-from-digit-array-26x6xf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/generate-prime-numbers-in-range-7p7ssc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/min-and-max-element-in-array-without-sorting-b1wma0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-impossible-triangles-mlfh6n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-number-from-pattern-rutk0k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/submatrix-sum-query-fgtyc3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lexicographically-minimum-string-rotation-985ku8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-node-violating-bst-property-96l6g3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-score-in-race-vn3gl4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-unique-rows-in-binary-matrix-35hwm8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/prefix-expression-to-tree-q2gqa7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/anagram-query-and-autotype-5du2y0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-stack-top-function-f2cgj9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/number-of-bomb-blasts-am1dg5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-level-sum-t9u17i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/split-array-for-min-difference-vf8pxn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/unique-palindromic-substrings-jl1zvn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bridge-connection-problem-j29bvy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/eligible-cities-in-budget-ark95r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/palindrome-number-4t0nso</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/first-non-repeated-number-in-stream-h7of78</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/binary-tree-to-dll-986dlc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/second-largest-number-g8bx3u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/substring-reverse-search-upyd1n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/children-sum-property-xhjrv4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-dictionary-using-trie-076vbw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/edit-distance-between-two-strings-2sidz0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sql-oops-and-basic-programming-concepts-mdlmk4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-for-complete-cycle-in-graph-2aru3p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-size-window-containing-characters-72lfdv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/arrange-string-so-characters-are-k-distance-apart-gtm9uh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-first-array-according-to-second-array-9vil91</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/java-oops-and-codevita-solution-discussion-z9k7e9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/form-string-with-first-character-of-all-words-qqe29p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/spiral-level-order-traversal-using-one-stack-and-one-queue-cs4ss2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/array-value-by-repeatedly-replacing-max-2-elements-with-sum-jgtv43</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-a-heap-zax5a0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/good-ranges-query-processing-2btg3k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/tree-level-query-with-value-threshold-k2hv6q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/heap-operations-and-heapify-9xtalj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-th-largest-element-in-a-tree-03f381</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/smallest-number-after-n-deletions-vw33hq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/check-if-binary-tree-nodes-are-directly-connected-csly91</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-coins-for-sum-k-z6be6l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kmp-pattern-searching-0mcwij</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-node-pairs-with-sum-k-in-bst-in-o-n-time-and-constant-r7iz9m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/fair-coin-toss-from-biased-function-7bem5u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/identify-islands-on-a-map-abxd8b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/tv-remote-channel-search-6grztk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/process-termination-and-threads-xn5h9r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/top-10-server-hits-in-last-5-minutes-6s5i7k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/populate-next-sibling-pointer-in-binary-tree-a6xuox</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/subarrays-with-average-equal-to-k-b68u1o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-consecutive-ones-in-circular-array-wy1ntc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/java-fundamentals-jvm-jdk-and-jre-36198y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/random-sentence-selection-from-a-large-file-py4hz9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/insert-element-into-bst-and-find-peak-in-bitonic-array-xq15gq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/replace-array-elements-with-next-highest-element-on-right-1gys9m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-non-heavy-paths-from-binary-tree-k7s73g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/determine-execution-order-of-dependent-processes-bhc6u0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/tree-path-with-highest-number-of-bends-3k6wzk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-numbers-formed-by-root-to-leaf-paths-t1lude</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/dictionary-pattern-matching-in-2d-array-and-string-sbyt7m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-max-element-in-o-1-and-array-traversal-6jub07</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/draw-digital-clock-and-to-do-list-in-react-w85vff</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/validate-expression-brackets-and-tree-properties-lja9d2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/optimization-using-modified-binary-search-l14uyo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-whitespaces-from-a-given-string-f1v6vv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-common-element-in-all-rows-of-2d-array-m9ymru</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-cost-requirement-for-merging-files-4y5568</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/burning-tree-xwafx2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/minimum-characters-for-palindrome-1ohhhx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/add-binary-strings-zj3yw7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/sql-commands-and-cpp-oops-concepts-4mf6nd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/prime-number-or-fibonacci-series-logic-8mcnlf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/matrix-multiplication-stacks-queues-and-ddl-dml-yi4d38</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-a-linked-list-by-odd-and-even-positions-4e012r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/random-song-play-and-binary-tree-distance-9mpxur</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/subtree-check-and-max-of-k-sub-array-bl0yoy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/automate-friend-list-api-dvz3ju</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-width-of-trees-at-each-level-t2hvjr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/list-operations-and-javascript-keywords-nf1f47</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-nodes-in-a-linked-list-2nmjv6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-pairs-of-positive-and-negative-values-chm3i8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-k-th-minimum-element-in-a-2d-matrix-8k65v4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/calculate-peak-concurrent-transactions-p2bwls</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-points-within-an-angle-ppwzq6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/pattern-and-array-problems-idk9ft</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-the-second-largest-element-in-a-list-1vq2zh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/top-k-frequent-numbers-from-a-stream-nha6cq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/filter-employees-using-stream-api-71ycbs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-highest-salaried-person-lwora5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/convert-binary-to-decimal-4585ke</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-area-of-triangle-dc8kqi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/knight-tour-with-obstacles-rae023</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/unique-triplets-summing-to-zero-2raz7x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/float-to-string-conversion-u2e47l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/recursion-example-3l0xub</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/binary-search-traversal-g5kqf3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/string-and-linked-list-manipulation-ispkt6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-linked-lists-4lhexc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-number-from-digits-67v3ue</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-element-in-bitonic-array-56dri3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/number-of-clusters-of-1s-in-a-matrix-7zo9b2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-best-fit-for-a-packet-in-a-rack-ceil-value-iagk9r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-non-increasing-segment-in-a-linked-list-4qk7t0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/partition-labels-variation-tx0yl7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-triplets-in-bst-o84d9j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-all-palindrome-strings-of-length-1-69rgf7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/numbers-with-consecutive-difference-1-ak8w9y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-number-of-stations-4r5va1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-flips-for-0s-and-1s-p6z1ku</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/merge-sort-logic-q2a2z1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/distinct-numbers-in-windows-mo07pq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/alphabet-order-from-array-of-strings-005x1m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/oracle/reverse-a-linked-list-and-level-order-traversal-of-tree-ucvwy9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/digit-sequence-decodings-and-maximum-of-subarrays-of-size-k-5hlctd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-number-of-islands-using-dfs-and-rearrange-linked-list-pl1kda</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-all-two-sum-pairs-b8u1yo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-k-consecutive-occurrences-of-a-character-s4b84g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-linked-list-contains-loop-k063yn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-window-substring-3co5ce</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/n-th-magic-number-9v2hmz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-unnecessary-brackets-and-longest-alphabetical-6eqftx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-missing-number-and-debug-code-snippet-2bqm1h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-sum-of-two-numbers-less-than-given-number-and-scheduling-lm3bmp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/n-ary-mirror-trees-and-crossword-word-search-uiu4az</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-incoming-character-stream-to-integer-d4x74q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/get-nth-to-last-element-and-compare-binary-trees-vjjj6p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/clone-binary-tree-from-different-machine-2z64k7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-k-most-frequent-numbers-3d3n4o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-distinct-roads-in-a-map-dc4ifs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-memory-usage-increase-z3p2hp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/extract-maximum-numeric-value-qduqr3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/validate-generated-string-oiiwy7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/identify-unique-numbers-in-rotated-array-kpqi5k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/delete-paths-in-bst-based-on-threshold-e97wkx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/max-height-and-path-of-tree-8bhmww</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reorder-log-files-6n1fmw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-special-stepping-numbers-in-a-range-v772a4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-array-into-zig-zag-fashion-ym80cf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-rectangle-area-in-histogram-36ktap</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimize-string-value-after-removing-k-characters-5s2d1c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/index-of-pair-with-sum-k-and-maximum-element-ol786t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/finish-all-tasks-from-dependencies-rey7dh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kth-character-of-decoded-string-zdo8ax</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-pairs-of-x-and-x-in-array-m4u6c4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-special-nodes-in-generic-tree-with-distinct-paths-jio6u7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-critical-connections-in-a-graph-1rcmr8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/previous-greatest-element-6rjnek</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-record-tuples-by-custom-criteria-r4lo9k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/modify-linked-list-values-based-on-mirror-nodes-u76z80</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/recursively-remove-consecutive-duplicate-pairs-u6n0l0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/in-place-character-frequency-insertion-z4itdp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/gas-station-circuit-tour-gl2vom</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximize-ones-after-single-subarray-flip-dqy3it</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/fold-a-linked-list-g0o5rw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/random-music-player-shuffle-7pbkm9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-followers-in-a-social-graph-rs9wx3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/substring-search-implementation-6a6tqs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/delete-node-from-unordered-doubly-linked-list-b9oj2l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/optimized-power-function-0npshy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/package-build-order-ia9eoo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lca-in-bst-with-missing-nodes-j9a2j3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-distance-with-single-bent-6jbxby</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/word-frequency-in-paragraph-1x398p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/class-dependency-build-validation-zx1qqo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/truck-space-product-fitting-2w4zri</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/item-pagination-and-sorting-rc10fg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/boolean-parenthesization-problem-q8bmrg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-most-valued-customers-2kty10</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kth-element-in-spiral-matrix-2pjr1v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/task-scheduling-with-resource-constraints-2d7xcp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/house-robber-on-a-tree-spgxv8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/design-a-random-song-shuffler-without-repetition-q32zvr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/node-with-highest-average-subtree-value-in-n-ary-tree-i93015</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-ways-to-partition-a-number-into-prime-numbers-0uh93n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-of-minimum-for-every-window-size-in-array-7zt0v8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reverse-nodes-in-k-group-6ier9v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-kth-node-at-every-kth-level-of-an-n-ary-tree-qehue6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/letter-combinations-of-a-phone-number-matched-with-ygux2t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/orphan-node-and-cycle-in-linked-list-1sqhpc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/non-crossing-bridges-between-cities-dt4atu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/detect-loop-and-find-list-size-ieh13s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/two-sum-in-bst-6hwgvg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-sum-kxk-submatrix-329u4u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/water-spill-in-pyramid-buckets-vh6xaz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/room-farthest-from-guards-a9lbho</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-length-subarray-with-given-sum-t86glo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/update-bst-based-on-rank-7iajbz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/circular-queue-using-array-jiz3fw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/largest-distance-between-2d-locations-p6v2qq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/sort-array-by-element-frequency-wt0izy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-route-on-a-grid-54kcbi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-a-peak-in-an-array-2q9trg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-travel-cost-bau1jw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-people-in-party-jxmzh3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-1s-in-row-sorted-matrix-64h5h3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/ford-fulkerson-algorithm-m61jpy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/character-replacement-qi6lbr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-number-and-its-negation-jcwrm8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-nearest-delivery-boy-t3ke6z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/smallest-substring-with-max-distinct-elements-f1trxt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/coin-denomination-ways-52t1y8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-element-occurring-once-lpk5jk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/graph-transformation-a49mb1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-leader-in-array-t92eyl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-a-bst-to-double-linked-list-n7v6qy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-words-spaces-and-special-characters-ayr60m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/robot-movement-in-a-grid-38jlj3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-heavy-path-approach-8apm5c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-valid-combinations-of-a-string-s63xqe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/value-to-subtract-to-make-sum-k-x80ke0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-array-can-be-sorted-with-one-swap-brfa1d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/inversion-count-problem-z9rirr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/blood-relation-problem-lca-zrwz1p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kth-maximum-occurring-number-in-a-stream-8rnu9m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/ip-suggestion-system-a2066j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/even-numbers-with-prime-set-bits-uqbw70</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reconstruct-travel-itinerary-9tfinm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/global-vs-local-variables-and-parameters-hev0sf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/number-of-shapes-in-a-boolean-matrix-4semz8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/fractional-and-0-1-knapsack-rgex5f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-iterations-to-pass-info-in-a-tree-2syd93</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-rectangle-in-histogram-ir293p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/position-of-element-in-infinite-sorted-array-b7dk7w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-numbers-stored-on-different-machines-hgfkc3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-size-sub-matrix-with-all-1s-pclai1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-k-largest-elements-in-a-stream-lh380i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-extra-production-lines-i5wqej</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/social-distancing-evacuation-lwa5ls</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/top-k-words-near-cursor-x4230s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bst-with-subtree-scores-ji04ix</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-initial-score-to-reach-destination-qqw032</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-pow-a-b-kvxjf1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/subarray-with-0-sum-tjyxf1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-next-largest-node-in-bst-with-parent-pointer-kgg4ur</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-rotations-in-sorted-rotated-array-eoylw3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-elements-of-sorted-rows-matrix-in-sorted-order-i7y5sk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-very-long-floating-point-number-to-string-ix3k7m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pair-of-movies-with-duration-sum-close-to-flight-time-uo8g3p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-closest-warehouse-for-delivery-r51poy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-anagram-string-or-palindrome-ozo7be</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-missing-number-in-string-without-separators-y7c1ri</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-string-length-after-single-cut-and-canceling-append-tbwf2s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/validate-chocolate-consumption-queries-by-priority-and-day-iyj5m7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/clone-bst-with-replaced-value-and-minimum-memory-8crnzx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-kth-element-from-the-end-of-singly-linked-list-9dvp8v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/top-n-sold-items-from-unorganized-file-9ebuxl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/two-way-traffic-signal-queue-simulation-g5xygi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-insertion-point-of-character-in-sorted-array-h1t8az</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/connect-nodes-at-same-level-in-complete-binary-tree-55n7jn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/alien-dictionary-character-sequence-cldey5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/smallest-substring-containing-all-characters-of-another-593e4t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/top-n-occurring-words-in-text-file-aa4t5i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-path-in-matrix-with-consecutive-distinct-integers-oa5jga</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pair-with-largest-sum-less-than-k-6rlfwx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-distinct-integers-in-contiguous-subsequences-of-size-k-fcpy4t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-consecutive-1s-with-single-zero-flip-rupmp8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-closest-pair-from-two-sorted-arrays-1c5lrr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/replace-o-with-x-if-surrounded-by-x-rpv214</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-steps-to-reduce-virus-count-to-1-a5vwog</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/validate-if-a-graph-is-a-tree-h0hp0e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-occurrences-of-strings-in-a-set-2vg0p6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/move-even-numbers-to-front-and-odd-to-end-95ly29</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/extract-sorted-integers-from-large-files-y9b4k1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-parentheses-to-remove-n5nz55</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/string-permutations-using-recursion-1wbwla</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/electricity-connection-cost-8jq1pm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/boggle-solver-v541ha</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-tree-and-alternate-array-b5q4tm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/multilevel-linked-list-17b4ts</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/replace-pattern-in-string-4fzkyn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/top-k-trending-tweets-ymd7q3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/chemical-formula-atom-count-wb7mag</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/linked-list-sum-next-number-point-in-triangle-hnaa9n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/room-allocation-and-max-sum-npfb78</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/advanced-stack-a0izqp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/dictionary-word-validation-goe9t6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/log-file-storage-usav2w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/virus-infection-time-2qbr7f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/employer-employee-mapping-8y2n1l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/postfix-and-dice-sum-c3xwgf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/binary-search-and-maze-52nnys</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/equation-evaluation-sva6q0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/paradox-check-xirx9k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/time-for-covid-infection-in-a-hospital-ward-zi8kba</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/write-a-calculator-web-application-evaluating-bodmas-ro09is</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/link-all-level-order-nodes-in-a-binary-tree-nmcj9o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/distribute-n-candies-among-k-people-thzi1v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-steps-to-convert-x-to-y-using-binary-matrix-1ybt85</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/maximum-path-sum-in-a-matrix-from-top-left-to-bottom-right-ra9fw9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-triplets-in-array-whose-sum-equals-zero-st151j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/fish-collision-simulation-x65208</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-linked-list-node-at-square-root-of-length-position-08z94x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/first-common-number-between-two-linked-lists-kl9e28</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/randomize-song-playlist-wz8zr2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-a-stack-using-recursion-owhl85</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/most-frequent-character-in-input-string-adsi2l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/urlify-a-string-by-replacing-spaces-with-20-mljvy6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-array-form-bst-is-a-full-binary-tree-tq1hcg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-k-maximum-elements-from-a-data-stream-c8ldmj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-maximum-value-in-bitonic-array-xsgs7d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-strings-by-version-and-id-d6uxwf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-steps-to-reach-an-obstacle-in-a-2d-grid-vq2eod</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/group-contacts-by-matching-name-or-phone-number-e59l6p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-child-processes-killed-when-killing-a-process-w24okk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/final-coordinates-after-commands-rpv4jk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/path-with-given-sum-5524q6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/level-order-linked-list-bkm7lk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/modified-spiral-traversal-mwcl75</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/gas-station-ga9jc2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/digit-string-description-wy488n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/modulo-11-v9v6hp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/circular-gift-distribution-fg05j0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-value-in-each-level-cwg5pd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/farthest-smaller-element-p4zzdy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-pair-difference-k1gv1u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/mirror-leaf-order-qb2sig</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-missing-element-ngwu36</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/zig-zag-linked-list-7jceye</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-left-leaf-nodes-7qivsk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-cousins-4o20qn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/word-segmentation-ubruw1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-steps-to-make-product-of-array-equal-to-1-v7sxbr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-time-to-finish-watching-movies-from-two-categories-8px93h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-days-to-convert-all-balloons-to-blue-y3u6or</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/group-all-anagrams-together-u7kod7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-size-of-the-largest-region-of-connected-ones-hrxsf3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/special-keyboard-4qozy5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-repeating-substring-of-maximum-length-9g1l9w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-steps-to-reach-a-point-on-infinite-number-line-aw30wc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimize-travel-expense-for-candidate-interviews-between-8s62is</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-a-randomized-audio-player-without-repetition-sovdy6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/phone-keypad-string-decimal-representation-and-sorting-dpmhi9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/generate-unique-usernames-by-appending-incremental-numbers-mpnxv1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-numbers-with-at-least-two-set-bits-in-o-n-lrdkp7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-number-of-triplets-with-given-sum-svrh75</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximize-stock-profit-with-one-buy-and-sell-ce7j6w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/first-non-repetitive-element-in-a-string-7hf47m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-number-of-0s-in-a-sorted-binary-array-58lc2x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-pair-with-sum-x-exists-upz8uq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/merging-k-sorted-arrays-mnns6a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/meeting-rooms-ii-9azjg4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/top-k-frequent-elements-isrc35</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/move-all-0-s-to-left-and-1-s-to-right-in-a-stream-c5m3zv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bus-capacity-car-pooling-94ikg1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-product-of-non-adjacent-nodes-in-a-tree-nqhmq1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reverse-nodes-in-k-groups-201dvy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pairs-with-minimum-absolute-difference-l264eb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-critical-nodes-in-a-graph-3zf1ei</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/find-2nd-highest-salary-md32nw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/string-generation-from-ab-mpr37c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/divide-array-with-equal-cherries-so30e6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/top-k-elements-by-distance-wij40g</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/subtract-two-linked-lists-8jiitt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/01-matrix-distance-yf9l7c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/dictionary-word-break-az9wbc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/triangle-square-existence-cm8zxv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/clockwise-points-q8mdj0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-bst-ylme56</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/petrol-station-circuit-bcx7oy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/move-zeros-to-last-24noex</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-k-consecutive-chars-et6813</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-ways-to-reach-nth-stairs-and-modified-dfs-7ax7ho</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/first-greater-number-to-the-left-1gz6zr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-excel-column-number-from-string-w3zy1w</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/parse-number-given-in-words-0iaa31</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-pair-with-given-difference-6uz4u9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-element-count-and-boundaries-using-binary-search-n6kleu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/all-possible-permutations-of-different-lengths-amq9mc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-sum-sequence-in-array-9viogr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-consecutive-path-and-left-leaves-sum-in-binary-tree-pkdq2q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/play-all-songs-once-with-random-selector-m2gjku</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/search-in-sorted-array-with-1-maxima-and-match-parentheses-76cpxd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kth-element-from-end-of-linked-list-and-island-problem-wpgt30</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/target-sum-0-using-all-array-elements-lz966o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/distribute-candies-in-binary-tree-x5ildu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/path-length-with-maximum-number-of-bends-ate8rg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-path-using-bfs-q17xku</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-duplicate-characters-in-lexicographical-order-2zf8an</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/unique-paths-in-a-matrix-with-obstacles-2f01ot</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/interleave-two-halves-of-a-linked-list-e3cllc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-m-sorted-arrays-8cejae</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-root-to-leaf-paths-with-sum-less-than-k-mv3ywa</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-lru-cache-using-circular-linked-list-s38ayb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-array-of-squared-elements-kdjjc2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rat-in-a-maze-problem-pb5hm1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/first-repeated-word-in-stream-i97p5b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-edit-path-h6hsxy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pairs-with-product-x-hujw2h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-product-of-three-elements-tn34dx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-triplets-0kawnm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/palindrome-count-with-wildcards-1exrvn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/tree-height-with-leaf-dll-dz182s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/generate-combinations-a2jcik</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bubble-collision-cji954</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/string-query-operations-7yd55c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/folder-management-system-3v7gpk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-pairs-in-array-whose-sum-is-less-than-x-dh6s4m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/flip-binary-tree-r5wshq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-celebrity-701zza</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/next-greater-elements-for-all-array-elements-anj6z3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/split-array-into-minimum-subarrays-to-sort-by-rearranging-w8r6cb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-adjacent-identical-elements-repeatedly-9u1zhe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/level-with-maximum-nodes-and-sum-in-tree-p6s2sz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-float-to-string-without-inbuilt-functions-1mx38c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/output-postorder-traversal-from-inorder-and-preorder-rt1dyf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rotate-string-counter-clockwise-by-m-1vk9bz</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/implement-binary-search-0se59a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/convert-sorted-2d-matrix-to-1d-sorted-array-b2eelu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/identical-trees-and-subtree-check-k597nn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-duplicate-subtrees-ban9u7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/number-of-permutations-of-a-pattern-in-a-string-fen20v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-min-length-subparagraph-containing-n-words-e99rtc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sub-arrays-with-zero-sum-aa526d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-reversals-to-balance-parentheses-plhey1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-pair-with-neutral-ph-value-8fcobi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-gold-coins-in-matrix-0gakm7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/3x3-grid-pattern-combinations-f04lz7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-trie-for-word-storage-gs6yas</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/counting-inversions-522srp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-strings-that-are-not-prefixes-62192j</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/optimal-position-for-house-3ed2sq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-best-fit-box-for-an-item-vxy8bw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-a-string-inside-a-2d-array-nvq5de</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rearrange-array-elements-dhg7ay</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/people-sitting-standing-simulation-113ryd</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-length-subarray-with-sum-target-sf9m4b</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/repeating-element-in-window-k-7gkgc3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-random-elements-from-n-452y9x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/heapsort-klewz9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/divisibility-by-3-in-binary-stream-m6fy8a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/split-number-into-n-parts-657riy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-region-of-1s-1ukpvi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/robot-path-finding-9qgpc7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/swap-2-numbers-without-using-a-3rd-variable-8ke0s8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/set-matrix-zeroes-s9iphf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-transition-point-in-infinite-0-1-array-r00ec4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/design-ds-for-o-1-insert-delete-search-and-random-ti0an0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-x-is-divisible-by-y-epbod2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-flips-to-make-string-monotone-increasing-wp3yul</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/time-for-ceo-mail-to-reach-all-employees-5329ez</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-diameter-of-a-binary-tree-and-number-of-islands-g8lnw4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sql-query-for-customer-orders-and-arithmetic-expression-5j1ifg</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-platforms-required-and-kth-smallest-element-ebo1qf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-absolute-value-linked-list-reverse-list-and-toll-gate-1ekuow</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-tree-boundary-and-efficient-ip-address-retrieval-from-up2u3z</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/populate-next-pointers-in-tree-and-top-k-frequent-strings-ixj0cr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/nodes-at-k-distance-from-leaves-and-java-equals-hashcode-iv4tu0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-connection-pooling-and-reverse-every-k-nodes-in-ne0ros</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-palindromic-substring-and-cricket-domain-modeling-wavml4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/linux-log-parsing-script-pjom9q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/iot-project-discussion-and-python-java-core-questions-acrda7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/construct-tree-from-traversals-and-virus-elimination-jo99ha</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/insertion-and-search-in-trie-je6m65</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-nodes-at-lowest-level-of-binary-tree-wc8gz6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-consecutive-number-sequence-sinyt8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/probability-of-sum-of-k-dice-throws-r8rc76</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-two-numbers-represented-by-linked-list-6pgn82</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/identify-most-followed-3-page-sequence-87dlfm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/remove-first-duplicate-from-linked-list-8dzi3o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-maximum-minimum-sum-subarray-of-size-k-qpsjd7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-bst-is-a-sum-tree-8i086l</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/ways-to-cross-grid-border-in-exactly-k-steps-cfu2gi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-sum-subtree-which-is-also-a-bst-3hm8a5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-strings-according-to-frequency-zuc4ae</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/swap-alternate-nodes-in-a-singly-linked-list-kn2853</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-student-with-maximum-average-score-32sq8s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-two-trees-are-isomorphic-xik5m0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/get-minimum-of-stack-in-o-1-time-7psst2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-linked-list-containing-only-1-2-3-in-single-pass-06jibs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/separate-even-and-odd-numbers-in-linked-list-mf83f6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-path-between-two-points-in-0-1-matrix-t5egj0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-column-of-large-file-and-reorder-rows-vsyv6a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-pairs-of-prime-numbers-with-product-n-3i2g47</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-kth-node-value-at-nth-level-with-specific-tree-rule-md642x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/longest-monotonically-increasing-sequence-in-o-nlogn-ofbwe8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/optimizing-alexa-suggestions-pb45gu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/device-application-pairs-chl09o</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/iterative-letter-combinations-of-a-phone-number-c98w95</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-binary-tree-in-zig-zag-order-pgwg72</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-max-a-i-a-j-with-i-j-3voqbv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-cost-to-paint-n-buildings-vql512</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-last-occurrence-of-a-number-in-sorted-array-bm7kvc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-coins-collected-from-bags-after-k-turns-kk68vl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/numbers-with-adjacent-digit-absolute-difference-equal-to-1-tc7wky</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/compile-interlinked-libraries-using-topological-sort-p6ia1y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-maximum-average-in-n-ary-tree-2lrpka</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/store-deepest-right-leaf-nodes-in-a-list-o5pm7t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-number-of-balanced-brackets-16e67i</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-k-largest-integers-in-running-stream-mjo299</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-matrix-spirally-from-any-point-and-given-direction-0mlkkf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-a-lifo-data-structure-with-middle-operations-zf3l5u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-pairs-that-add-up-to-0-closest-to-0-and-farthest-from-0-sgja62</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/identify-array-pattern-and-find-max-in-sliding-window-t774lw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/minimum-buckets-to-fill-k-liters-and-substring-split-without-ivqw15</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/find-k-most-frequently-used-elements-and-sort-0s-1s-2s-ct3j6t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/microsoft/expression-evaluation-and-word-suggestions-with-prefix-womo8x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/evaluate-space-separated-mathematical-expression-e2bkve</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-two-very-large-integers-without-bigint-jmqcn5</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-minimum-element-in-stack-in-o-1-time-3fncev</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-if-a-cycle-exists-in-a-graph-given-its-edges-18hsbx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-binary-tree-nodes-in-zigzag-order-hbld19</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/min-stack-problem-vdms65</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/zig-zag-next-pointer-in-tree-mk007t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-repeating-customer-from-large-file-opl054</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/swap-two-node-pointers-in-a-linked-list-tzbmd2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/bipartite-graph-grouping-71vdc4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kth-element-from-last-2akhri</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/balanced-braces-in-large-file-tuzjy8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/integer-to-word-conversion-qf395y</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/paths-in-2d-array-with-entry-exit-points-ji3min</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/nut-and-bolts-problem-n3gccx</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/closest-k-cities-28hrh4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/interval-merging-c1j0i2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/circular-queue-implementation-6zssku</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pairs-sum-in-third-array-f4pi2e</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-large-file-with-low-memory-zaos8n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/running-minimum-of-infinite-stream-vhwm76</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/update-marks-in-bst-37v6rn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/most-frequent-word-excluding-banned-list-rjdzo1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/layer-by-layer-leaf-removal-dfio3t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/rotate-square-array-elements-do0mvi</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/duplicates-within-k-indices-d50x1a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sum-of-nodes-in-same-column-653cw2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/k-distance-from-root-844nxv</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/generate-all-valid-permutations-of-brackets-h24w4d</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-weight-node-in-a-tree-c8nq40</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-diameter-of-a-tree-8u3kxr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-consecutive-and-non-consecutive-sum-md6cp6</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-island-size-dtewh0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-elements-at-a-level-se31b7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/word-breaking-problem-9j491n</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/dice-sum-ways-hna8n2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-sum-pair-5gprn9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-unique-strings-e28tgt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kth-smallest-in-bst-xyk96v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-average-subarray-o721fe</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/number-to-string-v48b74</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-row-with-the-maximum-number-of-1s-in-a-sorted-2d-oo9174</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-minimum-ancestor-of-two-nodes-in-a-binary-tree-7fo8zp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-first-occurrence-of-1-in-an-infinite-sorted-array-3nxkxh</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-time-period-with-the-maximum-number-of-living-slog4u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/insert-element-in-array-634zum</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/count-words-containing-character-e-eh83jy</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/binary-tree-coloring-constraint-wd5n0p</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/link-leaf-nodes-in-a-binary-tree-4kxa61</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/arrange-people-in-a-queue-based-on-game-results-3p1m1c</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/generate-prime-numbers-7txdo7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/probability-of-picking-a-red-ball-eawdu2</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/construct-matrix-based-on-row-column-conditions-tg9u69</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maze-pathfinding-t80qeo</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/tcs/search-and-sort-in-lists-scoy1f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-orders-placed-between-given-time-intervals-a2vphf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/minimum-number-of-swaps-required-for-arranging-pairs-8zttzu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-longest-common-chain-in-two-integer-lists-jum88f</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-distance-from-a-given-node-in-uni-directed-graph-75g4qu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/kadane-s-algorithm-coding-question-fc5rz7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-maximum-product-of-a-triplet-in-array-dd4mek</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/design-a-stack-that-supports-getmin-in-o-1-time-and-space-t8w13k</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-number-existence-in-window-of-k-numbers-with-min-fwhkt8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-number-of-k-s-with-specific-keyboard-operations-cl3s9x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-array-of-strings-so-anagrams-come-together-zh2m12</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-tree-nodes-in-level-order-with-newlines-tigw35</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-root-index-of-binary-tree-stored-randomly-in-an-array-29oatl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-row-with-most-1s-in-ascending-order-2d-array-41imh7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/check-if-leaf-node-given-linked-leaf-pointers-1dwexr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-tree-from-inorder-and-preorder-traversal-13aot3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/number-of-ways-to-obtain-number-as-sum-of-natural-numbers-iusi7s</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/last-person-remaining-in-a-queue-after-selective-removals-zzb36v</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-longest-interval-formed-by-merging-overlapping-x0yhja</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-boundary-leaves-of-a-binary-tree-3ts05m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-possible-words-from-a-digit-sequence-nk8yov</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sort-an-array-of-zeros-and-ones-dw9bxl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-numbers-with-unique-digits-in-a-range-sh688h</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-in-order-successor-in-a-bst-8pdzmq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/largest-plus-pattern-in-a-binary-matrix-18owsk</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/arrange-positive-and-negative-numbers-alternately-1erv18</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-balanced-parentheses-expressions-yo8tmt</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lru-cache-data-structure-and-pseudo-code-8l0fso</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/update-second-half-of-linked-list-with-sums-kq0e25</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/cartesian-product-of-characters-in-a-2d-array-du52z9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/format-string-to-address-1d7r9r</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pairs-with-sum-equal-to-zero-1vpyc0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/evaluate-ratio-queries-using-graph-7nu7jj</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/count-mountains-and-valleys-from-string-94zubs</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/substrings-starting-and-ending-with-1-oe5fci</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/determine-if-two-trees-are-identical-h5nxb8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/tournament-winner-and-player-rank-edm0ah</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-common-words-in-two-large-files-p4o10x</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/point-of-inflexion-in-infinite-mathematical-graph-zo4gqn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/modified-topological-sort-xiz5h1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/buy-and-sell-stock-with-single-holding-limit-vmee4q</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/stock-span-problem-n9td69</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/zig-zag-tree-traversal-from-array-representation-jk08el</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/create-tree-with-minimum-depth-from-graph-tw0yah</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/lca-and-distance-between-nodes-in-binary-tree-7l7u28</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/swap-alternate-elements-in-linked-list-cm3hub</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pairs-summing-to-a-given-value-7auqqu</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/best-fit-memory-allocation-3f6mdm</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/most-watched-time-interval-in-video-w1cqsl</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-number-in-infinite-stream-of-sorted-numbers-j02gk7</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/hashing-function-for-stream-of-words-r9zcgb</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/unique-character-from-two-strings-tw93k3</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/parenthesis-match-problem-nf6rkc</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-stack-using-queue-zf6i76</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/sorted-squares-of-array-dq3klw</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/wine-selling-profit-vg2jnp</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/max-root-to-leaf-sum-kzr2ul</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/symmetric-numbers-3pxcli</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/cutting-sticks-problem-8vb2ul</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/correct-swapped-bst-p173we</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/non-matching-leaves-91b3nf</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/print-top-500-words-4074y8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-range-of-majority-elements-in-a-non-descending-qwvyx4</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/transform-tree-to-contain-sum-of-child-nodes-plus-itself-rysf8u</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-mirror-tree-of-a-given-binary-tree-yvwx0a</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-minimum-cost-of-joining-n-rods-2ecx5m</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/match-pattern-against-a-dictionary-of-strings-8kineq</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/shortest-friends-path-in-a-social-network-zc5qd8</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/maximum-product-of-three-elements-in-an-array-s073zn</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/delete-all-nodes-with-a-single-child-in-an-unthreaded-bst-84z6e0</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-index-of-largest-number-in-a-rotated-sorted-array-nxyrc9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-median-of-infinite-stream-of-integers-m8bhre</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-all-subsequences-of-a-string-cnu6l1</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/divide-integer-array-into-two-parts-with-equal-sum-fmb7ui</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/coin-picking-game-with-last-coin-losing-condition-grus96</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-mutual-friends-efficiently-vbpj00</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/product-of-two-very-long-numbers-16oeha</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/reverse-every-node-at-even-positions-in-linked-list-x9tfea</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/add-two-large-numbers-handling-negatives-0t939t</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/pop-minimum-element-from-array-in-o-1-ar6mnr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/implement-increment-operator-for-an-array-lq3vn9</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url><url><loc>https://nextraise.ai/interview-questions/amazon/find-the-first-unique-url-in-a-large-file-y1h5sr</loc><lastmod>2026-11-20T09:40:10.626Z</lastmod></url></urlset>