I’m a Master’s student in Computer Science at the University of Massachusetts Amherst, specializing in Computer Vision and Natural Language Processing. I focus on enhancing image captioning, visual question answering (VQA), and text-to-image generation using deep learning. I’m seeking Fall 2024 internships, co-op opportunities, and full-time roles starting in 2025.
With over four years of software development experience in healthcare and fintech, including roles at PayPal and Philips, I excel in C++, Java, Python, and JavaScript, with a preference for Python and C++. Outside of work, I’m passionate about photography and trail running, having participated in several marathons and ultra events.
I’m open to connecting with professionals and recruiters who value collaboration. Reach out to me at rahulsaxena@umass.edu or connect on LinkedIn.
• Freelance projects in software development and AI. • FTE positions starting in 2025 • Collaborations in Computer Vision & NLP Research.
Dec 28, 2022 · 2 min read · Asked in: Facebook, Amazon. Table: Calls +-------------+---------+ | Column Name | Type | +-------------+---------+ | from_id | int | | to_id | int | | duration | int | +-------------+---------+ This table does not have a ...
Join discussionJun 25, 2022 · 2 min read · Question: Given the head of a singly linked list, return true if it is a palindrome. Example 1: Input: head = [1,2,2,1] Output: true Example 2: Input: head = [1,2] Output: false Constraints: The number of nodes in the list is in the range [1, 105]. 0...
Join discussionJun 25, 2022 · 3 min read · Question: Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level). Example 1: Input: root = [3,9,20,null,null,15,7] Output: [[3],[9,20],[15,7]] Example 2: Input: root = [1] O...
Join discussionJun 19, 2022 · 2 min read · Question: Write an algorithm to determine if a number n is happy. A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits. Repeat the process until th...
Join discussionJun 19, 2022 · 1 min read · It's a pointer algorithm that involves two pointers that move through the Array or LinkedList at different speeds. It's also known as Hare and Tortoise algorithm. The algorithm proves that the two pointers are bound to meet in case there is a cycle i...
Join discussion