{"id":24143773,"url":"https://github.com/is2ei/coding-challenges","last_synced_at":"2025-03-01T14:19:32.832Z","repository":{"id":97246932,"uuid":"180541213","full_name":"is2ei/coding-challenges","owner":"is2ei","description":null,"archived":false,"fork":false,"pushed_at":"2019-06-15T06:39:22.000Z","size":14148,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-12T05:28:49.023Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"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/is2ei.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":"2019-04-10T08:49:34.000Z","updated_at":"2019-06-15T06:39:24.000Z","dependencies_parsed_at":"2023-03-13T03:01:28.767Z","dependency_job_id":null,"html_url":"https://github.com/is2ei/coding-challenges","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/is2ei%2Fcoding-challenges","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/is2ei%2Fcoding-challenges/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/is2ei%2Fcoding-challenges/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/is2ei%2Fcoding-challenges/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/is2ei","download_url":"https://codeload.github.com/is2ei/coding-challenges/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241374807,"owners_count":19952594,"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","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":[],"created_at":"2025-01-12T05:28:31.950Z","updated_at":"2025-03-01T14:19:32.816Z","avatar_url":"https://github.com/is2ei.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# coding-challenges\n\n## Algorithms\n\n### Searching\n\n- [Searching Algorithms - GeeksforGeeks](https://www.geeksforgeeks.org/searching-algorithms/)\n- [Recent Articles on Searching - GeeksforGeeks](https://www.geeksforgeeks.org/category/searching/)\n- [線形探索を極める！ 〜 for 文で色んなことができることを知る 〜](https://qiita.com/drken/items/fdae15f6e9ede543b97a)\n- Online Judge\n    - [Search - HackerRank](https://www.hackerrank.com/domains/algorithms?badge_type=problem-solving\u0026filters%5Bsubdomains%5D%5B%5D=search)\n    - [Searching - GeeksforGeeks](https://practice.geeksforgeeks.org/explore/?category%5B%5D=Searching\u0026page=1\u0026sortBy=accuracy)\n    - [Binary Search - LeetCode](https://leetcode.com/tag/binary-search/)\n\n\n### Sorting\n\n- [Sorting Algorithms - GeeksforGeeks](https://www.geeksforgeeks.org/sorting-algorithms/)\n- [Recent Articles on Sorting - GeeksforGeeks](https://www.geeksforgeeks.org/category/sorting/)\n- Bubble Sort\n    - [Bubble sort - Wikipedia](https://en.wikipedia.org/wiki/Bubble_sort)\n    - [Bubble Sort - GeeksforGeeks](https://www.geeksforgeeks.org/bubble-sort/)\n    - [Recursive Bubble Sort - GeeksforGeeks](https://www.geeksforgeeks.org/recursive-bubble-sort/)\n    - [バブルソート](http://www.ics.kagoshima-u.ac.jp/~fuchida/edu/algorithm/sort-algorithm/bubble-sort.html)\n- Bucket Sort\n    - [Bucket Sort | GeeksforGeeks](https://www.youtube.com/watch?v=VuXbEb5ywrU)\n    - [バケットソート](http://www.ics.kagoshima-u.ac.jp/~fuchida/edu/algorithm/sort-algorithm/bucket-sort.html)\n- Comb Sort\n    - [Comb Sort | GeeksforGeeks](https://www.youtube.com/watch?v=n51GFZHXlYY)\n- Counting Sort\n    - [Counting sort - Wikipedia](https://en.wikipedia.org/wiki/Counting_sort)\n    - [Counting Sort - GeeksforGeeks](https://www.youtube.com/watch?v=7zuGmKfUt7s)\n- Heap Sort\n    - [Heap Sort | GeeksforGeeks](https://www.youtube.com/watch?v=MtQL_ll5KhQ)\n    - [ヒープソート](http://www.ics.kagoshima-u.ac.jp/~fuchida/edu/algorithm/sort-algorithm/heap-sort.html)\n    - [ヒープソート - (MAX上における)アルゴリズム的問題におけるユーザーインターフェースの改良](http://www.th.cs.meiji.ac.jp/assets/researches/2005/omoto/heapsort.html)\n- Insertion Sort\n    - [Insertion sort - Wikipedia](https://en.wikipedia.org/wiki/Insertion_sort)\n    - [Insertion Sort - GeeksforGeeks](https://www.youtube.com/watch?v=OGzPmgsI-pQ)\n- Merge Sort\n    - [Merge sort - Wikipedia](https://en.wikipedia.org/wiki/Merge_sort)\n    - [Merge Sort | GeeksforGeeks](https://www.youtube.com/watch?v=JSceec-wEyw)\n    - [マージソート](http://www.ics.kagoshima-u.ac.jp/~fuchida/edu/algorithm/sort-algorithm/merge-sort.html)\n    - [マージソート - (MAX上における)アルゴリズム的問題におけるユーザーインターフェースの改良](http://www.th.cs.meiji.ac.jp/assets/researches/2005/omoto/mergesort.html)\n- Quick Sort\n    - [Quicksort - Wikipedia](https://en.wikipedia.org/wiki/Quicksort)\n    - [QuickSort - GeeksforGeeks](https://www.geeksforgeeks.org/quick-sort/)\n    - [クイックソート](http://www.ics.kagoshima-u.ac.jp/~fuchida/edu/algorithm/sort-algorithm/quick-sort.html)\n    - [クイックソート - (MAX上における)アルゴリズム的問題におけるユーザーインターフェースの改良](http://www.th.cs.meiji.ac.jp/assets/researches/2005/omoto/quicksort.html)\n- Radix Sort\n    - [Radix Sort | GeeksforGeeks](https://www.youtube.com/watch?v=nu4gDuFabIM)\n    - [基数ソート](http://www.ics.kagoshima-u.ac.jp/~fuchida/edu/algorithm/sort-algorithm/radix-sort.html)\n- Selection Sort\n    - [Selection sort - Wikipedia](https://en.wikipedia.org/wiki/Selection_sort)\n    - [Selection Sort - GeeksforGeeks](https://www.youtube.com/watch?v=xWBP4lzkoyM)\n- Shell Sort\n    - [Shell Sort | GeeksforGeeks](https://www.youtube.com/watch?v=SHcPqUe2GZM)\n- Videos\n    - [Bubble Sort | GeeksforGeeks](https://www.youtube.com/watch?v=nmhjrI-aW5o)\n    - [Quick Sort | GeeksforGeeks](https://www.youtube.com/watch?v=PgBzjlCcFvc)\n- OnlineJudge\n    - [Sorting - HackerRank](https://www.hackerrank.com/domains/algorithms?filters%5Bsubdomains%5D%5B%5D=arrays-and-sorting)\n    - [Sort - LeetCode](https://leetcode.com/tag/sort/)\n\n\n### Dynamic Programming\n\n- [Dynamic Programming - GeeksforGeeks](https://www.geeksforgeeks.org/dynamic-programming/)\n- [Recent Articles on Dynamic Programming - GeeksforGeeks](https://www.geeksforgeeks.org/category/algorithm/dynamic-programming/)\n- [Longest common subsequence problem](https://en.wikipedia.org/wiki/Longest_common_subsequence_problem)\n- [プログラミングコンテストでの動的計画法 ](https://www.slideshare.net/iwiwi/ss-3578511)\n- [典型的な DP (動的計画法) のパターンを整理 Part 1 ～ ナップサック DP 編 ～](https://qiita.com/drken/items/a5e6fe22863b7992efdb)\n- [動的計画法超入門！ Educational DP Contest の A ～ E 問題の解説と類題集](https://qiita.com/drken/items/dc53c683d6de8aeacf5a)\n- [部分列 DP --- 文字列の部分文字列を重複なく走査する DP の特集](https://qiita.com/drken/items/a207e5ae3ea2cf17f4bd)\n- Videos\n- OnlineJudge\n    - [Dynamic Programming - HackerRank](https://www.hackerrank.com/domains/algorithms?filters%5Bsubdomains%5D%5B%5D=dynamic-programming)\n    - [Dynamic Programming - GeeksforGeeks](https://practice.geeksforgeeks.org/explore/?category%5B%5D=Dynamic%20Programming\u0026page=1\u0026sortBy=accuracy)\n    - [Dynamic Programming - LeetCode](https://leetcode.com/tag/dynamic-programming/)\n\n\n### Greedy\n\n- [Greedy algorithm - Wikipedia](https://en.wikipedia.org/wiki/Greedy_algorithm)\n- [Greedy Algorithms - GeeksforGeeks](https://www.geeksforgeeks.org/greedy-algorithms/)\n- [Recent Articles on Greedy Algorithms - GeeksforGeeks](https://www.geeksforgeeks.org/greedy-algorithms/)\n- [Minimum Spanning Tree](http://www.cs.princeton.edu/courses/archive/spr07/cos226/lectures/mst.pdf)\n- [ICS 161: Design and Analysis of Algorithms](https://www.ics.uci.edu/~eppstein/161/960206.html)\n- [Activity selection problem - Wikipedia](https://en.wikipedia.org/wiki/Activity_selection_problem)\n- [Egyptian Fractions](http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fractions/egyptian.html)\n- [最適化基礎 第８回 最小全域木問題](http://www.me.titech.ac.jp/~shioura/shioura/teaching/opt15/optim15-08.pdf)\n- OnlineJudge\n    - [Greedy - HackerRank](https://www.hackerrank.com/domains/algorithms?filters%5Bsubdomains%5D%5B%5D=greedy)\n    - [Greedy - GeeksforGeeks](https://practice.geeksforgeeks.org/explore/?category%5B%5D=Greedy\u0026page=1\u0026sortBy=accuracy)\n    - [Greedy - LeetCode](https://leetcode.com/tag/greedy/)\n\n\n### Bit Manipulation\n\n- [Bitwise Algorithms - GeeksforGeeks](https://www.geeksforgeeks.org/bitwise-algorithms/)\n- [Recent Articles on Bit Algorithms - GeeksforGeeks](https://www.geeksforgeeks.org/category/bit-magic/)\n- [Bitwise Operators in C/C++ - GeeksforGeeks](https://www.geeksforgeeks.org/bitwise-operators-in-c-cpp/)\n- [Bitwise Hacks for Competitive Programming - GeeksforGeeks](https://www.geeksforgeeks.org/bitwise-hacks-for-competitive-programming/)\n- [Bit Tricks for Competitive Programming - GeeksforGeeks](https://www.geeksforgeeks.org/bit-tricks-competitive-programming/)\n- [Bit Twiddling Hacks](http://graphics.stanford.edu/~seander/bithacks.html)\n    - [Counting bits set, Brian Kernighan's way](https://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetKernighan)\n- [Two's complement - Wikipedia](https://en.wikipedia.org/wiki/Two%27s_complement)\n- [Karatsuba algorithm - Wikipedia](https://en.wikipedia.org/wiki/Karatsuba_algorithm)\n- [二進法と十進法の変換方法と計算例](https://mathtrain.jp/binary)\n- [すごくシンプルなハミング距離計算](https://tech-blog.cerevo.com/archives/228/)\n- [ビット演算 (bit 演算) の使い方を総特集！ 〜 マスクビットから bit DP まで 〜](https://qiita.com/drken/items/7c6ff2aa4d8fce1c9361)\n- OnlineJudge\n    - [Bit Manipulation - HackerRank](https://www.hackerrank.com/domains/algorithms?filters%5Bsubdomains%5D%5B%5D=bit-manipulation)\n    - [Bit Magic - GeeksforGeeks](https://practice.geeksforgeeks.org/explore/?category%5B%5D=Bit%20Magic\u0026page=1\u0026sortBy=accuracy)\n    - [Bit Manipulation - LeetCode](https://leetcode.com/tag/bit-manipulation/)\n\n\n### Recursion\n\n- OnlineJudge\n    - [Recursion - LeetCode](https://leetcode.com/tag/recursion/)\n\n\n### Backtracking\n\n- [Backtracking - Wikipedia](https://en.wikipedia.org/wiki/Backtracking)\n- [Backtracking Algorithms - GeeksforGeeks](https://www.geeksforgeeks.org/backtracking-algorithms/)\n- [バックトラック法 - アドバンスド プログラミング](http://www.cc.kyoto-su.ac.jp/~yamada/ap/ap.html)\n- [バックトラック法 - ソフトウェア科学研究室](http://www.ss.cs.meiji.ac.jp/index.html)\n- OnlineJudge\n    - [Backtracking - GeeksforGeeks](https://practice.geeksforgeeks.org/explore/?category%5B%5D=Backtracking\u0026page=1\u0026sortBy=accuracy)\n    - [Backtracking - LeetCode](https://leetcode.com/tag/backtracking/)\n\n\n\n## Data Structures\n\n### Array\n\n- [Maximum subarray problem - Wikipedia](https://en.wikipedia.org/wiki/Maximum_subarray_problem)\n- [Recent Articles on Arrays](https://www.geeksforgeeks.org/category/c-arrays/)\n- [Array Data Structure - GeeksforGeeks](https://www.geeksforgeeks.org/array-data-structure/)\n    - [Array Rearrangement - GeeksforGeeks](https://www.geeksforgeeks.org/array-data-structure/array-rearrangement/)\n    - [Array | Order Statistics - GeeksforGeeks](https://www.geeksforgeeks.org/array-data-structure/array-order-statistics/)\n    - [Array | Range Queries - GeeksforGeeks](https://www.geeksforgeeks.org/array-data-structure/array-range-queries/)\n    - [Array | Sorting - GeeksforGeeks](https://www.geeksforgeeks.org/array-data-structure/array-sorting/)\n    - [Array | Searching - GeeksforGeeks](https://www.geeksforgeeks.org/array-data-structure/array-searching/)\n- OnlineJudge\n    - [Arrays - HackerRank](https://www.hackerrank.com/domains/data-structures?filters[subdomains][]=arrays)\n    - [Arrays - GeeksforGeeks](https://practice.geeksforgeeks.org/explore/?category%5B%5D=Arrays\u0026page=1\u0026sortBy=accuracy)\n    - [Array - LeetCode](https://leetcode.com/tag/array/)\n\n\n### Matrix\n\n- [Matrix Archives - GeeksforGeeks](https://www.geeksforgeeks.org/matrix/)\n \n\n### Hash Table\n\n- [Hashing Data Structure - GeeksforGeeks](https://www.geeksforgeeks.org/hashing-data-structure/)\n- [Hashing](http://www.cs.princeton.edu/~rs/AlgsDS07/10Hashing.pdf)\n- OnlineJudge\n    - [Hash Table - LeetCode](https://leetcode.com/tag/hash-table/)\n\n\n### Stack\n\n- [Stack Data Structure - GeeksforGeeks](https://www.geeksforgeeks.org/stack-data-structure/)\n- Videos\n- OnlineJudge\n    - [Stack - LeetCode](https://leetcode.com/tag/stack/)\n\n\n### Queue\n\n- [Priority queue - Wikipedia](https://en.wikipedia.org/wiki/Priority_queue)\n- [Queue Data Structure - GeeksforGeeks](https://www.geeksforgeeks.org/queue-data-structure/)\n- Videos\n- OnlineJudge\n    - [Queue - LeetCode](https://leetcode.com/tag/queue/)\n\n\n### Heap\n\n- [Heap Data Structure- GeeksforGeeks](https://www.geeksforgeeks.org/heap-data-structure/)\n- [An array implementation of a heap](https://cs.nyu.edu/courses/spring12/CSCI-GA.3033-014/Assignment3/heap.html)\n- [ヒープ : データ構造 - ソースコード探検隊](https://www.codereading.com/algo_and_ds/ds/heap.html)\n- Videos\n- OnlineJudge\n    - [Heap - HackerRank](https://www.hackerrank.com/domains/data-structures?filters%5Bsubdomains%5D%5B%5D=heap)\n    - [Heap - GeeksforGeeks](https://practice.geeksforgeeks.org/explore/?category%5B%5D=Heap\u0026page=1\u0026sortBy=accuracy)\n    - [Heap - LeetCode](https://leetcode.com/tag/heap/)\n\n\n### Graph\n\n- [Graph Data Structure And Algorithms - GeeksforGeeks](https://www.geeksforgeeks.org/graph-data-structure-and-algorithms/)\n- [Floyd–Warshall algorithm - Wikipedia](https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm)\n- OnlineJudge\n    - [Graph Theory - HackerRank](https://www.hackerrank.com/domains/algorithms?badge_type=problem-solving\u0026filters%5Bsubdomains%5D%5B%5D=graph-theory)\n    - [Graph - GeeksforGeeks](https://practice.geeksforgeeks.org/explore/?category%5B%5D=Graph\u0026page=1)\n    - [Graph - LeetCode](https://leetcode.com/tag/graph/)\n\n\n### Tree\n\n- [Binary tree - Wikipedia](https://en.wikipedia.org/wiki/Binary_tree)\n- [Binary Tree Data Structure - GeeksforGeeks](https://www.geeksforgeeks.org/binary-tree-data-structure/)\n    - [Binary Tree | Traversal - GeeksforGeeks](https://www.geeksforgeeks.org/binary-tree-data-structure/binary-tree-traversal/)\n- [Binary search tree - Wikipedia](https://en.wikipedia.org/wiki/Binary_search_tree)\n- [Binary Search Tree - GeeksforGeeks](https://www.geeksforgeeks.org/binary-search-tree-data-structure/)\n- [プログラミングコンテストでのデータ構造 2　～平衡二分探索木編～](https://www.slideshare.net/iwiwi/2-12188757)\n- Videos\n    - [Binary tree traversal: Preorder, Inorder, Postorder - mycodeschool](https://www.youtube.com/watch?v=gm8DUJJhmY4\u0026t=12s)\n    - [Check if a binary tree is binary search tree or not - mycodeschool](https://www.youtube.com/watch?v=yEwSGhSsT0U)\n    - [Delete a node from Binary Search Tree - mycodeschool](https://www.youtube.com/watch?v=gcULXE7ViZw)\n    - [Find height of a binary tree - mycodeschool](https://www.youtube.com/watch?v=_pnqMz5nrRs)\n    - [Inorder Successor in a binary search tree - mycodeschool](https://www.youtube.com/watch?v=5cPbNCrdotA)\n    - [A program to check if a binary tree is BST or not | GeeksforGeeks](https://www.youtube.com/watch?v=H13iz0rbeeo\u0026t=36s)\n    - [Check if two nodes are on same path in a tree | GeeksforGeeks](https://www.youtube.com/watch?v=BfcmGeCkazc\u0026t=7s)\n    - [Tree Traversals | GeeksforGeeks](https://www.youtube.com/watch?v=IpyCqRmaKW4\u0026t=277s)\n    - [Level Order Tree Traversal | GeeksforGeeks](https://www.youtube.com/watch?v=kQ-aoKbGKSo\u0026t=16s)\n    - [Inorder Tree Traversal without Recursion | GeeksforGeeks](https://www.youtube.com/watch?v=VsxLHGUqAKs\u0026t=12s)\n    - [Prim's Algorithm for Minimum Spanning Tree | GeeksforGeeks](https://www.youtube.com/watch?v=PzznKcMyu0Y)\n    - [Applications of Minimum Spanning Tree Problem | GeeksforGeeks](https://www.youtube.com/watch?v=0tBzHYoTfiY)\n    - [Binary Search Tree | Set 1 (Search and Insertion) | GeeksforGeeks](https://www.youtube.com/watch?v=qYo8BVxtoH4)\n    - [Binary Search Tree | Set 2 (Delete) | GeeksforGeeks](https://www.youtube.com/watch?v=puyl7MBqPIg)\n    - [Kruskal’s Algorithm for Minimum Spanning Tree | GeeksforGeeks](https://www.youtube.com/watch?v=3rrNH_AizMA)\n    - [Count half nodes in a Binary tree | GeeksforGeeks](https://www.youtube.com/watch?v=gP1tpbpvGyU)\n    - [Suffix Tree - Introduction | GeeksforGeeks](https://www.youtube.com/watch?v=N70NPX6xgsA)\n    - [Count leaf nodes in a Binary Tree (Iterative Method) | GeeksforGeeks](https://www.youtube.com/watch?v=N2mV5p8NOVw)\n    - [Iterative method to Count full nodes in a Binary tree | GeeksforGeeks](https://www.youtube.com/watch?v=yDY1Nfi0ipo)\n    - [Print Postorder traversal from given Inorder and Preorder traversals](https://www.youtube.com/watch?v=BEbX2fEl4W0)\n- OnlineJudge\n    - [Tree - HackerRank](https://www.hackerrank.com/domains/data-structures?filters%5Bsubdomains%5D%5B%5D=trees\u0026badge_type=problem-solving)\n    - [Tree - GeeksforGeeks](https://practice.geeksforgeeks.org/explore/?category%5B%5D=Tree\u0026page=1\u0026sortBy=accuracy)\n    - [Tree - LeetCode](https://leetcode.com/tag/tree/)\n\n\n### Linked List\n\n- [Linked List Data Structure - GeeksforGeeks](https://www.geeksforgeeks.org/data-structures/linked-list/)\n    - [Singly Linked List - GeeksforGeeks](https://www.geeksforgeeks.org/data-structures/linked-list/singly-linked-list/)\n    - [Doubly Linked List - GeeksforGeeks](https://www.geeksforgeeks.org/data-structures/linked-list/doubly-linked-list/)\n- [Linked list - Wikipedia](https://en.wikipedia.org/wiki/Linked_list)\n- [Linked Lists](https://www.cs.cmu.edu/~adamchik/15-121/lectures/Linked%20Lists/linked%20lists.html)\n- [Linked List Basics](http://cslibrary.stanford.edu/103/LinkedListBasics.pdf)\n- [線形リスト](http://www.cc.kyoto-su.ac.jp/~yamada/ap/list.html)\n- [プログラミング通論’18＃7 –単連結リスト](http://www.edu.cc.uec.ac.jp/~ka002689/prog18/siryou/ohp07.pdf)\n- SkipList\n    - [Skip list - Wikipedia](https://en.wikipedia.org/wiki/Skip_list)\n    - [Lecture 12: Skip Lists - MIT OpenCourseWare](https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video-lectures/lecture-12-skip-lists/)\n- Videos\n    - [Introduction to linked list - mycodeschool](https://www.youtube.com/watch?v=NobHlGUjV3g)\n    - [Data Structures: Arrays vs Linked Lists - mycodeschool](https://www.youtube.com/watch?v=lC-yYCOnN8Q)\n    - [Linked List - Implementation in C/C++ - mycodeschool](https://www.youtube.com/watch?v=vcQIFT79_50)\n    - [Linked List in C/C++ - Inserting a node at beginning - mycodeschool](https://www.youtube.com/watch?v=cAZ8CyDY56s)\n    - [Linked List in C/C++ - Insert a node at nth position - mycodeschool](https://www.youtube.com/watch?v=IbvsNF22Ud0)\n    - [Linked List in C/C++ - Delete a node at nth position - mycodeschool](https://www.youtube.com/watch?v=Y0n86K43GO4)\n    - [Reverse a linked list - Iterative method - mycodeschool](https://www.youtube.com/watch?v=sYcOK51hl-A)\n    - [Print elements of a linked list in forward and reverse order using recursion - mycodeschool](https://www.youtube.com/watch?v=K7J3nCeRC80)\n    - [Reverse a linked list using recursion - mycodeschool](https://www.youtube.com/watch?v=KYH83T4q6Vs)\n    - [Reverse a string or linked list using stack. - mycodeschool](https://www.youtube.com/watch?v=hNP72JdOIgY)\n    - [Data structures: Introduction to Doubly Linked List - mycodeschool](https://www.youtube.com/watch?v=JdQeNxWCguQ)\n    - [Doubly Linked List - Implementation in C/C++ - mycodeschool](https://www.youtube.com/watch?v=VOQNf1VxU3Q)\n    - [Data structures: Linked List implementation of Queue - mycodeschool](https://www.youtube.com/watch?v=A5_XdiK4J8A)\n    - [Find merge point of two linked list - mycodeschool](https://www.youtube.com/watch?v=gE0GopCq378\u0026t=57s)\n    - [Add 1 to a number represented as linked list | GeeksforGeeks](https://www.youtube.com/watch?v=utc8bwTDjLk\u0026t=22s)\n    - [Delete N nodes after M nodes of a linked list | GeeksforGeeks](https://www.youtube.com/watch?v=PpY_C_NSNwk\u0026t=17s)\n    - [Rearrange a linked list such that all even and odd positioned nodes are together | GeeksforGeeks](https://www.youtube.com/watch?v=IUKRzbJac9o\u0026t=277s)\n    - [Decimal Equivalent of Binary Linked List | GeeksforGeeks](https://www.youtube.com/watch?v=k9x5UjTYi5I\u0026t=9s)\n    - [Check if a linked list is Circular Linked List | GeeksforGeeks](https://www.youtube.com/watch?v=ce2rnhkNLzU\u0026t=14s)\n    - [Linked List | Set 1 (Introduction) | GeeksforGeeks](https://www.youtube.com/watch?v=ge8iG7JecR4\u0026t=30s)\n    - [Linked List vs Array | GeeksforGeeks](https://www.youtube.com/watch?v=QRpbNTKH6XY\u0026t=15s)\n    - [Linked List | Set 2 (Inserting a node) | GeeksforGeeks](https://www.youtube.com/watch?v=zgCROSijBRw\u0026t=14s)\n    - [Linked List | Set 3 (Deleting a node) | GeeksforGeeks](https://www.youtube.com/watch?v=DoNRZTumxB0\u0026t=15s)\n    - [Delete a Linked List node at a given position | GeeksforGeeks](https://www.youtube.com/watch?v=BrjLWNuJ3HA\u0026t=5s)\n    - [Flattening a Linked List | GeeksforGeeks](https://www.youtube.com/watch?v=PSKZJDtitZw\u0026t=244s)\n    - [Detection of Loop in a Linked List | GeeksforGeeks](https://www.youtube.com/watch?v=Aup0kOWoMVg\u0026t=12s)\n    - [Find Length of a Linked List (Iterative and Recursive) | GeeksforGeeks](https://www.youtube.com/watch?v=kX_OJsOcK8Q\u0026t=14s)\n    - [Write a function to get Nth node in a Linked List | GeeksforGeeks](https://www.youtube.com/watch?v=iyOh1IWXnq4\u0026t=18s)\n    - [Write a recursive function to print reverse of a Linked List | GeeksforGeeks](https://www.youtube.com/watch?v=bbbnyIDHeR8)\n    - [Search an element in a Linked List (Iterative and Recursive) | GeeksforGeeks](https://www.youtube.com/watch?v=7sikRsNcqgM\u0026t=16s)\n    - [Write a function to delete a Linked List | GeeksforGeeks](https://www.youtube.com/watch?v=aV3s3fkriWY\u0026t=3s)\n    - [Detect and Remove Loop in a Linked List | GeeksforGeeks](https://www.youtube.com/watch?v=_BG9rjkAXj8)\n    - [Add two numbers represented by Linked Lists | Set 1 | GeeksforGeeks](https://www.youtube.com/watch?v=LLPuC5kWD8U)\n    - [Swap nodes in a linked list without swapping data | GeeksforGeeks](https://www.youtube.com/watch?v=V4ZHvhvVmSE)\n    - [Merge two sorted linked lists | GeeksforGeeks](https://www.youtube.com/watch?v=odUJXFJR6Q4)\n    - [Reversing a linked list | GeeksforGeeks](https://www.youtube.com/watch?v=D7y_hoT_YZI)\n    - [Find the middle of a given linked list | GeeksforGeeks](https://www.youtube.com/watch?v=BrmGrIPGbgk)\n    - [Compare two strings represented as linked lists | GeeksforGeeks](https://www.youtube.com/watch?v=DSfnJ3iF1U4)\n    - [Check whether the length of given linked list is Even or Odd | GeeksforGeeks](https://www.youtube.com/watch?v=IT60llgYHn0)\n    - [Sort a linked list of 0s, 1s and 2s | GeeksforGeeks](https://www.youtube.com/watch?v=4-3TU2FRs70)\n    - [Find smallest and largest elements in singly linked list | GeeksforGeeks](https://www.youtube.com/watch?v=mMRwCeWPI1c)\n    - [Remove duplicates from a sorted linked list | GeeksforGeeks](https://www.youtube.com/watch?v=j3Kd06VfJhw)\n    - [Find modular node in a linked list | GeeksforGeeks](https://www.youtube.com/watch?v=LNryat2UNXo)\n    - [Delete middle of linked list | GeeksforGeeks](https://www.youtube.com/watch?v=3HRCz3w-7rw)\n    - [Move last element to front of a given Linked List | GeeksforGeeks](https://www.youtube.com/watch?v=vNa7-4aGxCI)\n    - [Insert a whole linked list into other at k-th position | GeeksforGeeks](https://www.youtube.com/watch?v=lOQ-hZLje2s)\n    - [Make middle node head in a linked list | GeeksforGeeks](https://www.youtube.com/watch?v=rCdGb1ufHUA)\n    - [Count rotations in sorted and rotated linked list | GeeksforGeeks](https://www.youtube.com/watch?v=sqdrHv4Yw6c)\n    - [Pairwise swap elements of a given linked list | GeeksforGeeks](https://www.youtube.com/watch?v=bN8nk4ZXzK0)\n    - [Remove every k-th node of the linked list | GeeksforGeeks](https://www.youtube.com/watch?v=o-_r86WD3Qo)\n    - [Check if a linked list of strings forms a palindrome | GeeksforGeeks](https://www.youtube.com/watch?v=Ga9iLtMKhKo)\n    - [Delete a linked list using recursion | GeeksforGeeks](https://www.youtube.com/watch?v=4fyh_ddRyRE)\n    - [Make a loop at k-th position in a linked list | GeeksforGeeks](https://www.youtube.com/watch?v=ZgeHNHo2RAM)\n    - [Identical Linked Lists | GeeksforGeeks](https://www.youtube.com/watch?v=E8V0mFt4KBA)\n    - [Multiply two numbers represented by Linked Lists | GeeksforGeeks](https://www.youtube.com/watch?v=XVm27KGy4Fw)\n    - [Rotate a Linked List | GeeksforGeeks](https://www.youtube.com/watch?v=tWtq2nd7sI4)\n    - [Recursive function to delete k-th node from linked list | GeeksforGeeks](https://www.youtube.com/watch?v=EWkox1WR4VU)\n    - [First non-repeating integer in a linked list | GeeksforGeeks](https://www.youtube.com/watch?v=lnA26dsi3IU)\n    - [Convert singly linked list into circular linked list | GeeksforGeeks](https://www.youtube.com/watch?v=hLz1HXsuyvw)\n    - [Find the length of loop in linked list | GeeksforGeeks](https://www.youtube.com/watch?v=n6AMo1qFPlA)\n    - [Sort linked list which is already sorted on absolute values | GeeksforGeeks](https://www.youtube.com/watch?v=hH4XI0INmNg)\n    - [Print the alternate nodes of linked list (Iterative Method) | GeeksforGeeks](https://www.youtube.com/watch?v=htsTNo6n9Uc)\n    - [Delete alternate nodes of a Linked List | GeeksforGeeks](https://www.youtube.com/watch?v=q5_qDnl7pSo)\n    - [Sort a linked list of 0s, 1s and 2s by changing links | GeeksforGeeks](https://www.youtube.com/watch?v=TXRoiRMWiOE)\n    - [Print alternate nodes of a linked list using recursion | GeeksforGeeks](https://www.youtube.com/watch?v=ksyUny54Avk)\n    - [Reverse each word in a linked list node | GeeksforGeeks](https://www.youtube.com/watch?v=ybT1uiWQYAs)\n    - [Circular Linked List | Set 1 (Introduction and Applications) | GeeksforGeeks](https://www.youtube.com/watch?v=XqwllvAx8NY)\n    - [Sorted insert for circular linked list | GeeksforGeeks](https://www.youtube.com/watch?v=ANbJdUBIVRU)\n    - [First common element in two linked lists | GeeksforGeeks](https://www.youtube.com/watch?v=3MpoDZBzSMA)\n    - [Reverse first K elements of given linked list | GeeksforGeeks](https://www.youtube.com/watch?v=xSKFS5OA5JQ)\n    - [Reverse a Linked List in groups of given size | Set 2 | GeeksforGeeks](https://www.youtube.com/watch?v=aF9PGkR0dWU)\n- OnlineJudge\n    - [Linked List - HackerRank](https://www.hackerrank.com/domains/data-structures?filters%5Bsubdomains%5D%5B%5D=linked-lists\u0026badge_type=problem-solving)\n    - [Linked List - GeeksforGeeks](https://practice.geeksforgeeks.org/explore/?category%5B%5D=Linked%20List\u0026page=1\u0026sortBy=accuracy)\n    - [Linked List - LeetCode](https://leetcode.com/tag/linked-list/)\n\n\n## Math\n\n- [Mathematical Algorithms - GeeksforGeeks](https://www.geeksforgeeks.org/mathematical-algorithms/)\n    - [Mathematical Algorithms | GCD \u0026 LCM - GeeksforGeeks](https://www.geeksforgeeks.org/mathematical-algorithms/mathematical-algorithms-gcd-lcm/)\n    - [Mathematical Algorithms | Prime Factorization and Divisors](https://www.geeksforgeeks.org/mathematical-algorithms/mathematical-algorithms-prime-factorization-divisors/)\n- [Recent articles on Mathematical Algorithms - GeeksforGeeks](https://www.geeksforgeeks.org/mathematical-algorithms/)\n- [Power set - Wikipedia](https://en.wikipedia.org/wiki/Power_set)\n- [Harshad number - Wikipedia](https://en.wikipedia.org/wiki/Harshad_number)\n- [Prime number - Wikipedia](https://en.wikipedia.org/wiki/Prime_number)\n- [Euclidean algorithm - Wikipedia](https://en.wikipedia.org/wiki/Euclidean_algorithm)\n- [三角形の成立条件とその証明](https://mathtrain.jp/seiritu)\n- [やさしい整数論](https://www.slideshare.net/kazumamikami1/ss-24712271)\n- [統計検定 1 級に合格する方法](https://qiita.com/drken/items/089b8443305df047b44e)\n\n## Misc\n\n- [Digital root - Wikipedia](https://en.wikipedia.org/wiki/Digital_root)\n- [Morse code - Wikipedia](https://en.wikipedia.org/wiki/Morse_code)\n- [Hamming distance - Wikipedia](https://en.wikipedia.org/wiki/Hamming_distance)\n- [計算量とオーダー](https://www.slideshare.net/KMC_JP/cc-and-order)\n- [計算量オーダーの求め方を総整理！ 〜 どこから log が出て来るか 〜](https://qiita.com/drken/items/872ebc3a2b5caaa4a0d0)\n- [特集！知らないと損をする計算量の話](https://qiita.com/drken/items/18b3b3db5735241465ef)\n- OnlineJudge\n    - [Misc - GeeksforGeeks](https://practice.geeksforgeeks.org/explore/?category%5B%5D=Misc\u0026page=1\u0026sortBy=accuracy)\n\n## Languages\n\n### C++\n\n- [cin - C++ Reference](http://www.cplusplus.com/reference/iostream/cin/)\n- [deque - C++ Reference](http://www.cplusplus.com/reference/deque/deque/)\n- [endl - C++ Reference](http://www.cplusplus.com/reference/ostream/endl/)\n- [lower_bound - C++ Reference](http://www.cplusplus.com/reference/algorithm/lower_bound/)\n- [map - C++ Reference](http://www.cplusplus.com/reference/map/map/)\n- [pair - C++ Reference](http://www.cplusplus.com/reference/utility/pair/)\n- [printf - C++ Reference](http://www.cplusplus.com/reference/cstdio/printf/)\n- [scanf - C++ Reference](http://www.cplusplus.com/reference/cstdio/scanf/)\n- [vector - C++ Reference](http://www.cplusplus.com/reference/vector/vector/)\n- [C++ Programming Language - GeeksforGeeks](https://www.geeksforgeeks.org/c-plus-plus/)\n- OnlineJudge\n    - [C++ - HackerRank](https://www.hackerrank.com/domains/cpp)\n\n### Java\n\n- [How to get rid of Java TLE problem](https://www.geeksforgeeks.org/how-to-get-rid-of-java-tle-problem/)\n\n### Scala\n\n- [Array - Scala Standard Library](https://www.scala-lang.org/api/2.12.8/scala/Array.html)\n- [Set - Scala Standard Library](https://www.scala-lang.org/api/current/scala/collection/Set.html)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fis2ei%2Fcoding-challenges","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fis2ei%2Fcoding-challenges","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fis2ei%2Fcoding-challenges/lists"}