Skip to main content

Entire work summary GSOC 2021 coding period || final wrap up blog

 Entire work summary GSOC 2021 coding period -

Hey, reader Welcome to my blog.  In this blog post, I am going to share my entire work during GSOC 2021 coding period. take a cup of coffee and enjoy this blog post. 

The coding period for GSoC 2021 started in June month. I was very excited about the coding period. I was part of Improve LibreHealth Toolkit Cost of Care Explorer Project. The goal of this project is to improve the existing flutter application and web application.  Robby O'Connor and Mua Rachmann  
mentoring me in this project. 

Task Done during GSOC 2021 coding period - 
1- migrated flutter application to null safety 
As soon as the coding period has begun I choose to improve the cost of care flutter application. 
Since this flutter application was not migrated to null safety I migrated it to null safety.
link of work -

2- added bookmark feature 
I added a bookmark feature by using this feature we can bookmark a hospital and check its 
chargemaster faster. this feature combined with MR 89.

Unit testing plays important role in any product development. Unit testing for inpatient and outpatient procedures was unimplemented. I wrote test files for inpatient and outpatient procedures. 

added search bar to compare hospitals for a smooth comparison experience.

Added search by address to chargemaster /CDM.

After this, I started working on cost of care web application and helped to improve user experience.

In the web application, I added the Nearby hospital feature using overpass API. I added the list of all nearby hospitals within the 15km range and added a search by address and name filter to it.

7- Compare hospitals rating - I added a new unimplemented compare US hospitals feature with a star rating. for that, I convert the excel file to JSON and added all necessary comparison parameters.

8- last but not least I wrote unit Testing for react app using jest. Unit testing ensures that all code meets quality standards before it's deployed.

I am very happy that I am part of GSOC 2021. During the coding period, I faced many challenges and blockers and with the help of mentors, I fixed them. I gain priceless knowledge from GSOC 2021. Though this is the end of GSoC 2021 but not the end of my open source journey.

Thank you 



Post a Comment

Popular posts from this blog

Vaccine Distribution Codechef December Long challenge solution 2020

 Vaccine Distribution  Codechef December Long challenge solution 2020- This Problem vaccine distribution is taken from December long challenge 2020. lets read problem statement. Problem statement- Finally, a COVID vaccine is out on the market and the Chefland government has asked you to form a plan to distribute it to the public as soon as possible. There are a total of  N N  people with ages  a 1 , a 2 , … , a N a 1 , a 2 , … , a N . There is only one hospital where vaccination is done and it is only possible to vaccinate up to  D D  people per day. Anyone whose age is  ≥ 80 ≥ 80  or  ≤ 9 ≤ 9  is considered to be  at risk . On each day, you may not vaccinate both a person who is at risk and a person who is not at risk. Find the smallest number of days needed to vaccinate everyone. Input The first line of the input contains a single integer  T T  denoting the number of test cases. The description of  T T  test cases follows. The first line of each test case contains two space-separ

Codechef February long challenge solution 2021

   Codechef February  long challenge solution 2021- Hey guys Welcome Again, A small update CodeChef February  long challenge solution 2021 starting from 1st week of beb  2021 . Codechef long challenge is one of the popular contests of CodeChef you should participate in codechef Feb  long challenge.This is first contest of codechef in 2021 so good luck. And wish you happy new year. Contest link- I will post the solution after Contest.Stay tuned. About CodeChef  February  long challenge solution 2021: CodeChef Long Challenge is a 10-day monthly coding contest where you can show off your computer programming skills. The significance being - it gives you enough time to think about a problem, try different ways of attacking the problem, read the concepts etc. If you’re usually slow at solving problems and have ample time at hand, this is ideal for you. We also put in a lot of efforts in getting quality problems, w

Merge Two sorted array Without Extra Space

Problem statement-  Given two sorted arrays arr1[] and arr2[] of sizes N and M in non-decreasing order. Merge them in sorted order without using any extra space. Modify arr1 so that it contains the first N elements and modify arr2 so that it contains the last M elements.    Example 1: Input:  N = 4, arr1[] = [1 3 5 7]  M = 5, arr2[] = [0 2 6 8 9] Output:  arr1[] = [0 1 2 3] arr2[] = [5 6 7 8 9] Explanation: After merging the two  non-decreasing arrays, we get,  0 1 2 3 5 6 7 8 9.   Example 2: Input:  N = 2, arr1[] = [10, 12]  M = 3, arr2[] = [5 18 20] Output:  arr1[] = [5 10] arr2[] = [12 18 20] Explanation: After merging two sorted arrays  we get 5 10 12 18 20. Your Task: You don't need to read input or print anything. You only need to complete the function merge() that takes arr1, arr2, N and M as input parameters and modifies them in-place so that they look like the sorted merged array when concatenated. Expected Time Complexity:  O((n+m) log(n+m)) Expected Auxilliary Space: O(1