{"id":18849409,"url":"https://github.com/d-antonelli/geeks_for_geeks_dsa_solutions","last_synced_at":"2026-02-02T20:30:18.291Z","repository":{"id":255511460,"uuid":"809291248","full_name":"D-Antonelli/geeks_for_geeks_dsa_solutions","owner":"D-Antonelli","description":"Solutions to Geeks for Geeks Data Structures \u0026 Algorithms Practices","archived":false,"fork":false,"pushed_at":"2024-12-12T16:13:51.000Z","size":131,"stargazers_count":0,"open_issues_count":26,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-02-19T06:34:26.017Z","etag":null,"topics":["algorithms","data-structures","geeksforgeeks","javascript"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","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/D-Antonelli.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":"2024-06-02T09:21:01.000Z","updated_at":"2024-12-12T16:13:55.000Z","dependencies_parsed_at":"2024-11-25T22:45:53.476Z","dependency_job_id":null,"html_url":"https://github.com/D-Antonelli/geeks_for_geeks_dsa_solutions","commit_stats":null,"previous_names":["d-antonelli/geeks_for_geeks_dsa_solutions"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/D-Antonelli%2Fgeeks_for_geeks_dsa_solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/D-Antonelli%2Fgeeks_for_geeks_dsa_solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/D-Antonelli%2Fgeeks_for_geeks_dsa_solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/D-Antonelli%2Fgeeks_for_geeks_dsa_solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/D-Antonelli","download_url":"https://codeload.github.com/D-Antonelli/geeks_for_geeks_dsa_solutions/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239786250,"owners_count":19696772,"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":["algorithms","data-structures","geeksforgeeks","javascript"],"created_at":"2024-11-08T03:19:39.385Z","updated_at":"2026-02-02T20:30:18.259Z","avatar_url":"https://github.com/D-Antonelli.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"## My Profile\n[![GeeksForGeeks](https://img.shields.io/badge/GeeksforGeeks-gray?style=for-the-badge\u0026logo=geeksforgeeks\u0026logoColor=35914c)](https://www.geeksforgeeks.org/user/deryaantvgm7/)\n\n## Algorithms and Data Structures (In progress)\n\n- [Arrays](#arrays)\n- [Linked List](#linked-list)\n- [Sorting](#sorting)\n- [Strings](#strings)\n\n\n\n## Arrays\n\n| Name                                                           | Solution | \n|----------------------------------------------------------------| -------- | \n| Find the minimum and maximum element in an array                                                    |    [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/min_and_max_in_array.js)            \n| Find the occurrence of an integer in the array                                                    |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_the_frequency.js)               \n| [Find index](https://practice.geeksforgeeks.org/problems/find-index4752/1?page=1\u0026difficulty[]=-2\u0026status[]=unsolved\u0026sortBy=submissions)                                                     |             [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_index.js)    \n| [Bitonic Point](https://www.geeksforgeeks.org/problems/maximum-value-in-a-bitonic-array3001/1?page=1\u0026company%5B%5D=Amazon\u0026curated%5B%5D=8\u0026sortBy=submissions)                                                  |              [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/bitonic_point.js)    \n| Sum of Middle Elements of two sorted arrays                    |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/sum_of_middle_elements_of_two_sorted_arrays.js)               \n| Sum of array                                                    |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/sum_of_array.js)               \n| Print the left element                                          |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_the_left_over_element.js)               \n| Frequency of array elements                                     |    [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/frequencies_of_limited_range_array_elements.js)          \n| Multiplication table                                            |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/multiplication_table.js)               \n| Product of maximum in first array and minimum in second         |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/max_and_min_product.js)               \n| At least two greater element                                    |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/at_least_two_greater_elements.js), [python](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/python/at_least_two_greater_elements.py)              \n| Sub array with given sum (print index range of the subarray)    |    [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/subarrays_with_given_sum.js)         \n| Count 0s in sorted array                                        |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/count_the_zeros.js)               \n| Search in sorted array                                          |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/sorted_array_search.js)               \n| Equilibrium point                                               |    [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/equilibrium_point.js)          \n| Left index                                                      |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/left_most_and_right_most_index.js)               \n| Check if an array is sorted                                     |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/check_if_array_is_sorted.js)               \n| Print alternate elements of an array                            |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/alternates_in_an_array.js)               \n| Number of occurrence                                            |    [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/number_of_occurrence.js)          \n| Median of two arrays                                            |    [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/median_of_2_sorted_arrays_of_different_sizes.js)          \n| Missing number in an array                                      |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/missing_in_array.js)               \n| Sort array of 0s, 1s and 2                                      |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/sort_0s,_1s_and_2s.js)               \n| Product of array element                                        |    [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/product_of_array_elements.js)         \n| First 1 in a Sorted Binary Array                        |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/first_1_in_a_sorted_binary_array.js)               \n| Count Occurrence of digit k                                         |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/count_occurrence_of_digit_k.js)               \n| Sum of distinct element                                         |   [java](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/java/sum_of_distinct_elements.java)               \n| Greater on right side                                           |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/greater_on_right_side.js)               \n| Minimum product pair                                            |   [java](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/java/minimum_product_pair.java)               \n| Find unique element                                             |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_unique_element.js)           \n| Remove duplicate elements                                       |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/remove_duplicate.js)             \n| Check if two arrays are equals                                  |   [java](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/java/search_element_in_array.java)               \n| Min and Max in Array                                            |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/min_and_max_in_array.js)               \n| Is array sorted                                                 |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/check_if_array_is_sorted.js)               \n| Balanced array                                                  |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/balanced_array.js)               \n| Merge two sorted arrays O(1) space                              |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/merge_two_sorted_arrays.js)             \n| Union of two sorted array                                       |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/union_of_two_sorted_array.js)            \n| Index of an extra element                                       |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/index_of_an_extra_element.js)               \n| Binary array sorting                                            |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/binary_array_sorting.js)               \n| Find transition point                                           |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_transition_point.js)               \n| Find the median                                    |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_the_median.js)               \n| Rotate array by n elements                                      |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/rotate_array.js)             \n| Count Odd Even                                            |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/count_odd_even.js)               \n| Reverse array in groups                                        |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/reverse_array_in_groups.js)               \n| Need some change                                                |   [java](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/java/need_some_change.java)               \n| Find the frequency                                              |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_the_frequency.js)               \n| Immediate smaller element                                       |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/immediate_smaller_element.js)               \n| Count smaller elements                                           |   [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/count_smaller_elements.js)            \n| Buildings receiving sunlight                                   |  [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/buildings_receiving_sunlight.js)               \n| Kth Smallest Element                                            |  [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/kth_smallest.js)               \n| Alone in Couple                                                 |  [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/party_of_couples.js)               \n| Index of the first repeating element                            |  [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/first_repeating_element.js)               \n| K-th element of two sorted Arrays (merge of two arrays)         |  [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/k-th_element_of_two_arrays.js)               \n| Replace all 0's with 5                            |  [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/replace-os-with-5s.js)    \n| Third largest element                                           |  [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/third_largest_element.js)    \n| Find Duplicates in an Array                                     |  [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/array_duplicates.js)    \n| Majority Element                                                |  [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/majority_element.js)    \n\n\n## Linked List\n\n| Name                                                           | Solution | \n|----------------------------------------------------------------| -------- | \n| Fractional linked list | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/fractional_linked_list.js) \t\nPrint Linked List elements | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/print_linked_list_elements.js) \nKth from End of Linked List\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/kth_from_end_of_linked_list.js) \nAdds two numbers represented by linkedln list\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/adds_two_numbers_represented_by_linkedln_list.js) \t\n[Sum of nodes](https://www.geeksforgeeks.org/problems/find-the-sum-of-last-n-nodes-of-the-linked-list/1?itm_source=geeksforgeeks\u0026itm_medium=article\u0026itm_campaign=practice_card)\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/sum_of_last_n_nodes.js)   \n[Intersaction point in y shapped linked list](https://www.geeksforgeeks.org/problems/intersection-point-in-y-shapped-linked-lists/1?track=DSASP-LinkedList\u0026batchId=154)\t| \nRemove duplicates from an unsorted linked list\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/remove_duplicates_from_an_unsorted_linked_list.js)   \nPair swap of a linked list\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/pairwise_swap_elements_of_a_linked_list.js)   \nFind nk-th node in linked list\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_nk-th_node_in_linked_list.js)   \nLinked list insert\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/linked_list_insertion_at_end.js)   \nSorted insert for circular linked list\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/sorted_insert_for_circular_linked_list.js)   \nMerge two sorted linked lists | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/merge_two_sorted_linked_lists.js)   \nModular Node\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/modular_node.js)   \t\t\nDelete middle of linked list\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/delete_middle_of_linked_list.js)   \t\nDelete a Node in Single Linked List | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/delete_a_node_in_single_linked_list.js)   \t\t\nInsert in middle of linked list\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/insert_in_middle_of_linked_list.js)   \t\t\t\nSearch in Linked list | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/search_in_linked_list.js)   \t\nCount Linked List Nodes\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/count_linked_list_nodes.js)   \t\nOccurence of an integer in a Linked List\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/occurence_of_an_integer_in_a_linked_list.js)   \nIdentical Linked Lists\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/identical_linked_lists.js)   \nInsert in sorted linked list\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/insert_in_a_sorted_list.js)   \t\nlinked-list-length-even-or-odd\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/linked-list-length-even-or-odd.js)   \nMiddle of a Linked List\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/middle_of_a_linked_list.js)   \t\nCheck If Circular Linked List | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/check_if_circular_linked_list.js)   \nReverse a Linked List\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/reverse_a_linked_list.js)   \t\nDetect Loop in linked list\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/detect_loop_in_linked_list.js)   \nRemove loop from Linked List\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/remove_loop_from_linked_list.js)   \t\nPalindrome Linked List\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/palindrome_linked_list.js)   \nFind lenght of a loop | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_lenght_of_a_loop.js)   \t\nLinked List that is Sorted Alternatingly | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_lenght_of_a_loop.js)   \n\n## Sorting\n\n| Name                                                           | Solution | \n|----------------------------------------------------------------| -------- | \nJavaScript generic sort | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/javascript_generic_sort.js)   \nMaximum product of two numbers | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/maximum_product_of_two_numbers.js)   \nCount the zeros\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/count_the_zeros.js)   \nBubble sort\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/bubble_sort.js)   \nRotate Matrix by 90 degrees | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/rotate_image.js)   \nMerge sort\t| JavaScript\nBinary array sorting | JavaScript\n\n## Strings\n| Name                                                           | Solution | \n|----------------------------------------------------------------| -------- | \nNaive Pattern Search | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/naive_pattern_search.js)   \n[Lower case](https://www.geeksforgeeks.org/problems/java-convert-string-to-lowercase2313/1)\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/convert_string_to_lowercase.js)   \nFind maximum number\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_maximum_number.js)   \t\nPrint first letter of every word | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/print_first_letter_of_every_word.js)   \t\t\nReverse string in O(1) space complexity\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/print_first_letter_of_every_word.js)   \t\t\nDisplay longest name | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/display_longest_name.js)   \nString validation \t\t\nRepeat the string\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/repeat_the_string.js)   \t\nRemove spaces | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/remove_spaces.js)   \t\t\t\nCheck string | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/check_string.js)   \t\t\t\nIs Isogram\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/check_if_a_string_is_isogram_or_not.js)   \t\nCheck for binary  | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/check_for_binary.js)   \t\t\t\nCheck if b is an anagram of a | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/check_if_b_is_an_anagram_of_a.js)   \t\t\nLower to upper case\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/lower_to_upper_case.js) | \t\t\t\nlast-index-of-1\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/last_index_of_one.js) | \t\nLongest substring containg 1 | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/longest_substring_containg_1.js)   \t\t\nPanagram checking\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/panagram_checking.js)  \t\nRepeating characer first appearance leftmost | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/repeated_character.js)  \t\t\t\t\t\t\t\t\t\t\t\nRemove 'b' and 'ac' from given string\tRepeating characer first appearance leftmost | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/remove_'b'_and_'ac'_from_given_string.js)\t\nString sort | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/string_sort.js)\t\t\t\nVowel or Not\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/vowel_or_not.js)\t\t\nReverse words of a given string\t| [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/reverse_words_of_a_given_string.js)\t\t\t\t\nFirst and second smallest element | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/first_and_second_smallest_element.js)\t\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fd-antonelli%2Fgeeks_for_geeks_dsa_solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fd-antonelli%2Fgeeks_for_geeks_dsa_solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fd-antonelli%2Fgeeks_for_geeks_dsa_solutions/lists"}