โ† PubMatic questions

Anagram check, reverse word order and build a BST on paper

Filed under PubMatic

The question

Write on paper: check for anagrams, reverse a string without reversing words ('I am good' to 'good am I'), and build a binary search tree.

No write-up yet. Related questions below have one.

Related PubMatic questions

Collected from public candidate posts and coding forums. Updated Nov 2026.