LeetCode Experience

#1657 Determine if Two Strings Are Close

SWE coding Medium

Interview Experience

LeetCode #1657: Determine if Two Strings Are Close. Difficulty: Medium. Topics: Hash Table, String, Sorting, Counting. Asked at Bloomberg in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Counting Hash Table Sorting Strings

More from Bloomberg

Reddit What would you grind for Bloomberg? Reddit Bloomberg Tokyo Software Engineer Rejection after Five Rounds Reddit Bloomberg, senior C++ role – what to expect? 1p3a Bloomberg Fulltime SDE Interview Experience and Coding Challenges 1p3a Bloomberg SSE Bquant SF Interview Experience and Reject

← All Bloomberg questions Bloomberg Software Engineer Questions → All Hash Table,Strings,Sorting,Counting Questions →