An open API service indexing awesome lists of open source software.

https://github.com/jshinm/project-binder

List of projects and research portfolios
https://github.com/jshinm/project-binder

algorithms-and-data-structures project research sql

Last synced: about 1 year ago
JSON representation

List of projects and research portfolios

Awesome Lists containing this project

README

          

![](https://komarev.com/ghpvc/?username=jshinm&label=Page%20viewed)

# Introduction
These are the collections of `research projects` and `software portfolios` that are categorized based on the topics relevant in the field of artificial intelligence and machine learning. Also included are `coding exercises` that demonstrates algorithmic problem solving skills.

# Table of Contents
- [About Me](#About-Me)
- [Mostly Used Languages](#Mostly-used-languages)
- AI/ML Research Projects
- [Extrapolative behavior of ML models](#Extrapolative-behavior-of-ML-models)
- The project demonstrates comparative difference of extrapolative behavior between various ML models and reports quantitative/qualitative measures of performance against that of human on simple non-linear simulation datasets.
-








- [Automated end-to-end causal inference application](#Automated-end-to-end-causal-inference-application)
- The project aims to bring exploratory data analytics and causal inference to generic users who are not familiar with data science particularly with the concept of in-dept machine learning models and intricacy of causal inference.
-







- [Human extrapolative behavioral experiment via web application](#Human-extrapolative-behavioral-experiment-via-web-application)
- The human part of the extrapolation project to take comparative measures on investigating human like behaviors from various ML algorithms such as random forest and deep neural networks. In order to deliver the behavioral experiments to 150 participants recruited on AWS, the web app was created and hosted on heroku.
-










- [Probabilistic linkage of real-world clinical data](#Probabilistic-linkage-of-real-world-clinical-data)
- In order to link multiple datasets acquired from different sections of the JHU medicine network, this data management pipeline was built in support of collective mission of CDEM. The pipeline uses `fastlink` R package to automate probablistic linkage of multiple datasets which bases on expectation-maximaztion algorithm.
-







- [Multivariate time-series hologram biometric signal parsing](#Multivariate-time-series-hologram-biometric-signal-parsing)
- The real-world data most often involves significant noise that perturbs extraction of the signal of interest. This project aims to parse out biometric signals from multivaraite time-series hologram data where EEG read out coninsides with other physiological responses such as heart beat.
-








- Coding
- [Algorithm & Data Structure](#Algorithm--Data-Structure)
- [Sorting](#Sorting)
- [SQL](#SQL)
- [Bash & Shell](#Bash--Shell)

# About Me
[Add contents here]

# Mostly Used Languages
[![Top Langs](https://github-readme-stats.vercel.app/api/top-langs/?username=jshinm&hide=jupyter%20notebook)](https://github.com/jshinm)

# AI/ML Research Projects
The projects that involve machine learning and artificial intelligence are listed here.


  1. ## Extrapolative behavior of ML models


  2. Github Repo: https://github.com/jshinm/inductive-bias-experiment

    One of the purposes of machine learning models is a prediction of trend based on the patterns of given data. The issue is that these ML models are interpolative by nature and does not perform well as extrapolators. Despite that, ML models are widely used for forecasting uncharted territory. This project tests examines extrapolative behaviors of the ML algorithms such as `random forest`, `neural networks`, `support vector machines` and measure performance against humans.

    These ML algorithms are trained on non-linear simulation datasets (gaussian XOR shown above) and their posterior probability distributions are drawn out in a form of a grid for comparison. The line plot is indicative of increasing Hellinger distance for `neural nets` posteriors more so than both `random forest` and `humans` as we move further away from the origin, which suggests that the latter algorithm is more similar to the former algorithm in this experiment.

    As these non-linear datasets are not space-invariant, we can assess the posterior in a piece-wise manner. The linear evaluation with a function of angle reveals more drastic difference between `neural nets` and `random forest` where the former algorithm reaches the limit of posterior much faster than that of the latter indicating that `neural nets` is not only misrepresentative of spiral simulation estimation but it is also more confident in its decision.

  3. ## Automated end-to-end causal inference application

  4. Github Repo: --

    < content here >

  5. ## Human extrapolative behavioral experiment via web application

  6. Github Repo: https://github.com/jshinm/deepnet-behavioral

    < content here >

  7. ## Probabilistic linkage of real-world clinical data

  8. Github Repo: https://github.com/jshinm/probabilistic-linkage

    < content here >

  9. ## Multivariate time-series hologram biometric signal parsing

  10. Github Repo: https://github.com/jshinm/hologram-biometric-signal-parsing

    < content here >

# Software Development
Current and past software projects.

|Project|Description|Code|
|----|----|----|
|WebApp for machine versus human extrapolation experiment|Desc1|Code1|
|Web Scrapper for data mining on GitHub repository|Desc2|Code2|
|P&L generator for tax report|Desc2|Code2|
|Pandarize|Desc2|Code2|
|Amortized loan simulator|Desc2|Code2|
|Omega Messenger|Desc2|Code2|
|FlipScope|Desc2|Code2|
|KeeWee|Desc2|Code2|

# Kaggle Projects
Some data science side projects for Kaggle challenges

|Project|Code|
|----|----|
|Item1|Code1|
|Item2|Code2|

# Coding
The following is the programming exercise that covers various `algorithms` and `data structures`. There is a dedicated section for `sorting`. Also contains is `sql` and `bash/shell` coding challenges.

### Algorithm & Data Structure
|Problem Name|Platform|Note
|----|----|----|
|[Two Sum](https://github.com/jshinm/coding_practice/blob/master/leetcode/20210812_leetcode_twosum.py)|[LeetCode](https://leetcode.com/problems/two-sum/)|Blind 75 Qs
|[Two Sum II - Input Array Is Sorted](https://github.com/jshinm/coding_practice/blob/master/leetcode/20210814_leetcode_sorted-twosum.py)|[LeetCode](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted)||
|[Two Sum IV - Input is a BST](https://github.com/jshinm/coding_practice/blob/master/leetcode/20210819_leetcode_twosum-BST.py)|[LeetCode](https://leetcode.com/problems/two-sum-iv-input-is-a-bst)||
|[Reverse Integer](https://github.com/jshinm/coding_practice/blob/master/leetcode/20210818_leetcode_reverse-integer.py)|[LeetCode](https://leetcode.com/problems/reverse-integer)||
|[Palindrome Number](https://github.com/jshinm/coding_practice/blob/master/leetcode/20210821_leetcode_palindrome_check.py)|[LeetCode](https://leetcode.com/problems/palindrome-number/)||
|[Roman to Integer](https://github.com/jshinm/coding_practice/blob/master/leetcode/20210822_leetcode_roman2number.py)|[LeetCode](https://leetcode.com/problems/roman-to-integer/)||
|[Longest Common Prefix](https://github.com/jshinm/coding_practice/blob/master/leetcode/20210824_leetcode_longest-prefix.py)|[LeetCode](https://leetcode.com/problems/longest-common-prefix/)||
|[Longest Substring Without Repeating Characters](https://github.com/jshinm/coding_practice/blob/master/leetcode/20210827_leetcode_longest-substring.py)|[LeetCode](https://leetcode.com/problems/longest-substring-without-repeating-characters/)|Blind 75 Qs|
|[Container With Most Water](https://github.com/jshinm/coding_practice/blob/master/leetcode/20210910_leetcode_container-with-most-water.py)|[LeetCode](https://leetcode.com/problems/container-with-most-water/)|Blind 75 Qs|
|[Three Sum](https://github.com/jshinm/coding_practice/blob/master/leetcode/20210911_leetcode_three_sum.py)|[LeetCode](https://leetcode.com/problems/3sum)|Blind 75 Qs|
|[Remove Nth Node From End of List](https://github.com/jshinm/coding_practice/blob/master/leetcode/20210913_leetcode_remove_nth_node.py)|[LeetCode](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)|Blind 75 Qs|
|[Valid Parentheses](https://github.com/jshinm/coding_practice/blob/master/leetcode/20210916_leetcode_valid_parentheses.py)|[LeetCode](https://leetcode.com/problems/valid-parentheses)|Blind 75 Qs|
|[Merge Two Sorted Lists](https://github.com/jshinm/coding_practice/blob/master/leetcode/20210918_leetcode_merge_two_sorted_lists.py)|[LeetCode](https://leetcode.com/problems/merge-two-sorted-lists)|Blind 75 Qs|
|[Merge k Sorted Lists](https://github.com/jshinm/coding_practice/blob/master/leetcode/20210918_leetcode_merge_N_sorted_lists.py)|[LeetCode](https://leetcode.com/problems/merge-k-sorted-lists/)|Blind 75 Qs, only TLE Solution|
|[Combination Sum](https://github.com/jshinm/coding_practice/blob/master/leetcode/20210919_leetcode_combination_sum.py)|[LeetCode](https://leetcode.com/problems/combination-sum/)|Blind 75 Qs|
|[Search in Rotated Sorted Array](https://github.com/jshinm/coding_practice/blob/master/leetcode/20210928_leetcode_search_in_rotated_array.py)|[LeetCode](https://leetcode.com/problems/search-in-rotated-sorted-array)|Blind 75 Qs|
|[Group Anagrams](https://github.com/jshinm/coding_practice/blob/master/leetcode/20210929_leetcode_group_anagrams.py)|[LeetCode](https://leetcode.com/problems/group-anagrams)|Blind 75 Qs|
|[Rotate Image](https://github.com/jshinm/coding_practice/blob/master/leetcode/20210929_leetcode_rotated_image.py)|[LeetCode](https://leetcode.com/problems/rotate-image)|Blind 75 Qs|
|[Maximum Subarray](https://github.com/jshinm/coding_practice/blob/master/leetcode/20211002_leetcode_max_subarray.py)|[LeetCode](https://leetcode.com/problems/maximum-subarray)|Blind 75 Qs|
|[Climbing Stairs](https://github.com/jshinm/coding_practice/blob/master/leetcode/20211005_leetcode_climbing_stairs.py)|[LeetCode](https://leetcode.com/problems/climbing-stairs)|Blind 75 Qs|
|[Spiral Matrix](https://github.com/jshinm/coding_practice/blob/master/leetcode/20211008_leetcode_spiral_matrix.py)|[LeetCode](https://leetcode.com/problems/spiral-matrix)|Blind 75 Qs|
|[Jump Game](https://github.com/jshinm/coding_practice/blob/master/leetcode/20211009_leetcode_jump_game.py)|[LeetCode](https://leetcode.com/problems/jump-game)|Blind 75 Qs|
|[Merge Intervals](https://github.com/jshinm/coding_practice/blob/master/leetcode/20211015_leetcode_merge_intervals.py)|[LeetCode](https://leetcode.com/problems/merge-intervals)|Blind 75 Qs|
|[Insert Interval](https://github.com/jshinm/coding_practice/blob/master/leetcode/20211016_leetcode_insert_interval.py)|[LeetCode](https://leetcode.com/problems/insert-interval)|Blind 75 Qs|
|[Unique Paths](https://github.com/jshinm/coding_practice/blob/master/leetcode/20211017_leetcode_unique_path.py)|[LeetCode](https://leetcode.com/problems/unique-paths/)|Blind 75 Qs, only TLE Solution|
|[Sort Characters By Frequency](https://github.com/jshinm/coding_practice/blob/master/leetcode/20211022_leetcode_sort_char_by_freq.py)|[LeetCode](https://leetcode.com/problems/sort-characters-by-frequency/)||
|[Set Matrix Zeroes](https://github.com/jshinm/coding_practice/blob/master/leetcode/20211202_leetcode_set_matrix_zeroes.md)|[LeetCode](https://leetcode.com/problems/set-matrix-zeroes/)|Blind 75 Qs|
|[Minimum Window Substring](https://github.com/jshinm/coding_practice/blob/master/leetcode/20211202_leetcode_min_window_substring.md)|[LeetCode](https://leetcode.com/problems/minimum-window-substring/)|Blind 75 Qs|
|[Word Search](https://github.com/jshinm/coding_practice/blob/master/leetcode/20211205_leetcode_word_search.md)|[LeetCode](https://leetcode.com/problems/word-search)|Blind 75 Qs|
|[Decode Ways](https://github.com/jshinm/coding_practice/blob/master/leetcode/20211212_leetcode_decode_ways.md)|[LeetCode](https://leetcode.com/problems/decode-ways/)|Blind 75 Qs|
|[BinaryGap](https://github.com/jshinm/coding_practice/blob/master/codility/20211004_codility_binary_gap.py)|[Codility](https://app.codility.com/programmers/lessons/1-iterations/binary_gap/)||
|[CyclicRotation](https://github.com/jshinm/coding_practice/blob/master/codility/20211020_codility_array_rotation.py)|[Codility](https://app.codility.com/programmers/lessons/2-arrays/cyclic_rotation/)||
|[OddOccurrencesInArray](https://github.com/jshinm/coding_practice/blob/master/codility/20211021_codility_odd_occurrences_array.py)|[Codility](https://app.codility.com/programmers/lessons/2-arrays/odd_occurrences_in_array/)||
|[FrogJmp](https://github.com/jshinm/coding_practice/blob/master/codility/20211021_codility_frog_jump.py)|[Codility](https://app.codility.com/programmers/lessons/3-time_complexity/frog_jmp/)||
|[PermMissingElem](https://github.com/jshinm/coding_practice/blob/master/codility/20211021_codility_missing_element_in_permutation.py)|[Codility](https://app.codility.com/programmers/lessons/3-time_complexity/perm_missing_elem/)||
|[TapeEquilibrium](https://github.com/jshinm/coding_practice/blob/master/codility/20211021_codility_tape_equilibrium.py)|[Codility](https://app.codility.com/programmers/lessons/3-time_complexity/tape_equilibrium/)||
|[FrogRiverOne](https://github.com/jshinm/coding_practice/blob/master/codility/20211021_codility_frog_river_one.py)|[Codility](https://app.codility.com/programmers/lessons/4-counting_elements/frog_river_one/)||
|[PermCheck](https://github.com/jshinm/coding_practice/blob/master/codility/20211021_codility_perma_check.py)|[Codility](https://app.codility.com/programmers/lessons/4-counting_elements/perm_check/)||
|[MaxCounters](https://github.com/jshinm/coding_practice/blob/master/codility/20211021_codility_max_counters.py)|[Codility](https://app.codility.com/programmers/lessons/4-counting_elements/max_counters/)||
|[MissingInteger](https://github.com/jshinm/coding_practice/blob/master/codility/20211022_codility_missing_integer.py)|[Codility](https://app.codility.com/programmers/lessons/4-counting_elements/missing_integer/)||
|[PassingCars](https://github.com/jshinm/coding_practice/blob/master/codility/20211028_codility_passing_cars.py)|[Codility](https://app.codility.com/programmers/lessons/5-prefix_sums/passing_cars/)||
|[CountDiv](https://github.com/jshinm/coding_practice/blob/master/codility/20211031_codility_countDiv.py)|[Codility](https://app.codility.com/programmers/lessons/5-prefix_sums/count_div/)||
|[GenomicRangeQuery](https://github.com/jshinm/coding_practice/blob/master/codility/20211031_codility_GenomicRangeQuery.py)|[Codility](https://app.codility.com/programmers/lessons/5-prefix_sums/genomic_range_query/)||
|[MinAvgTwoSlice](https://github.com/jshinm/coding_practice/blob/master/codility/20211031_codility_MinAvgTwoSlice.py)|[Codility](https://app.codility.com/programmers/lessons/5-prefix_sums/min_avg_two_slice/)|50% Solution|
|[Distinct](https://github.com/jshinm/coding_practice/blob/master/codility/20211104_codility_compute_distinct_val.py)|[Codility](https://app.codility.com/programmers/lessons/6-sorting/distinct/)||
|[MaxProductOfThree](https://github.com/jshinm/coding_practice/blob/master/codility/20211104_codility_max_product_of_3.py)|[Codility](https://app.codility.com/programmers/lessons/6-sorting/max_product_of_three/)||
|[Triangle](https://github.com/jshinm/coding_practice/blob/master/codility/20211108_codility_sort_triangle.py)|[Codility](https://app.codility.com/programmers/lessons/6-sorting/triangle/)||
|[NumberOfDiscIntersections](https://github.com/jshinm/coding_practice/blob/master/codility/20211109_codility_number_of_intersections.py)|[Codility](https://app.codility.com/programmers/lessons/6-sorting/number_of_disc_intersections/)||
|[Brackets](https://github.com/jshinm/coding_practice/blob/master/codility/20211110_codility_properly_nested_brackets.py)|[Codility](https://app.codility.com/programmers/lessons/7-stacks_and_queues/brackets/)||
|[Fish](https://github.com/jshinm/coding_practice/blob/master/codility/20211111_codility_fish.py)|[Codility](https://app.codility.com/programmers/lessons/7-stacks_and_queues/fish/)|87% Solution|
|[Nesting](https://github.com/jshinm/coding_practice/blob/master/codility/20211113_codility_single_type_nesting.py)|[Codility](https://app.codility.com/programmers/lessons/7-stacks_and_queues/nesting/)||
|[StoneWall](https://github.com/jshinm/coding_practice/blob/master/codility/20211111_codility_stonewall.py)|[Codility](https://app.codility.com/programmers/lessons/7-stacks_and_queues/stone_wall/)|92% Solution|
|[Dominator](https://github.com/jshinm/coding_practice/blob/master/codility/20211113_codility_dominator.py)|[Codility](https://app.codility.com/programmers/lessons/8-leader/dominator/)||
|[EquiLeader](https://github.com/jshinm/coding_practice/blob/master/codility/20211114_codility_equileader.py)|[Codility](https://app.codility.com/programmers/lessons/8-leader/equi_leader/)|33% Solution|
|[MaxProfit](https://github.com/jshinm/coding_practice/blob/master/codility/20211115_codility_maxprofit.py)|[Codility](https://app.codility.com/programmers/lessons/9-maximum_slice_problem/max_profit/)||
|[MaxSliceSum](https://github.com/jshinm/coding_practice/blob/master/codility/20211116_codility_maxslicesum.py)|[Codility](https://app.codility.com/programmers/lessons/9-maximum_slice_problem/max_slice_sum/)||
|[MaxDoubleSliceSum](https://github.com/jshinm/coding_practice/blob/master/codility/20211116_codility_maxdoubleslicesum.py)|[Codility](https://app.codility.com/programmers/lessons/9-maximum_slice_problem/max_double_slice_sum/)||
|[CountFactors](https://github.com/jshinm/coding_practice/blob/master/codility/20211119_codility_count_factors.py)|[Codility](https://app.codility.com/programmers/lessons/10-prime_and_composite_numbers/count_factors/)||

### Data Structure Examples
|Name|Example|
|-|-|
|Heap|[Note](/data_structure/heap.py)

### Sorting ([simulation notebook](./sorting/sort_notebook.ipynb))
|Name|Best TC|Average TC|Worst TC|Worst SC|[Stability](./sorting/stability.md)|
|-|-|-|-|-|-|
|[Bubble Sort](./sorting/bubble_sort.md)|Ω(N)|Θ(N^2)|O(N^2)|O(1)|Stable|
|Selection Sort|Ω(N^2)|Θ(N^2)|O(N^2)|O(1)||
|[Insertion Sort](./sorting/insertion_sort.md)|Ω(N)|Θ(N^2)|O(N^2)|O(1)|Stable|
|Shell Sort|Ω(N log N)|Θ(N log^2 N)|O(N log^2 N)|O(1)|
|Heap Sort|Ω(N log N)|Θ(N log N)|O(N log N)|O(1)|
|Merge Sort|Ω(N log N)|Θ(N log N)|O(N log N)|O(N)|
|Quick Sort|Ω(N log N)|Θ(N log N)|O(N^2)|O(logN)|
|Counting Sort|Ω(N+K)|Θ(N+K)|O(N+K)|O(K)|
|Tree Sort|Ω(N log N)|Θ(N log N)|O(N^2)|O(N)|
|Tim Sort|Ω(N)|Θ(N log N)|O(N log N)|O(N)|
|Smooth Sort|Ω(N)|Θ(N log N)|O(N log N)|O(1)|
|Radix Sort|Ω(NK)|Θ(NK)|O(NK)|O(N+K)|

### Database [SQL ([syntax note](https://github.com/jshinm/sql_mastery/blob/main/sql-mastery.md)) || Python]
|Problem Name|Platform|Language
|----|----|----|
|Combine Two Tables|[LeetCode](https://leetcode.com/problems/combine-two-tables)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211004_combine_two_tables.sql)|
|Second Highest Salary|[LeetCode](https://leetcode.com/problems/second-highest-salary)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211004_second_highest_salary.sql)|
|Nth Highest Salary|[LeetCode](https://leetcode.com/problems/nth-highest-salary)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211005_Nth_highest_salary.sql)|
|Rank Scores|[LeetCode](https://leetcode.com/problems/rank-scores)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211006_rank_scores.sql)|
|Consecutive Numbers|[LeetCode](https://leetcode.com/problems/consecutive-numbers)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211008_consecutive_numbers.sql)|
|Employees Earning More Than Their Managers|[LeetCode](https://leetcode.com/problems/employees-earning-more-than-their-managers)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211011_employees_earning_more.sql)|
|Duplicate Emails|[LeetCode](https://leetcode.com/problems/duplicate-emails)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211012_duplicate_emails.sql)|
|Customers Who Never Order|[LeetCode](https://leetcode.com/problems/customers-who-never-order)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211012_customers_who_never_order.sql)|
|Department Highest Salary|[LeetCode](https://leetcode.com/problems/department-highest-salary)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211012_department_highest_salary.sql)|
|Department Top Three Salaries|[LeetCode](https://leetcode.com/problems/department-top-three-salaries)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211013_department_top_3_salaries.sql)|
|Delete Duplicate Emails|[LeetCode](https://leetcode.com/problems/delete-duplicate-emails)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211012_delete_duplicate_emails.sql)|
|Rising Temperature|[LeetCode](https://leetcode.com/problems/rising-temperature)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211012_rising_temp.sql)|
|Trips and Users|[LeetCode](https://leetcode.com/problems/trips-and-users)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211020_trips_and_users.sql)|
|Big Countries|[LeetCode](https://leetcode.com/problems/big-countries)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211014_big_countries.sql)|
|Classes More Than 5 Students|[LeetCode](https://leetcode.com/problems/classes-more-than-5-students)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211017_classes_more_than_five.sql)|
|Human Traffic of Stadium|[LeetCode](https://leetcode.com/problems/human-traffic-of-stadium)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211022_human_traffic_stadium.sql)|
|Not Boring Movies|[LeetCode](https://leetcode.com/problems/not-boring-movies)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211018_not_boring_movies.sql)|
|Exchange Seats|[LeetCode](https://leetcode.com/problems/exchange-seats)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211018_exchange_seats.sql)|
|Swap Salary|[LeetCode](https://leetcode.com/problems/swap-salary)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211019_swap_salary.sql)|
|Reformat Department Table|[LeetCode](https://leetcode.com/problems/reformat-department-table)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/leetcode_challenges/20211022_reformat_dep_table.sql)|
|SqlEventsDelta|[Codility](https://app.codility.com/programmers/trainings/6/sql_sum/)|[SQL](https://app.codility.com/programmers/trainings/6/sql_events_delta/)|
|SqlWorldCup|[Codility](https://app.codility.com/programmers/trainings/6/sql_world_cup/)|[SQL](https://github.com/jshinm/sql_mastery/blob/main/codility/20211028_sql_worldcup.sql)|
|Weather Observation|HackerRank|[SQL](https://github.com/jshinm/sql_mastery/blob/main/hacker_rank/20211021_weather%20observation.sql)|
|SQL Project Planning|HackerRank|[SQL](https://github.com/jshinm/sql_mastery/blob/main/hacker_rank/20211023_sql_project_planning.sql)|
|Interviews|HackerRank|[SQL](https://github.com/jshinm/sql_mastery/blob/main/hacker_rank/20211024_interviews.sql)|
|15 Days of SQL|HackerRank|[SQL](https://github.com/jshinm/sql_mastery/blob/main/hacker_rank/20211029_15-days-sql.sql)|
|Japanese Population|HackerRank|[SQL](https://github.com/jshinm/sql_mastery/blob/main/hacker_rank/20211029_jp_population.sql)|
|Aggregation|HackerRank|[SQL](https://github.com/jshinm/sql_mastery/blob/main/hacker_rank/20211030_aggregation.sql)|
|Acceptance Rate By Date|[StrataStratch](https://platform.stratascratch.com/coding/10285-acceptance-rate-by-date?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20211213_stratascratch_acceptance_rate_by_date.md)|
|Highest Energy Consumption|[StrataStratch](https://platform.stratascratch.com/coding/10064-highest-energy-consumption?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20211213_stratascratch_highest_energy_consumption.md)|
|Finding User Purchases|[StrataStratch](https://platform.stratascratch.com/coding/10322-finding-user-purchases?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20211213_stratascratch_finding_user_purchases.md)|
|Popularity Percentage|[StrataStratch](https://platform.stratascratch.com/coding/10284-popularity-percentage?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20211213_stratascratch_popularity_percentage.md)|
|Highest Cost Orders|[StrataStratch](https://platform.stratascratch.com/coding/9915-highest-cost-orders?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20211213_stratascratch_highest_cost_orders.md)|
|Users By Avg Session time|[StrataStratch](https://platform.stratascratch.com/coding/10352-users-by-avg-session-time?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20211213_stratascratch_users_by_avg_session_time.md)|
|Top 5 States With 5 Star Businesses|[StrataStratch](https://platform.stratascratch.com/coding/10046-top-5-states-with-5-star-businesses?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20211214_stratascratch_top_5states_5star_businesses.md)|
|Finding Updated Records|[StrataStratch](https://platform.stratascratch.com/coding/10299-finding-updated-records?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20211214_stratascratch_finding_updated_records.md)|
|Risky Projects|[StrataStratch](https://platform.stratascratch.com/coding/10304-risky-projects?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20211214_stratascratch_risky_projects.md)|
|Number Of Bathrooms And Bedrooms|[StrataStratch](https://platform.stratascratch.com/coding/9622-number-of-bathrooms-and-bedrooms?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20211216_stratascratch_number_of_bathrooms.md)|
|Customer Details|[StrataStratch](https://platform.stratascratch.com/coding/9891-customer-details?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20211219_stratascratch_cutomer_details.md)|
|SMS Confirmations From Users|[StrataStratch](https://platform.stratascratch.com/coding/10291-sms-confirmations-from-users?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20211220_stratascratch_sms_confirmations.md)|
|Customer Revenue In March|[StrataStratch](https://platform.stratascratch.com/coding/10291-sms-confirmations-from-users?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20211224_stratascratch_cutomer_revenue.md)|
|Find the rate of processed tickets for each type|[StrataStratch](https://platform.stratascratch.com/coding/9781-find-the-rate-of-processed-tickets-for-each-type?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20211229_stratascratch_processed_tickets.md)|
|Find the overall friend acceptance count for a given date|[StrataStratch](https://platform.stratascratch.com/coding/9780-find-the-overall-friend-acceptance-count-for-a-given-date?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20211231_stratascratch_overall_friend_acceptance.md)|
|Daily Interactions By Users Count|[StrataStratch](https://platform.stratascratch.com/coding/9779-daily-interactions-by-users-count?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20220101_stratascratch_daily_interactions.md)|
|Successfully Sent Messages|[StrataStratch](https://platform.stratascratch.com/coding/9777-successfully-sent-messages?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20220104_stratascratch_successfully_sent_messages.md)|
|Popularity of Hack|[StrataStratch](https://platform.stratascratch.com/coding/10061-popularity-of-hack?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20220108_stratascratch_popularity_hack.md)|
|Most Active Users On Messenger|[StrataStratch](https://platform.stratascratch.com/coding/10295-most-active-users-on-messenger?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20220110_stratascratch_most_active_users_on_messenger.md)|
|Average Salaries|[StrataStratch](https://platform.stratascratch.com/coding/9917-average-salaries?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20220114_stratascratch_average_salaries.md)|
|Spam Posts|[StrataStratch](https://platform.stratascratch.com/coding/10134-spam-posts?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20220116_stratascratch_spam_posts.md)|
|Total Cost Of Orders|[StrataStratch](https://platform.stratascratch.com/coding/10183-total-cost-of-orders?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20220118_stratascratch_total_cost_of_orders.md)|
|Classify Business Type|[StrataStratch](https://platform.stratascratch.com/coding/9726-classify-business-type?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20220124_stratascratch_classify_business_type.md)|
|Top Cool Votes|[StrataStratch](https://platform.stratascratch.com/coding/10060-top-cool-votes?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20220128_stratascratch_top_cool_votes.md)|
|Order Details|[StrataStratch](https://platform.stratascratch.com/coding/9913-order-details?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20220206_stratascratch_order_details.md)|
|Workers With The Highest Salaries|[StrataStratch](https://platform.stratascratch.com/coding/10353-workers-with-the-highest-salaries?python=1)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20220212_stratascratch_workers_with_highest_salaries.md), [SQL](https://github.com/jshinm/sql_mastery/blob/main/startascratch/20220302_workers_highest_salary.md)|
|Reviews of Categories|[StrataStratch](https://platform.stratascratch.com/coding/10049-reviews-of-categories)|[Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20220311_stratascratch_review_of_categories.md), [SQL](https://github.com/jshinm/sql_mastery/blob/main/startascratch/20220309_reviews_of_categories.md)|
|Highest Salary in Department|[StrataStratch](https://platform.stratascratch.com/coding/9897-highest-salary-in-department?python=1)| [Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20220313_stratascratch_highest_salary_in_dept.md), [SQL](https://github.com/jshinm/sql_mastery/blob/main/startascratch/20220317_higheset_salary_in_dept.md)|
|Distances Traveled|[StrataStratch](https://platform.stratascratch.com/coding/10324-distances-traveled?python=1)| [Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20220322_stratascratch_distances_traveled.md), [SQL](https://github.com/jshinm/sql_mastery/blob/main/startascratch/20220319_distances_traveled.md)|
|Gender with Generous Reviews|[StrataStratch](https://platform.stratascratch.com/coding/10149-gender-with-generous-reviews?python=1)| [Python](https://github.com/jshinm/coding_practice/blob/master/stratascratch/20220326_stratascratch_genders_with_generous_reviews.md), [SQL](https://github.com/jshinm/sql_mastery/blob/main/startascratch/20220326_genders_with_generous_reviews.md)|
|Rank Variance Per Country|[StrataStratch](https://platform.stratascratch.com/coding/2007-rank-variance-per-country?python=1)| [SQL](https://github.com/jshinm/sql_mastery/blob/main/startascratch/20220410_rank_variance_per_country.md) |
|Users By Average Session Time|[StrataStratch](https://platform.stratascratch.com/coding/10352-users-by-avg-session-time?code_type=3)| [SQL](https://github.com/jshinm/sql_mastery/blob/main/startascratch/20220629_usesrs_by_avg_session_time.md) |
|Finding User Purchases|[StrataStratch](https://platform.stratascratch.com/coding/10322-finding-user-purchases?code_type=3)| [SQL](https://github.com/jshinm/sql_mastery/blob/main/startascratch/20220630_finding_user_purchases.md) |
|Highest Cost Orders|[StrataStratch](https://platform.stratascratch.com/coding/9915-highest-cost-orders?code_type=3)| [SQL](https://github.com/jshinm/sql_mastery/blob/main/startascratch/20220818_highest_cost_orders.md) |
|Total Cost of Orders|[StrataStratch](https://platform.stratascratch.com/coding/10183-total-cost-of-orders?code_type=3)| [SQL](https://github.com/jshinm/sql_mastery/blob/main/startascratch/20220820_total_cost_of_orders.md) |
|Ranking Most Active Guests|[StrataStratch](https://platform.stratascratch.com/coding/10159-ranking-most-active-guests?code_type=3)| [SQL](https://github.com/jshinm/sql_mastery/blob/main/startascratch/20220825_ranking_most_active_guests.md) |
|Algorithm Performance|[StrataStratch](https://platform.stratascratch.com/coding/10350-algorithm-performance?code_type=3)| [SQL](https://github.com/jshinm/sql_mastery/blob/main/startascratch/20220904_algorithm_performance.md) |

### Bash & Shell
|Problem Name|Platform|
|----|----|
|[Comparing Numbers](https://github.com/jshinm/bash-shell-mastery/blob/main/exercises/20211024_hackerrank_comparing_numbers.sh)|HackerRank||
|[Comparing Strings](https://github.com/jshinm/bash-shell-mastery/blob/main/exercises/20211024_hackerrank_comparing_strings.sh)|HackerRank||
|[Loop and Skip](https://github.com/jshinm/bash-shell-mastery/blob/main/exercises/20211024_hackerrank_loop_n_skip.sh)|HackerRank||
|[Arithmetic Operations](https://github.com/jshinm/bash-shell-mastery/blob/main/exercises/20211025_hackerrank_arithmetic_operations.sh)|HackerRank||
|[Compute Average](https://github.com/jshinm/bash-shell-mastery/blob/main/exercises/20211025_hackerrank_compute_average.sh)|HackerRank||
|[Cut Command](https://github.com/jshinm/bash-shell-mastery/blob/main/exercises/20211026_hackerrank_cuts.sh)|HackerRank||
|[Text Processing](https://github.com/jshinm/bash-shell-mastery/blob/main/exercises/20211106_hackerrank_text_processing.sh)|HackerRank||