Philip Rodriguez

Senior Software Engineer at Google

Durham, North Carolina, United States
email-iconphone-icongithub-logolinkedin-logotwitter-logostackoverflow-logofacebook-logo
Join Prog.AI to see contacts
email-iconphone-icongithub-logolinkedin-logotwitter-logostackoverflow-logofacebook-logo
Join Prog.AI to see contacts

Summary

👤
Senior
🎓
Top School
Philip Rodriguez is a Senior Software Engineer with a decade of experience building trusted, large-scale products at Google, currently focused on reward modeling and AutoEval for Google Meet GenAI features after leadership roles in Assistant trust & safety and kids & families. Grounded in a strong algorithms and systems background from the University of Central Florida and competitive programming, he blends rigorous problem-solving with practical team leadership as a former tech lead and teaching assistant. Philip has a track record of shipping safety-critical features and mentoring cross-functional teams in production environments. Based in Durham, NC, he thrives on crafting efficient, elegant algorithms and continually seeks opportunities to learn and apply new skills to real-world problems.
code10 years of coding experience
job3 years of employment as a software developer
bookHigh School, High School at Crooms Academy of Information Technology
bookInformation Technology and Computer Science, Information Technology and Computer Science at Seminole State College of Florida
bookBachelor’s Degree Computer Science, Bachelor’s Degree Computer Science at University of Central Florida
languagesSpanish, English
stackoverflow-logo

Stackoverflow

Stats
63reputation
8kreached
0answers
2questions
github-logo-circle

Github Skills (11)

overflow6
nio6
cin6
filesystem6
filesystemwatcher6
java6
heap4
disk4
binary-tree4
data-structures3
in-memory3

Programming languages (2)

JavaJavaScript

Github contributions (5)

github-logo-circle
amasadpanda/Chess

Mar 2018 - Apr 2018

Contributions:128 commits, 4 pushes in 1 month
This repository contains DiskBinaryTree* implementations. These are binary-tree-based data structures which do not store themselves on the heap or in memory. Instead, these structures store themselves directly in a file on disk. This allows for drop-in replacement of Java's similar data structures but with "no limits" on how large they can grow since they are represented on disk (yes, they are technically limited in size by how large your disk is).
Contributions:1 PR, 12 pushes, 1 branch in 10 months
limitsimplementationsmemorydrop-insimilar
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.
Request Free Trial
Philip Rodriguez - Senior Software Engineer at Google