Rahul Mor

Aspiring Software Developer

Najafgarh

Summary

Resourceful team player with experience with common software applications and social media platforms. Well-versed in business organization and strategies for successfully modernizing workplaces. Skilled at project support with proven history of solutions-oriented problem-solving.

Work History

Intern

Maruti Udyog

05.2025 - 07.2025

Supported staff members in their daily tasks, reducing workload burden and allowing for increased focus on higher-priority assignments.
Gained valuable experience working within a specific industry, applying learned concepts directly into relevant work situations.
Analyzed problems and worked with teams to develop solutions.
Contributed to a positive team environment by collaborating with fellow interns on group projects and presentations.

Education

B.Tech -

Netaji Subhas University of Technology (NSUT)

04.2001 -

Skills

Programming: Java (From university of helsinki)

Core Concepts: Data Structures and Algorithms, Object-Oriented Programming (Through The Princeton Algorithms and Data Structures (DSA) under Robert Sedgewick and Kevin Wayne)

Web Development: HTML, CSS, JAVASCRIPT(From ODIN PROJECT)

Coding Practice

LeetCode – Solved 180+ algorithmic problems focusing on Sliding Window, Hashing, Two Pointers, and String algorithms.

Princeton Autograder: Here’s a concise version with my project names and what i implemented:

Percolation – Implemented a percolation system using the union-find data structure to determine connectivity in a grid and check when the system percolates.
Deques and Randomized Queues – Built a double-ended queue and a randomized queue from scratch, supporting efficient insertion, deletion, and random removal operations.
Collinear Points – Developed algorithms to identify sets of collinear points in a 2D plane using sorting and slope comparison techniques.
8 Puzzle (Slider Puzzle) – Implemented a solver using the A* search algorithm to find the shortest sequence of moves to reach the goal state.
Kd-Trees – Designed a 2D-tree structure to efficiently perform range searches and nearest neighbor queries in a set of points.

Current Learning

Currently studying full-stack web development through The Odin Project.