JobsJob TrackerJob alerts

Wize Commerce · 11 questions

All 11Coding 10
  • Chessboard queen probability puzzle
  • Design O(1) insert, delete, and get randomCoding
  • Sum two linked lists without modifying inputs or extra spaceCoding
  • Efficient prime number checkCoding
  • Reverse singly linked list using 2 pointersCoding
  • Find prime numbers satisfying equationCoding
  • Efficient left circular shift on stringCoding
  • Largest distance between two nodes in a treeCoding
  • Lowest Common Ancestor in a treeCoding
  • Largest common subset between two arraysCoding
  • Minimum swaps to make two strings equalCoding
← Wize Commerce questions
  1. Interview questions
  2. Wize Commerce
  3. Minimum swaps to make two strings equal
CodingHard

Minimum swaps to make two strings equal

Filed under Wize Commerce

The question

Given two strings containing characters of the same superset, find the minimum number of swaps to make the two strings equal using operations like swapping adjacent characters or swapping the first and last characters on either string.

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

Related Wize Commerce questions

  • Design O(1) insert, delete, and get random
  • Sum two linked lists without modifying inputs or extra space
  • Efficient prime number check
  • Reverse singly linked list using 2 pointers
  • Find prime numbers satisfying equation
← Largest common subset between two arrays

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