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 






 
 

Comments

Post a Comment

Popular posts from this blog

codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster

 Codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster- Codeforces is one of the most popular platforms for competitive programmers and  codeforces rating matters a lot  .  Competitive Programming  teaches you to find the easiest solution in the quickest possible way. CP enhances your problem-solving and debugging skills giving you real-time fun. It's brain-sport. As you start solving harder and harder problems in live-contests your analytical and rational thinking intensifies. To have a good codeforces profile makes a good impression on the interviewer. If you have a good  codeforces profile so it is very easy to get a referral for product base company like amazon, google , facebook etc.So in this blog I have explained everything about codeforces rating system. What are different titles on codeforces- based on rating codeforces divide rating into 10 part. Newbie Pupil Specialist Expert Candidate Codemaster Master International Master Grandmaster Internat

Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code

 Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code - Apple Division CSES Problem Solution Easy Explanation. Apple division is problem is taken form cses introductory problem set.Let's Read Problem statement first. Problem Statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  apples with known weights. Your task is to divide the apples into two groups so that the difference between the weights of the groups is minimal. Input The first input line has an integer  n n : the number of apples. The next line has  n n  integers  p 1 , p 2 , … , p n p 1 , p 2 , … , p n : the weight of each apple. Output Print one integer: the minimum difference between the weights of the groups. Constraints 1 ≤ n ≤ 20 1 ≤ n ≤ 20 1 ≤ p i ≤ 10 9 1 ≤ p i ≤ 10 9 Example Input: 5 3 2 7 4 1 Output: 1 Explanation: Group 1 has weights 2, 3 and 4 (total weight 9), and group 2 has weights 1 and 7 (total weight 8). Join Telegram channel for code discussi

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