Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/d-antonelli/geeks_for_geeks_dsa_solutions
Solutions to Geeks for Geeks Data Structures & Algorithms Practices
https://github.com/d-antonelli/geeks_for_geeks_dsa_solutions
algorithms data-structures geeksforgeeks javascript
Last synced: about 2 months ago
JSON representation
Solutions to Geeks for Geeks Data Structures & Algorithms Practices
- Host: GitHub
- URL: https://github.com/d-antonelli/geeks_for_geeks_dsa_solutions
- Owner: D-Antonelli
- Created: 2024-06-02T09:21:01.000Z (7 months ago)
- Default Branch: main
- Last Pushed: 2024-10-30T12:16:04.000Z (about 2 months ago)
- Last Synced: 2024-10-30T12:24:13.380Z (about 2 months ago)
- Topics: algorithms, data-structures, geeksforgeeks, javascript
- Language: JavaScript
- Homepage:
- Size: 226 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 27
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## My Profile
[](https://www.geeksforgeeks.org/user/deryaantvgm7/)
## Algorithms and Data Structures (In progress)
- [Arrays](#arrays)
- [Linked List](#linked-list)
- [Sorting](#sorting)
- [Strings](#strings)
## Arrays
| Name | Solution | Status* |
|----------------------------------------------------------------| -------- | ------- |
| 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) | 🟢 |
| 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) | 🟢 |
| [Find index](https://practice.geeksforgeeks.org/problems/find-index4752/1?page=1&difficulty[]=-2&status[]=unsolved&sortBy=submissions) | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_index.js) | 🟢 |
| [Bitonic Point](https://www.geeksforgeeks.org/problems/maximum-value-in-a-bitonic-array3001/1?page=1&company%5B%5D=Amazon&curated%5B%5D=8&sortBy=submissions) | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/bitonic_point.js) | 🟢 |
| 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) | 🟢 |
| Sum of array | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/sum_of_array.js) | 🟢 |
| Print the left element | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_the_left_over_element.js) | 🟢 |
| Frequency of array elements | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/frequencies_of_limited_range_array_elements.js) | 🟢 |
| Multiplication table | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/multiplication_table.js) | 🟢 |
| 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) | 🟢 |
| 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) | 🟢 |
| 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) | 🟢 |
| Count 0s in sorted array | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/count_the_zeros.js) | 🟢 |
| Search in sorted array | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/sorted_array_search.js) | 🟢 |
| Equilibrium point | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/equilibrium_point.js) | 🔴 |
| Left index | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/left_most_and_right_most_index.js) | 🟢 |
| Check if an array is sorted | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/check_if_array_is_sorted.js) | 🟢 |
| Print alternate elements of an array | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/alternates_in_an_array.js) | 🟢 |
| Number of occurrence | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/number_of_occurrence.js) | 🔴 |
| 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) | 🔴 |
| Missing number in an array | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/missing_in_array.js) | 🟢 |
| 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) | 🟢 |
| Product of array element | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/product_of_array_elements.js) | 🔴 |
| 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) | 🟢 |
| Count Occurrence of digit k | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/count_occurrence_of_digit_k.js) | 🟢 |
| Sum of distinct element | [java](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/java/sum_of_distinct_elements.java) | 🟢 |
| Greater on right side | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/greater_on_right_side.js) | 🟢 |
| Minimum product pair | [java](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/java/minimum_product_pair.java) | 🟢 |
| Find unique element | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_unique_element.js) | 🔴 |
| Remove duplicate elements | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/remove_duplicate.js) | 🔴 |
| Check if two arrays are equals | [java](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/java/search_element_in_array.java) | 🟢 |
| Min and Max in Array | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/min_and_max_in_array.js) | 🟢 |
| Is array sorted | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/check_if_array_is_sorted.js) | 🟢 |
| Balanced array | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/balanced_array.js) | 🟢 |
| Merge two sorted arrays O(1) space | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/merge_two_sorted_arrays.js) | 🔴 |
| Union of two sorted array | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/union_of_two_sorted_array.js) | 🔴 |
| Index of an extra element | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/index_of_an_extra_element.js) | 🟢 |
| Binary array sorting | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/binary_array_sorting.js) | 🟢 |
| Find transition point | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_transition_point.js) | 🟢 |
| Find the median | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_the_median.js) | 🟢 |
| Rotate array by n elements | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/rotate_array.js) | 🔴 |
| Count Odd Even | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/count_odd_even.js) | 🟢 |
| Reverse array in groups | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/reverse_array_in_groups.js) | 🟢 |
| Need some change | [java](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/java/need_some_change.java) | 🟢 |
| Find the frequency | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_the_frequency.js) | 🟢 |
| Immediate smaller element | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/immediate_smaller_element.js) | 🟢 |
| Count smaller elements | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/count_smaller_elements.js) | 🔴 |
| Buildings receiving sunlight | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/buildings_receiving_sunlight.js) | 🟢 |
| Kth Smallest Element | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/kth_smallest.js) | 🟢 |
| Alone in Couple | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/party_of_couples.js) | 🟢 |
| Index of the first repeating element | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/first_repeating_element.js) | 🟢 |
| 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) | 🟢 |
| Replace all 0's with 5 | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/replace-os-with-5s.js) | 🟢 |
| Third largest element | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/third_largest_element.js) | 🟢 |
| Find Duplicates in an Array | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/array_duplicates.js) | 🟢 |
| Majority Element | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/majority_element.js) | 🟢 |
## Linked List
| Name | Solution | Status |
|----------------------------------------------------------------| -------- | ------- |
| Fractional linked list | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/fractional_linked_list.js) | 🟢 |
Print Linked List elements | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/print_linked_list_elements.js) | 🟢 |
Kth from End of Linked List | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/kth_from_end_of_linked_list.js) | 🟢 |
Adds two numbers represented by linkedln list | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/adds_two_numbers_represented_by_linkedln_list.js) | 🟢 |
[Sum of nodes](https://www.geeksforgeeks.org/problems/find-the-sum-of-last-n-nodes-of-the-linked-list/1?itm_source=geeksforgeeks&itm_medium=article&itm_campaign=practice_card) | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/sum_of_last_n_nodes.js) | 🟢 |
[Intersaction point in y shapped linked list](https://www.geeksforgeeks.org/problems/intersection-point-in-y-shapped-linked-lists/1?track=DSASP-LinkedList&batchId=154) | | 🔴 |
Remove duplicates from an unsorted linked list | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/remove_duplicates_from_an_unsorted_linked_list.js) | 🟢 |
Pair swap of a linked list | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/pairwise_swap_elements_of_a_linked_list.js) | 🟢 |
Find nk-th node in linked list | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_nk-th_node_in_linked_list.js) | 🟢 |
Linked list insert | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/linked_list_insertion_at_end.js) | 🟢 |
Sorted insert for circular linked list | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/sorted_insert_for_circular_linked_list.js) | 🟢 |
Merge two sorted linked lists | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/merge_two_sorted_linked_lists.js) | 🟢 |
Modular Node | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/modular_node.js) | 🟢 |
Delete middle of linked list | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/delete_middle_of_linked_list.js) | 🟢 |
Delete 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) | 🟢 |
Insert in middle of linked list | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/insert_in_middle_of_linked_list.js) | 🟢 |
Search in Linked list | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/search_in_linked_list.js) | 🟢 |
Count Linked List Nodes | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/count_linked_list_nodes.js) | 🟢 |
Occurence of an integer in a Linked List | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/occurence_of_an_integer_in_a_linked_list.js) | 🟢 |
Identical Linked Lists | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/identical_linked_lists.js) | 🟢 |
Insert in sorted linked list | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/insert_in_a_sorted_list.js) | 🟢 |
linked-list-length-even-or-odd | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/linked-list-length-even-or-odd.js) | 🟢 |
Middle of a Linked List | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/middle_of_a_linked_list.js) | 🟢 |
Check If Circular Linked List | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/check_if_circular_linked_list.js) | 🟢 |
Reverse a Linked List | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/reverse_a_linked_list.js) | 🟢 |
Detect Loop in linked list | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/detect_loop_in_linked_list.js) | 🟢 |
Remove loop from Linked List | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/remove_loop_from_linked_list.js) | 🟢 |
Palindrome Linked List | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/palindrome_linked_list.js) | 🟢 |
Find lenght of a loop | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_lenght_of_a_loop.js) | 🟢 |
Linked List that is Sorted Alternatingly | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_lenght_of_a_loop.js) | 🟢 |
## Sorting
| Name | Solution | Status |
|----------------------------------------------------------------| -------- | ------- |
JavaScript generic sort | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/javascript_generic_sort.js) | 🟢 |
Maximum product of two numbers | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/maximum_product_of_two_numbers.js) | 🟢 |
Count the zeros | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/count_the_zeros.js) | 🟢 |
Bubble sort | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/bubble_sort.js) | 🟢 |
Rotate Matrix by 90 degrees | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/rotate_image.js) | 🟢 |
Merge sort | JavaScript
Binary array sorting | JavaScript
## Strings
| Name | Solution | Status |
|----------------------------------------------------------------| -------- | ------- |
Naive Pattern Search | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/naive_pattern_search.js) | 🟢 |
[Lower case](https://www.geeksforgeeks.org/problems/java-convert-string-to-lowercase2313/1) | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/convert_string_to_lowercase.js) | 🟢 |
Find maximum number | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/find_maximum_number.js) | 🟢 |
Print first letter of every word | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/print_first_letter_of_every_word.js) | 🟢 |
Reverse string in O(1) space complexity | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/print_first_letter_of_every_word.js) | 🟢 |
Display longest name | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/display_longest_name.js) | 🟢 |
String validation
Repeat the string | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/repeat_the_string.js) | 🟢 |
Remove spaces | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/remove_spaces.js) | 🟢 |
Check string | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/check_string.js) | 🟢 |
Is Isogram | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/check_if_a_string_is_isogram_or_not.js) | 🟢 |
Check for binary | [javascript](https://github.com/D-Antonelli/mentorship_with_davide/blob/main/javascript/check_for_binary.js) | 🟢 |
Check 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) | 🟢 |
Consonant and vowals check
Lower to upper case
String validation
C friend function (anagram check)
last-index-of-1
Longest substring containg 1
Panagram checking
Repeating characer first appearance leftmost
Uppercase to lowercase
Count numnber of words in a string
Repeated chars
Count distinct vowels in a string
Length of a string
Amend the sentece
Remove 'b' and 'ac' from given string
String sort (Using Quick-sort)
Vowels in string
Check if a string is Isogram or not
Reverse words of a given string
Given two strings, check if one is the anagram of another
First and second smallest element