Skip to content

fynnwilliam/workout

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

652 Commits
dynamic_programming
dynamic_programming
 
 
leetcode
leetcode
 
 
linked_list
linked_list
 
 
recursion
recursion
 
 
.clang-format
.clang-format
 
 
README.md
README.md
 
 
anagram.cpp
anagram.cpp
 
 
array.h
array.h
 
 
atoi.cpp
atoi.cpp
 
 
binary_search.cpp
binary_search.cpp
 
 
can_sum_r.cpp
can_sum_r.cpp
 
 
closest_coin.cpp
closest_coin.cpp
 
 
coin.h
coin.h
 
 
find_inorder_successor.cpp
find_inorder_successor.cpp
 
 
first_non_recurring_character.cpp
first_non_recurring_character.cpp
 
 
first_recurring_character.cpp
first_recurring_character.cpp
 
 
hanoi.cpp
hanoi.cpp
 
 
hanoi_r.cpp
hanoi_r.cpp
 
 
height_of_node.cpp
height_of_node.cpp
 
 
insertion_sort.cpp
insertion_sort.cpp
 
 
ip.cpp
ip.cpp
 
 
is_mac_address.cpp
is_mac_address.cpp
 
 
is_valid_email_address.cpp
is_valid_email_address.cpp
 
 
linear_search.cpp
linear_search.cpp
 
 
missing_number.cpp
missing_number.cpp
 
 
nth_fibonacci_fast.cpp
nth_fibonacci_fast.cpp
 
 
nth_largest_element.cpp
nth_largest_element.cpp
 
 
point.h
point.h
 
 
random_bytes.cpp
random_bytes.cpp
 
 
rectangles_overlap.cpp
rectangles_overlap.cpp
 
 
remove_duplicates.cpp
remove_duplicates.cpp
 
 
reverse_string.cpp
reverse_string.cpp
 
 
set_bits.cpp
set_bits.cpp
 
 
shortest_path.cpp
shortest_path.cpp
 
 
shortest_unique_substring.cpp
shortest_unique_substring.cpp
 
 
stack.h
stack.h
 
 
swap_without_temp.cpp
swap_without_temp.cpp
 
 
test.cpp
test.cpp
 
 
word_search.cpp
word_search.cpp
 
 

Repository files navigation

workout

file name description
nth_fibonacci_number.cpp Implemented a function to calculate the nth number in the fibonacci sequence. Calculating largger(>=50) values take a longer time to compute with the standard method. This version uses memoization technique to speed up computation and it works well :).
grid_traveler.cpp The code here return the maximum number of posible ways to travel through a grid of m * n. It is designed with memoization technique so it returns results faster.
can_sum.cpp Confirms wether a target value can be generated using a given array of numbers. We may use any element of the array, as many times as preferred and consider all elements to be positve values. If can_sum(target, v) function were a member function of a class, I would move the lines from the range-based for to the end of the function into a new function to help clean up the implementation. I did not do it here, to prevent forward declearation.
can_sum_r.cpp This is a revised version of what is happening in can_sum.cpp. In this scenario, we may use only one element of the array, as many times as preferred or any pair, once.
how_sum.cpp Displays one of the combination(s) used in generating the target sum as in the can_sum.cpp file.
best_sum.cpp This version of the can_sum function show the first shortest possible combination for generating the target sum.
can_construct.cpp Trying to construct a target string from an array of given words. We can use each word in the array, as many times as needed.
count_construct.cpp Building on can_construct.cpp, we find the maximum number of ways the target string can be constructed.
all_construct.cpp Also progressing on count_construct.cpp, displays all the possible ways of constructing the target string, an empty list otherwise.
missing_number.cpp Finding the missing number in a given integer array of 1 to 100.
insertion_sort.cpp Implements an insertion sort algorithm - elements in the container will be arranged in ascending order.
swap_without_temp.cpp Swapping two numbers or char types without introducing a third variable. Updated function swap_without_temp to support std::strings.

About

Trying out some solutions for interview questions

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages