I have 3.5 yrs of experience as backend developer. I am good at Problem solving, Data Structure & Algorithms and always keen to learn new technology to help myself and company`s growth. To test myself i usually participate in different online coding competitions and secured 1st rank also in some. I did my graduation from Delhi Technological University(formerly D.C.E) in 2015 in Electronics and Communication. D.T.U is tier 1 college in India Experience and Technology used: Fidelity International (2yrs) it`s a brokerage firm(banking domain). I worked there for 2 yrs as Backend developer in the project End-Invester. The technology used were Java, Spring framework, Sql database, Javascript, Jquery. I was part of presentation team which works as aggregator for different clients. In this we have 13 to 20 business as well as third party services which we integrate and expose their result as Rest services to clients(web,andriod,ios). We followed SOA there. G4S India pvt ltd(1.5 yrs). I Joined G4s in 2018 as Senior System Developer, it`s a Security based firm which has 6-7lakh employee as security personnel which includes guards, engineers, fireman etc. I was working in house product called Javelin through which HR ops can do scheduling of guards, creation of contract for customers, check their payroll as well as can generate future scheduling. We were trying to solve Roster problem i was part of scheduling team which was core team. As we have large amount of data we have used Nosql(mongodb) as well as sql databases. Technology used were Spring boot, redis for cache, mongoDB, sql, Google pub-sub, Google queue, Google cloud for hosting services, Oauth2. Here we have followed Micro Service Architecture. There was one more business line Petrol N Response. In which we have to solve MVRP(multiple vehicle routing problem). We were using Google beta api for this called Dispatcher API. I single handedly integrated their services which uses python. Also while using we have to give changes in API that Google needs to accommodate. Simultaneously we were working to change this problem to TSP(Travelling Salesman Problem) with limited nodes(max 25) so that we can use open source to solve this. I have put constraints in existing problem to convert in TSP and used Google- OR-tools also. ©