1. How would you approach fixing a specific bug in a given codebase?
2. Anagram Pairs Verification Problem Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the other string. Input: The input consists of a single line with two space-separated strings, Str1 and Str2. Output: Print True if the two strings are anagrams, and False otherwise. Example: Input: str1 = "spar", str2 = "rasp" Output: True Constraints: The strings will not contain spaces, except to separate one from the other. Both strings consist of lowercase characters. 1 ≤ N ≤ 105 where N is the length of Str1. 1 ≤ M ≤ 105 where M is the length of Str2. Time Limit: 1 second Note: The solution must be complete, ensuring all test cases pass to receive full marks.
3. Describe a difficult project you executed.
4. Tell me about a process improvement initiative.
5. Describe how you would design a tracking ID system.