Contribute OA Coins
NewOA CalendarViewOA GroupsJoin
OAHelperbyNxtWave

Company Questions

OA StorePricingDiwali
Log inStart free
P

Paytm

14 Questions4 Oct 2025Online Assessment
On CampusOff CampusSDE

Overall progress

0 / 14solved

0%
01
Matrix Summation
CodingSolve
02
Customers and Products With No Recorded Sale
SQLPremium
03
Minimum Swaps to Convert One Permutation into Another
MCQPremium
04
Top and Bottom of the Stack Before the Second Multiplication in a Postfix Scan
MCQPremium
05
Postorder Traversal Reconstructed from Inorder and Preorder
MCQPremium
06
Critical Minimum Spanning Tree Edges in a Six-Node Weighted Graph
MCQPremium
07
Peak Size of a Stack Under a Fixed Push and Pop Sequence
MCQPremium
08
Maximum Operator Stack Depth Converting an Infix Expression to Postfix
MCQPremium
09
Inorder Traversal of a Nine-Node Binary Tree
MCQPremium
10
Valid Depth-First Search Visit Order from Node Zero
MCQPremium
11
Goals Scored by Countries
SQLPremium
12
Visiting Cities
CodingPremium
13
Modify the String
CodingPremium
14
Customer Transaction Transcripts
SQLPremium

Summarise with AI

  • ChatGPT
  • Claude
  • Perplexity
  • Grok
  • Google AI Mode
Your next OA is closer than you think.Real questions from this season's OAs
ProductCompany OAsAll ProblemsOA CalendarMock OAsDSA RoadmapSQL RoadmapAgent Engineering
ResourcesInterview experiencesTopicsOA GroupsContributeCompany InsightsOA StorePremiumFor Colleges
OA Helper, powered by NxtWave
TermsPrivacyRefundsTrust & SafetyContact© 2026 OA Helper

Disclaimer: OAHelper is an independent educational platform. We (oahelper.in) do not own the images or questions shown. Content is uploaded by users.