Principal Software Developer

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

Let's delve into your professional background. I'm interested in understanding the scope and impact of your previous experiences and projects. To begin, walk me through your resume, highlighting the roles and projects that you believe best showcase your skills and abilities relevant to this position. For each experience, please elaborate on the following aspects: Your responsibilities: What were your primary duties and tasks in each role? Technical skills utilized: Which programming languages, tools, and technologies did you employ? Project outcomes: What were the results or deliverables of your projects? Did you achieve specific goals or metrics? Challenges and solutions: Describe any significant challenges you faced and how you overcame them. What innovative solutions did you implement? Teamwork and collaboration: How did you collaborate with your team members and stakeholders to achieve project objectives? Furthermore, I'd like to hear about any personal projects or open-source contributions that demonstrate your passion for software development. Please provide specific examples that illustrate your problem-solving skills, coding proficiency, and commitment to continuous learning. Finally, are there any gaps in your resume that require further clarification? I want to get a thorough understanding of your professional journey and how it has prepared you for this opportunity.