JobsJob TrackerJob alerts

IndiaMart ยท 10 questions

All 10Coding 8
  • Valid Anagram and Array ManipulationCoding
  • ArrayList vs LinkedList and Binary SearchCoding
  • BST, HashMap, and RecursionCoding
  • Shortest Path and Dynamic ProgrammingCoding
  • Factorial using recursionCoding
  • RDBMS concepts and rules
  • OSI Model and Networking
  • Remove duplicates letters from stringCoding
  • Prim's Algorithm Based Graph ProblemCoding
  • String and Linked List MethodsCoding
โ† IndiaMart questions
  1. Interview questions
  2. IndiaMart
  3. BST, HashMap, and Recursion
CodingMedium

BST, HashMap, and Recursion

Filed under IndiaMart

The question

Implement a binary search tree and in-order traversal, explain how HashMap works internally with time complexities, generate string permutations using recursion, and discuss Java exceptions.

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

Related IndiaMart questions

  • Valid Anagram and Array Manipulation
  • ArrayList vs LinkedList and Binary Search
  • Shortest Path and Dynamic Programming
  • Remove duplicates letters from string
  • Prim's Algorithm Based Graph Problem
โ† ArrayList vs LinkedList and Binary SearchShortest Path and Dynamic Programming โ†’

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