Global Critical Engagement Manager

Oracle

Given an undirected graph, determine whether a Hamiltonian path exists. A Hamiltonian path is a path in an undirected or directed graph that visits each vertex exactly once. If a Hamiltonian path exists, return true; otherwise, return false. For example, consider the following graph represented by an adjacency list: { 0: [1, 2], 1: [0, 2, 3], 2: [0, 1, 4], 3: [1, 4], 4: [2, 3] } A Hamiltonian path in this graph is [0, 1, 2, 4, 3]. Therefore, your function should return true. Now consider the following graph: { 0: [1, 2], 1: [0, 2], 2: [0, 1] } It is not possible to visit all vertices exactly once in a path. Therefore, your function should return false. Your task is to implement a function that takes the number of vertices n and the adjacency list representation of the graph graph as input and returns a boolean value indicating whether a Hamiltonian path exists in the graph. The graph will contain n vertices labeled from 0 to n-1. Constraints: 1 <= n <= 10 The graph is undirected. There are no self-loops. There are no duplicate edges.

Oracle

Let's design a URL shortening service like bit.ly. Consider the following: Functional Requirements: The service should accept a long URL and generate a unique short URL. Users should be able to access the original URL by visiting the shortened URL. The service should track click statistics for each shortened URL. Non-Functional Requirements: The service should be highly available and scalable to handle a large number of URL shortening and redirection requests. Shortened URLs should be generated quickly. The system should be fault-tolerant. Considerations: How would you handle URL collisions (when the same short URL is generated for different long URLs)? How would you design the data storage? How would you optimize the system for read-heavy traffic (redirections)? How would you implement analytics and track clicks? Explain the architectural components, data model, algorithms, and scaling strategies you would use to build such a system. Provide specific examples for URL encoding and decoding. For example, how would you encode https://www.example.com/very/long/url/path into something like bit.ly/xyz123?

Oracle

Describe a time you had to work with a difficult person. What was the situation?** For example, were you working on a team project with a classmate who wasn't pulling their weight? Or perhaps you had a colleague who was constantly negative and bringing down the morale of the team? Who was the difficult person, and what made them difficult?** Was it a personality clash? Did they have different work styles? Were they simply uncooperative or unwilling to compromise? Be specific about their behaviors and how they impacted you and the team. What actions did you take to address the situation?** Did you try to communicate with the person directly? Did you involve a supervisor or mediator? Did you try to find common ground or compromise on solutions? What was the outcome?** Were you able to resolve the conflict and improve the working relationship? If not, what were the consequences? What did you learn from the experience, and how would you handle a similar situation differently in the future?