Hello, here you will find information about my education, work experience and projects. I am a Software Engineer with 4 years of experience, focused on performance, reliability, and maintainability. Winner of the Parallel Programming Marathon, I bring a strong foundation in algorithms, data structures, concurrency, and metric-driven optimization. At Globo, I applied these principles to backend APIs supporting the recommendation ecosystem. At FUJB, I redesigned a system workflow, removing a third-party dependency and reducing operational costs by R$2,000/month. My background as a teaching assistant and programming instructor reinforces disciplined problem-solving, precise solution design. In agile environments,I actively contribute to technical and architectural decisions, bringing relevant insights, learning from technical discussions and, delivering consistent solutions. I enjoy the process of conceiving, designing, and implementing software end-to-end, combining hands-on engineering with a deliberate study of core computer-science foundations. This allows me to deliver solutions that are pragmatic in production while remaining grounded in strong algorithmic thinking.
Designed and implemented backend APIs with a focus on performance, reliability, and maintainability.
Contributed to architectural decisions, applied algorithmic thinking to production systems, and worked
with Java, Spring Boot, and Quarkus in a large-scale recommendation ecosystem, working with Java, Spring Boot,
Quarkus, and MongoDB.
Peer Feedback:
Recognized by Tech Lead for "impressive evolution" and the ability to "investigate problems with depth and present well-founded answers". Praised by Product Manager for "natural leadership" and "technical autonomy" within two years of team contribution.
As a Volunteer Professor for the “Programação 0” course at UERJ, I planned, organized, and delivered classes for freshmen with initial programming difficulties, structuring content in an accessible and needs-driven manner; I taught and reinforced core concepts of logic and software development—including algorithms, modularization, control flow, and fundamental problem-solving principles—while providing individualized support and close monitoring to identify knowledge gaps, deliver targeted explanations, and strengthen the logical foundation required for progression in programming courses. Using Python programming language
At Fundação Universitária José Bonifácio(FUJB), I worked as a Full-Stack Software Development Intern, designing and delivering end-to-end software modules—from requirements and architecture to implementation and testing—using C#, HTML, and CSS; I systematically refactored legacy components with an architecture-first approach to improve long-term maintainability, designed and implemented the “Portal de Comprovante de Rendimento (Informe de Rendimento)” system, and architected and deployed an internal replacement for a third-party solution, eliminating an external dependency and achieving a recurring cost reduction of approximately R$2,000 per month. working with: C#, ASP.NET, and SQL.
Teaching assistant Rio de Janeiro State University(UERJ)I provided hands-on technical guidance through code reviews and structured feedback, explained fundamental programming concepts using live examples, and strengthened my ability to analyze, evaluate, and debug solution approaches, consistently reinforcing good coding practices, algorithmic reasoning, pattern recognition, and critical problem-solving. Using C programming language.
During my graduation, I deliberately focused on mastering algorithms and the core disciplines
that support the design, implementation, and long-term maintenance of high-quality software projects.
I prioritized subjects that strengthened my algorithmic thinking, system decomposition, and analytical
rigor, using them as a foundation to build software that is not only functional, but scalable,
maintainable, and resilient to change. Disciplines that stand out:
Algorithms and Data Structures I and II;
Programming Languages I and II;
Graph Algorithms;
Linear Algebra;
Software Engineering;
Algorithm Development and Implementation (elective);
Language Structures (introduction to language design);
Special Topics in Applied Mathematics I (numerical methods);
Advanced Topics in Programming Languages (elective).
The discipline covered systematic program development techniques, algorithm efficiency analysis, recursive algorithms, and core data structure fundamentals, with practical applications in search (linear and binary) and sorting algorithms, targeting students seeking a deeper theoretical and practical foundation in algorithms and advanced programming techniques.
This self-paced course provided a structured progression through core Java programming concepts across five lessons, covering object-oriented programming fundamentals, control flow, recursion, and the design, compilation, and execution of Java applications, with an introduction to Android development; learning was reinforced through questionnaires, practical exercises, and a comprehensive final exam, allowing flexible pacing while ensuring mastery of both theoretical foundations and applied programming skills.
A lightweight Remote Procedure Call library designed for clean abstraction between distributed processes, facilitating rapid prototyping - In this project I demonstrate technical depth, release discipline, and systems-level thinking necessary to carry out Software Engineer projects, totaly functional - using Python.
A naive implementation of an Peer2Peer BitTorrent, running in local network - Using Java You can exchange totally functional, you can exchange files with it in your LAN.
Vector graphics editor, using Java2D. Allows you to create, edit, and manipulate images based on simple geometric shapes. Made in pure Java without any third-party libraries.
This repository documents the coursework and exercises developed throughout the “Tópicos de Programação”, with strong emphasis on algorithmic rigor and theoretical foundations. It covers algorithm complexity, finiteness and correctness proofs, recursion and recurrence solving, fundamental data structures, classic search and sorting algorithms, graph theory and graph algorithms. The repository aggregates lecture materials, mathematical proofs, evaluated assessments, practical implementations, and exercises written in C. What stands out in this Repo is a text where I conduct my first regourous finitude and correctness analysis, of Selection-sort and Buble-Sort Algorithms - look at this link: Finitude, Corretude & Complexidade de Algoritmos - Oseas Andre. And the experiments where I check imppiricaly the runtime complexity, look at this link: finitude-corretude&complexidade-de-algoritimos-experimentos. Here I was preparing my self for advanced studies in Computer Science.