SDE - 1

Design a system to schedule and return news articles based on their publish time.
Each article has an ID, title, and a scheduled publish timestamp.

Requirements:

Add articles with their scheduled time.

Retrieve all articles that should be published up to the current time.

Remove published articles.

Ninja has been given a program to do basic string compression. For a character that is consecutively repeated more than once, he needs to replace the consecutive duplicate occurrences with the count of repetitions.

Example:

If a string has 'x' repeated 5 times, replace this "xxxxx" with "x5".

The string is compressed only when the repeated character count is more than 1.

Note :

The consecutive count of every character in the input string is less than or equal to 9.

Mr. X. is a professional robber planning to rob houses along a street. Each house has a certain amount of money hidden.

Meanwhile, adjacent houses have a security system connected, and it will automatically contact the police if two neighboring houses were broken into the same night.

You are given an array/list of non-negative integers 'A' representing the amount of money hidden at each house. Your task is to return the maximum amount of money Mr. X can rob tonight without alerting the police.

Example:

Input: [1,2,3,1]

Output: 4

Mr. X. can rob the first house and the third house, total money = 1 + 3.
Hence, the total money robbed by Mr. X. is 4.

• "How do you handle disagreements with team members during code reviews?"
• "Tell me about a time you helped a teammate who was struggling with a technical problem." Best Approach: Focus on communication and positive outcomes.
• "How do you prioritize tasks when handling multiple features/bugs?"
• "Describe a situation where you had to meet a tight deadline." Best Approach: Emphasize organizational skills and methodology.