{"id":24559357,"url":"https://github.com/sudeep065/string-data-algorithms-collection","last_synced_at":"2025-08-10T22:47:44.766Z","repository":{"id":272180931,"uuid":"340789333","full_name":"sudeep065/string-data-algorithms-collection","owner":"sudeep065","description":"This is a code collection of all the String Manipulation data algorithms with the sample input and output.","archived":false,"fork":false,"pushed_at":"2021-04-16T14:47:49.000Z","size":18,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-16T19:49:16.999Z","etag":null,"topics":["binary-search","binary-search-tree","bubble-sort-algorithm","reverse-strings","search-algorithm"],"latest_commit_sha":null,"homepage":"","language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/sudeep065.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2021-02-21T01:08:06.000Z","updated_at":"2021-04-16T14:47:51.000Z","dependencies_parsed_at":"2025-01-17T10:32:51.335Z","dependency_job_id":null,"html_url":"https://github.com/sudeep065/string-data-algorithms-collection","commit_stats":null,"previous_names":["sudeep065/string-data-algorithms-collection"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/sudeep065/string-data-algorithms-collection","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sudeep065%2Fstring-data-algorithms-collection","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sudeep065%2Fstring-data-algorithms-collection/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sudeep065%2Fstring-data-algorithms-collection/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sudeep065%2Fstring-data-algorithms-collection/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sudeep065","download_url":"https://codeload.github.com/sudeep065/string-data-algorithms-collection/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sudeep065%2Fstring-data-algorithms-collection/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":269803682,"owners_count":24477647,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-08-10T02:00:08.965Z","response_time":71,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["binary-search","binary-search-tree","bubble-sort-algorithm","reverse-strings","search-algorithm"],"created_at":"2025-01-23T06:16:24.412Z","updated_at":"2025-08-10T22:47:44.746Z","avatar_url":"https://github.com/sudeep065.png","language":"C#","readme":"## Table of Contents\n* [Quick Start](#quick-start)\n* [Simple Superreduced](#Simple-Superreduced)\n\n## Terminal Commands\n\nThis project was generated with Console using [Visual Studio 2019 Free Version click to download](https://visualstudio.microsoft.com/downloads/) version 16.8.4\n\n## Simple-Superreduced\nComplete the superReducedString function below\nSample Input\nstring=\"aaabccddd\"\n\nSample Output\nabd\n\nExplanation- Remove next matching char, if its just repeated 2/4 times then remove completely, if itz odd numbers, then you we need to keep it.\naaabccddd -\u003e aabccddd -\u003e abccddd -\u003e abddd -\u003e abdd -\u003e abd\n\n## RepeatedString\n\nThere is a string s, of lowercase English letters that is repeated infinitely many times. Given an integer n,find and print the number of letter a's in the first n letters of the infinite string.\n\nExample Input\naba\n10\n\nSample Output\n7\n\nExplanation 0\nThe first n=10 letters of the infinite string are \"abaabaabaa\". Because there are 7 a's, we return 7.\n\n\n\u003cp align=\"center\"\u003e\n  \u003ca href=\"https://www.hackerrank.com/sudeep065\"\u003e\n    \u003cimg alt=\"HackerRank\" src=\"https://raw.githubusercontent.com/gabrielgiordan/HackerRank/master/hacker-rank-logo.png\"\u003e\n  \u003c/a\u003e\n\u003c/p\u003e\n\u003cp align=\"center\"\u003e\n  \u003cimg alt=\"Solutions\" src=\"https://img.shields.io/badge/Solutions-95-brightgreen.svg?longCache=true\u0026style=for-the-badge\"\u003e\n  \u003cimg alt=\"Languages\" src=\"https://img.shields.io/badge/Languages-JavaScript-brightgreen.svg?longCache=true\u0026style=for-the-badge\"\u003e\n  \u003cimg alt=\"NodeJS Version\" src=\"https://img.shields.io/node/v/carbon.svg?style=for-the-badge\"\u003e\n\u003c/p\u003e\n\u003cp align=\"center\"\u003e\n  Efficient HackerRank solutions in C# programmed by \u003ca alt=\"HackerRank Profile\" href=\"https://www.hackerrank.com/sudeep065\" \u003eSudeep\u003c/a\u003e\n\u003c/p\u003e\n\n# 10 Days of Statistics\n|   | Day | Problem         | Solution | Difficulty | Points | Note |\n|-- |:---:|:---------------:|:--------:|:----------:|:------:|:----:|\n| ⭐ | 9 |[Multiple Linear Regression (Last day)](https://www.hackerrank.com/challenges/s10-multiple-linear-regression/problem)| [JavaScript](10-days-of-statistics/s10-multiple-linear-regression.js) | Medium | 30 | |\n| | 8 |[Least Square Regression Line](https://www.hackerrank.com/challenges/s10-least-square-regression-line/problem)| [JavaScript](10-days-of-statistics/s10-least-square-regression-line.js) | Easy | 30 | |\n| | 7 |[Spearman's Rank Correlation Coefficient](https://www.hackerrank.com/challenges/s10-spearman-rank-correlation-coefficient/problem)| [JavaScript](10-days-of-statistics/s10-spearman-rank-correlation-coefficient.js) | Easy | 30 | |\n| | 7 |[Pearson Correlation Coefficient I](https://www.hackerrank.com/challenges/s10-pearson-correlation-coefficient/problem)| [JavaScript](10-days-of-statistics/s10-pearson-correlation-coefficient.js) | Easy | 30 | |\n| | 6 |[The Central Limit Theorem III](https://www.hackerrank.com/challenges/s10-the-central-limit-theorem-3/problem)| [JavaScript](10-days-of-statistics/s10-the-central-limit-theorem-3.js) | Easy | 30 | |\n| | 6 |[The Central Limit Theorem II](https://www.hackerrank.com/challenges/s10-the-central-limit-theorem-2/problem)| [JavaScript](10-days-of-statistics/s10-the-central-limit-theorem-2.js) | Easy | 30 | |\n| | 6 |[The Central Limit Theorem I](https://www.hackerrank.com/challenges/s10-the-central-limit-theorem-1/problem)| [JavaScript](10-days-of-statistics/s10-the-central-limit-theorem-1.js) | Easy | 30 | |\n| | 5 |[Normal Distribution II](https://www.hackerrank.com/challenges/s10-normal-distribution-2/problem)| [JavaScript](10-days-of-statistics/s10-normal-distribution-2.js) | Easy | 30 | |\n| | 5 |[Normal Distribution I](https://www.hackerrank.com/challenges/s10-normal-distribution-1/problem)| [JavaScript](10-days-of-statistics/s10-normal-distribution-1.js) | Easy | 30 | |\n| | 5 |[Poison Distribution II](https://www.hackerrank.com/challenges/s10-poisson-distribution-2/problem)| [JavaScript](10-days-of-statistics/s10-poisson-distribution-2.js) | Easy | 30 | |\n| | 5 |[Poison Distribution I](https://www.hackerrank.com/challenges/s10-poisson-distribution-1/problem)| [JavaScript](10-days-of-statistics/s10-poisson-distribution-1.js) | Easy | 30 | |\n| | 4 |[Geometric Distribution II](https://www.hackerrank.com/challenges/s10-geometric-distribution-2/problem)| [JavaScript](10-days-of-statistics/s10-geometric-distribution-2.js) | Easy | 30 | |\n| | 4 |[Geometric Distribution I](https://www.hackerrank.com/challenges/s10-geometric-distribution-1/problem)| [JavaScript](10-days-of-statistics/s10-geometric-distribution-1.js) | Easy | 30 | |\n| | 4 |[Binomial Distribution II](https://www.hackerrank.com/challenges/s10-binomial-distribution-2/problem)| [JavaScript](10-days-of-statistics/s10-binomial-distribution-2.js) | Easy | 30 | |\n| | 4 |[Binomial Distribution I](https://www.hackerrank.com/challenges/s10-binomial-distribution-1/problem)| [JavaScript](10-days-of-statistics/s10-binomial-distribution-1.js) | Easy | 30 | |\n| | 2 |[Compound Event Probability](https://www.hackerrank.com/challenges/s10-mcq-3/problem)| [JavaScript](10-days-of-statistics/s10-mcq-3.js) | | | |\n| | 2 |[More Dice](https://www.hackerrank.com/challenges/s10-mcq-2/problem)| [JavaScript](10-days-of-statistics/s10-mcq-2.js) | | | |\n| | 2 |[Basic Probability](https://www.hackerrank.com/challenges/s10-mcq-1/problem)| [JavaScript](10-days-of-statistics/s10-mcq-1.js) |  | | |\n| | 1 |[Standard Deviation](https://www.hackerrank.com/challenges/s10-standard-deviation/problem)| [JavaScript](10-days-of-statistics/s10-standard-deviation.js) | Easy | 30 | |\n| | 1 |[Interquartile Range](https://www.hackerrank.com/challenges/s10-interquartile-range/problem)| [JavaScript](10-days-of-statistics/s10-interquartile-range.js) | Easy | 30 | |\n| | 1 |[Quartiles](https://www.hackerrank.com/challenges/s10-quartiles.js/problem)| [JavaScript](10-days-of-statistics/s10-quartiles.js) | Easy | 30 | |\n| | 0 |[Weighted Mean](https://www.hackerrank.com/challenges/s10-weighted-mean/problem)| [JavaScript](10-days-of-statistics/s10-weighted-mean.js) | Easy | 30 | |\n| | 0 |[ Mean, Median, and Mode](https://www.hackerrank.com/challenges/s10-basic-statistics/problem)| [JavaScript](10-days-of-statistics/s10-basic-statistics.js) | Easy | 30 | |\n\n---\n\n# Algorithms\n\n## Implementation\n|   | Problem         | Solution | Difficulty | Points | Note |\n|-- |:---------------:|:--------:|:----------:|:------:|:----:|\n| ⭐ |[Matrix Layer Rotation](https://www.hackerrank.com/challenges/matrix-rotation-algo/problem)| [JavaScript](algorithms/implementation/matrix-rotation-algo.js) | Hard | 80 | Math solution to the problem, _O(1)_ if the loop to print the result isn't considered, otherwise _O(m*n)_ |\n| ⭐ |[ACM ICPC Team](https://www.hackerrank.com/challenges/acm-icpc-team/problem)| [JavaScript](algorithms/implementation/acm-icpc-team.js) | Easy | 25 | Using bitwise operations, and a custom Hamming Weight implementation to count ones, because the HackerRank's v8 version hasn't yet a BigInt implementation. Best case _O(n^2)_ where _n_ is the topics length |\n| ⭐ |[Queen's Attack II](https://www.hackerrank.com/challenges/queens-attack-2/problem)| [JavaScript](algorithms/implementation/queens-attack-2.js) | Medium | 30 | Math solution to the problem, _O(k)_, where _k_ is the number of obstacles |\n| ⭐ |[Modified Kaprekar Numbers](https://www.hackerrank.com/challenges/kaprekar-numbers/problem)| [JavaScript](algorithms/implementation/kaprekar-numbers.js) | Easy | 30 | Math and very performatic solution, without using Strings nor brute force, _O(n)_, where n = q - p |\n| |[Equalize the Array](https://www.hackerrank.com/challenges/equality-in-a-array/problem)| [JavaScript](algorithms/implementation/equality-in-a-array.js) | Easy | 20 | _O(n)_ |\n| ⭐ |[Jumping on the Clouds](https://www.hackerrank.com/challenges/jumping-on-the-clouds/problem)| [JavaScript](algorithms/implementation/jumping-on-the-clouds.js) | Easy | 20 | _O(log n)_ |\n| ⭐ |[Repeated String](https://www.hackerrank.com/challenges/repeated-string/problem)| [JavaScript](algorithms/implementation/repeated-string.js) | Easy | 20 | The algorithm doesn't count the string a second time, both best and worst case is _O(n)_ where _n_ is the length of the string |\n|  |[Lisa's Workbook](https://www.hackerrank.com/challenges/lisa-workbook/problem)| [JavaScript](algorithms/implementation/lisa-workbook.js) | Easy | 25 |  |\n|  |[Bigger is Greater](https://www.hackerrank.com/challenges/bigger-is-greater/problem)| [JavaScript](algorithms/implementation/bigger-is-greater.js) | Medium | 35 |  |\n|  |[Organizing Containers of Balls](https://www.hackerrank.com/challenges/organizing-containers-of-balls/problem)| [JavaScript](algorithms/implementation/organizing-containers-of-balls.js) | Medium | 30 |  |\n|  |[The Time in Words](https://www.hackerrank.com/challenges/the-time-in-words/problem)| [JavaScript](algorithms/implementation/the-time-in-words.js) | Medium | 25 | _O(1)_ |\n|  |[Beautiful Triplets](https://www.hackerrank.com/challenges/beautiful-triplets/problem)| [JavaScript](algorithms/implementation/beautiful-triplets.js) | Easy | 20 | _O(n)_ |\n|  |[Minimum Distances](https://www.hackerrank.com/challenges/minimum-distances/problem)| [JavaScript](algorithms/implementation/minimum-distances.js) | Easy | 20 | _O(n)_ |\n|  |[Halloween Sale](https://www.hackerrank.com/challenges/halloween-sale/problem)| [JavaScript](algorithms/implementation/halloween-sale.js) | Easy | 20 | _O(1)_ |\n|  |[Non-Divisible Subset](https://www.hackerrank.com/challenges/non-divisible-subset/problem)| [JavaScript](algorithms/implementation/non-divisible-subset.js) | Medium | 20 |  |\n|  |[Cut the Sticks](https://www.hackerrank.com/challenges/cut-the-sticks/problem)| [JavaScript](algorithms/implementation/cut-the-sticks.js) | Easy | 25 |  |\n| |[Library Fine](https://www.hackerrank.com/challenges/library-fine/problem)| [JavaScript](algorithms/implementation/library-fine.js) | Easy | 15 | _O(1)_ |\n| |[Sherlock and Squares](https://www.hackerrank.com/challenges/sherlock-and-squares/problem)| [JavaScript](algorithms/implementation/sherlock-and-squares.js) | Easy | 20 | _O(1)_ |\n| |[Append and Delete](https://www.hackerrank.com/challenges/append-and-delete/problem)| [JavaScript](algorithms/implementation/append-and-delete.js) | Easy | 20 | _O(min(s, t))_ |\n| |[Extra Long Factorials](https://www.hackerrank.com/challenges/extra-long-factorials/problem)| [JavaScript](algorithms/implementation/extra-long-factorials.js) | Medium | 20 |  |\n| |[Service Lane](https://www.hackerrank.com/challenges/service-lane/problem)| [JavaScript](algorithms/implementation/service-lane.js) | Easy | 20 |  |\n| |[Chocolate Feast](https://www.hackerrank.com/challenges/chocolate-feast/problem)| [JavaScript](algorithms/implementation/chocolate-feast.js) | Easy | 25 | _O(1)_ |\n| |[Find Digits](https://www.hackerrank.com/challenges/find-digits/problem)| [JavaScript](algorithms/implementation/find-digits.js) | Easy | 25 | _O(n)_ |\n| |[Jumping on the Clouds: Revisited](https://www.hackerrank.com/challenges/jumping-on-the-clouds-revisited/problem)| [JavaScript](algorithms/implementation/jumping-on-the-clouds-revisited.js) | Easy | 15 | _O(n / k)_ where _k_ is the number of jumps |\n| |[Sequence Equation](https://www.hackerrank.com/challenges/jumping-on-the-clouds-revisited/problem)| [JavaScript](algorithms/implementation/permutation-equation.js) | Easy | 20 | |\n| |[Circular Array Rotation](https://www.hackerrank.com/challenges/circular-array-rotation/problem)| [JavaScript](algorithms/implementation/circular-array-rotation.js) | Easy | 20 | |\n| |[Save the Prisoner!](https://www.hackerrank.com/challenges/save-the-prisoner/problem)| [JavaScript](algorithms/implementation/save-the-prisoner.js) | Easy | 15 | _O(1)_ |\n| ⭐ |[Viral Advertising](https://www.hackerrank.com/challenges/strange-advertising/problem)| [JavaScript](algorithms/implementation/strange-advertising.js) | Easy | 15 | Alternative way to solve it using this integer sequence formula: https://oeis.org/A061418 |\n| |[Beautiful Days at the Movies](https://www.hackerrank.com/challenges/beautiful-days-at-the-movies/problem)| [JavaScript](algorithms/implementation/beautiful-days-at-the-movies.js) | Easy | 15 | _O(n)_ |\n| |[Angry Professor](https://www.hackerrank.com/challenges/angry-professor/problem)| [JavaScript](algorithms/implementation/angry-professor.js) | Easy | 20 | _O(n)_ |\n| |[Utopian Tree](https://www.hackerrank.com/challenges/utopian-tree/problem)| [JavaScript](algorithms/implementation/utopian-tree.js) | Easy | 20 | _O(1)_ |\n| |[Designer PDF Viewer](https://www.hackerrank.com/challenges/designer-pdf-viewer/problem)| [JavaScript](algorithms/implementation/designer-pdf-viewer.js) | Easy | 20 | |\n| |[The Hurdle Race](https://www.hackerrank.com/challenges/the-hurdle-race/problem)| [JavaScript](algorithms/implementation/the-hurdle-race.js) | Easy | 15 | _O(1)_ |\n| |[Climbing the Leaderboard](https://www.hackerrank.com/challenges/climbing-the-leaderboard/problem)| [JavaScript](algorithms/implementation/climbing-the-leaderboard.js) | Medium | 20 | _O(n + log(m))_ |\n| |[Picking Numbers](https://www.hackerrank.com/challenges/picking-numbers/problem)| [JavaScript](algorithms/implementation/picking-numbers.js) | Easy | 20 | _O(1)_ |\n| ⭐ |[Forming a Magic Square](https://www.hackerrank.com/challenges/magic-square-forming/problem)| [JavaScript](algorithms/implementation/magic-square-forming.js) | Medium | 20 | Using Édouard Lucas general formula to generate all possible magic squares of order 3 |\n| |[Cats and a Mouse](https://www.hackerrank.com/challenges/cats-and-a-mouse/problem)| [JavaScript](algorithms/implementation/cats-and-a-mouse.js) | Easy | 15 | _O(1)_ |\n| |[Eletronics Shop](https://www.hackerrank.com/challenges/electronics-shop/problem)| [JavaScript](algorithms/implementation/electronics-shop.js) | Easy | 15 | |\n| |[Counting Valleys](https://www.hackerrank.com/challenges/counting-valleys/problem)| [JavaScript](algorithms/implementation/counting-valleys.js) | Easy | 15 | _O(n)_ |\n| |[Drawing Book](https://www.hackerrank.com/challenges/drawing-book/problem)| [JavaScript](algorithms/implementation/drawing-book.js) | Easy | 10 | _O(1)_ |\n| |[Sock Merchant](https://www.hackerrank.com/challenges/sock-merchant/problem)| [JavaScript](algorithms/implementation/sock-merchant.js) | Easy | 10 | _O(1)_ |\n| |[Bon Appétit](https://www.hackerrank.com/challenges/bon-appetit/problem)| [JavaScript](algorithms/implementation/bon-appetit.js) | Easy | 10 | _O(n)_ |\n| |[Day of the Programmer](https://www.hackerrank.com/challenges/day-of-the-programmer/problem)| [JavaScript](algorithms/implementation/day-of-the-programmer.js) | Easy | 10 | _O(1)_ |\n| |[Migratory Birds](https://www.hackerrank.com/challenges/migratory-birds/problem)| [JavaScript](algorithms/implementation/migratory-birds.js) | Easy | 10 | |\n| |[Divisible Sum Pairs](https://www.hackerrank.com/challenges/divisible-sum-pairs/problem)| [JavaScript](algorithms/implementation/divisible-sum-pairs.js) | Easy | 10 | |\n| |[Birthday Chocolate](https://www.hackerrank.com/challenges/the-birthday-bar/problem)| [JavaScript](algorithms/implementation/the-birthday-bar.js) | Easy | 10 | ||\n| |[Breaking the Records](https://www.hackerrank.com/challenges/breaking-best-and-worst-records/problem)| [JavaScript](algorithms/implementation/breaking-best-and-worst-records.js) | Easy | 10 | _O(n)_ |\n| |[Between Two Sets](https://www.hackerrank.com/challenges/between-two-sets/problem)| [JavaScript](algorithms/implementation/between-two-sets.js) | Easy | 10 | Using Euclid's division algorithm for greatest common divisor |\n| |[Kangaroo](https://www.hackerrank.com/challenges/kangaroo/problem)| [JavaScript](algorithms/implementation/kangaroo.js) | Easy | 10 |  |\n| |[Apple and Orange](https://www.hackerrank.com/challenges/apple-and-orange/problem)| [JavaScript](algorithms/implementation/apple-and-orange.js) | Easy | 10 | |\n| |[Grading Students](https://www.hackerrank.com/challenges/grading/problem)| [JavaScript](algorithms/implementation/grading.js) | Easy | 10 |  |\n\n## Data Structures\n|   | Problem         | Solution | Difficulty | Points | Note |\n|-- |:---------------:|:--------:|:----------:|:------:|:----:|\n|  |[Array Manipulation](https://www.hackerrank.com/challenges/crush/problem)| [JavaScript](algorithms/data-structures/crush.js) | Hard | 60 | |\n|  |[Sparse Arrays](https://www.hackerrank.com/challenges/sparse-arrays/problem)| [JavaScript](algorithms/data-structures/sparse-arrays.js) | Medium | 25 | |\n|  |[Dynamic Array](https://www.hackerrank.com/challenges/dynamic-array/problem)| [JavaScript](algorithms/data-structures/dynamic-array.js) | Easy | 15 | |\n|  |[Array DS](https://www.hackerrank.com/challenges/array-ds/problem)| [JavaScript](algorithms/data-structures/arrays-ds.js) | Easy | 10 | |\n\n## Constructive Algorithms\n|   | Problem         | Solution | Difficulty | Points | Note |\n|-- |:---------------:|:--------:|:----------:|:------:|:----:|\n|  |[New Year Chaos](https://www.hackerrank.com/challenges/new-year-chaos/problem)| [JavaScript](algorithms/constructive-algorithms/new-year-chaos.js) | Medium | 40 | |\n\n## Warmup\n|   | Problem         | Solution | Difficulty | Points | Note |\n|-- |:---------------:|:--------:|:----------:|:------:|:----:|\n|  |[Time Conversion](https://www.hackerrank.com/challenges/time-conversion/problem)| [JavaScript](algorithms/warmup/time-conversion.js) | Easy | 15 | |\n|  |[Birthday Cake Candles](https://www.hackerrank.com/challenges/birthday-cake-candles/problem)| [JavaScript](algorithms/warmup/birthday-cake-candles.js) | Easy | 10 | |\n|  |[Mini-Max Sum](https://www.hackerrank.com/challenges/mini-max-sum/problem)| [JavaScript](algorithms/warmup/mini-max-sum.js) | Easy | 10 | |\n|  |[Staircase](https://www.hackerrank.com/challenges/staircase/problem)| [JavaScript](algorithms/warmup/staircase.js) | Easy | 10 | |\n|  |[Plus Minus](https://www.hackerrank.com/challenges/plus-minus/problem)| [JavaScript](algorithms/warmup/plus-minus.js) | Easy | 10 | |\n|  |[Diagonal Difference](https://www.hackerrank.com/challenges/diagonal-difference/problem)| [JavaScript](algorithms/warmup/diagonal-difference.js) | Easy | 10 | |\n|  |[A Very Big Sum](https://www.hackerrank.com/challenges/a-very-big-sum/problem)| [JavaScript](algorithms/warmup/a-very-big-sum.js) | Easy | 10 | |\n|  |[Compare the Triplets](https://www.hackerrank.com/challenges/compare-the-triplets.js/problem)| [JavaScript](algorithms/warmup/compare-the-triplets.js) | Easy | 10 | |\n\n---\n\n# Mathematics\n\n|   | Problem         | Solution | Difficulty | Points | Note |\n|-- |:---------------:|:--------:|:----------:|:------:|:----:|\n|  |[Army Game](https://www.hackerrank.com/challenges/game-with-cells/problem)| [JavaScript](mathematics/game-with-cells.js) | Easy | 10 | |\n|  |[Minimum Height Triangle](https://www.hackerrank.com/challenges/lowest-triangle/problem)| [JavaScript](mathematics/lowest-triangle.js) | Easy | 10 | |\n|  |[Handshake](https://www.hackerrank.com/challenges/handshake/problem)| [JavaScript](mathematics/handshake.js) | Easy | 10 | |\n|  |[Maximum Draws](https://www.hackerrank.com/challenges/maximum-draws/problem)| [JavaScript](mathematics/maximum-draws.js) | Easy | 5 | |\n|  |[Find the Point](https://www.hackerrank.com/challenges/find-point/problem)| [JavaScript](mathematics/find-point.js) | Easy | 5 | |\n\n---\n\n# Interview Preparation Kit\n\n## Arrays\n|   | Problem         | Solution | Difficulty | Points | Note |\n|-- |:---------------:|:--------:|:----------:|:------:|:----:|\n|  |[Minimun Swaps 2](https://www.hackerrank.com/challenges/minimum-swaps-2/problem?h_l=interview\u0026playlist_slugs%5B%5D=interview-preparation-kit\u0026playlist_slugs%5B%5D=arrays)| [JavaScript](interview-preparation-kit/minimum-swaps-2.js) | Medium | 40 | |\n|  |[Arrays: Left Rotation](https://www.hackerrank.com/challenges/ctci-array-left-rotation/problem?h_l=interview\u0026playlist_slugs%5B%5D=interview-preparation-kit\u0026playlist_slugs%5B%5D=arrays)| [JavaScript](interview-preparation-kit/array-left-rotation.js) | Easy | 15 | |\n|  |[2D Array - DS](https://www.hackerrank.com/challenges/2d-array/problem?h_l=interview\u0026playlist_slugs%5B%5D=interview-preparation-kit\u0026playlist_slugs%5B%5D=arrays)| [JavaScript](interview-preparation-kit/2d-array.js) | Easy | 15 | |\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsudeep065%2Fstring-data-algorithms-collection","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsudeep065%2Fstring-data-algorithms-collection","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsudeep065%2Fstring-data-algorithms-collection/lists"}