Feedback #1
Open
Feedback #1
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
- i added the solution for the intersection of two circles - i added the solution for the movement of a robot in function of a specified path
- in the `circles.c` source i changed an if that wasnt necessary and returned it directly - in the `robot.c` source i changed a define that was used wrong with a typedef
- made functions which do operations on a linked list in the `LinkedList.c` file by getting a string as a command in the `TestLinkedList.c` file. - here are the parameters: a) create_str & create_int - create a list with a specified data_size b) add - add a node to the list at a given position; c) remove - delete a node from a given position from list; d) print - print the list e) free - free all the lists made *) extra parameters: a) reverse - reverse a given list || 311CAa b) list_reverse - a function that i thought it was cool and stuff but didnt work c) combine_create - create a second list d) combine_add - add nodes in the second list e) combine_print - print the second and the merged list (if there is one) f) merge_bruh - merge two sorted lists into another || 311CAb g) remove_middle - remove the node from the middle of a list || 312CAa e) add_middle - add a node from the middle of a list || 312CAb
- made some little modifications on the code - added a better complexity solution for the merged operation
- added more parameters to the main code: a) split_list - can split the list into two lists based on the pos of the node in the previous node b) alternate - can alternate two lists into one by getting one element from one and another from the second one c) palindrome - can check if the data from the list is a palindrome
[lab02] solutions for the second lab of sd
- made functions which do operations on a doubly circular linked list in the `CircularDoublyLinkedList.c` file by getting a string as a command in the `TestCircularDoublyLinkedList.c` file. - here are the parameters: a) create_str & create_int - create a list with a specified data_size b) add - add a node to the list at a given position; c) remove - delete a node from a given position from list; d) print - print the list e) free - free all the lists made *) extra parameters: a) reverse - reverse a given list || 311CAb (-) there is one more function which does the exact same thing, but you alloc memory b) unique - remove duplicate from a list || 311CAa c) create_sec - create a second list d) sec_add - add nodes in the second list e) sec_print - print the second list f) sum - create a new list that is the sum of two lists || 312CAb g) merge - merge two sorted circular doubly lists into another || 313CAa h) less_than - move the nodes which have values smaller than a given one to the left of the list || 313CAb i) remove_middle - remove the node from the middle of a list || 314CAb j) add_middle - add a node from the middle of a list || 315CAa
there were added more parameters which can do more transfomations on lists such as: a) funky - make the sum of every two neighbours and add it between them || 315CAb problem b) palindrome - check if a list contains a palindrome || 314CAa problem c) sum_of_nums - add two numbers contained on two separ also: *) the less_than parameter has been omptimized *) some small adjustements to some functions
- dll_insert_end function: adds a node at the end of the list and allocs a new one - dll_move_end adds a node at the end of the list without allocating a new one
[lab03] solutions for the third lab of sd
- 19th problem || remove nth from end - 234th problem || check if a list is palindrome O(n) time and O(1) space - 237th problem || remove a given node - 160th problem || get the intersection value of two lists - 148th problem || sort a list with bubblesort (*) learnt a solution with merge sort but 'smr' i dont understand how to implement it in C - 141th problem || check if there is a cycle in a list
- added a merge sort implementation for sorting a linked list
- added a new solution for sorting a list with merge sort implementation
[leetcode] solved some problems from leetcode
- added a stack implementation with linked lists - added a queue implementation with a circular buffer - added an implementation to check if a string is closed with the correct paranthesis
[lab04] added solutions for the lab
- added the new bonus to make a stack with 2 queues
[lab05] added solutions for the fifth lab of sd
including: - implementation with matrix of adjacency - implementation with lists of neighbours - BFS - DFS - Floyd-Warshall
[lab06] Added solution for a graph implementation
- minimum distance to a node - check if a graph has connected components - topo sort with Khan algorithm - check if a graph is bipartite
[lab07] Added algorithms for graphs
- binary tree implementation - dfs finding the full length of a binary tree
[lab08] added solution of the lab
[lab09] ADDED BST and Heap implementation
[lab10] ADDED treap implementation
[lab11] ADDED avl & rb_tree implementation
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
👋! GitHub Classroom created this pull request as a place for your teacher to leave feedback on your work. It will update automatically. Don’t close or merge this pull request, unless you’re instructed to do so by your teacher.
In this pull request, your teacher can leave comments and feedback on your code. Click the Subscribe button to be notified if that happens.
Click the Files changed or Commits tab to see all of the changes pushed to
mastersince the assignment started. Your teacher can see this too.Notes for teachers
Use this PR to leave feedback. Here are some tips:
mastersince the assignment started. To leave comments on specific lines of code, put your cursor over a line of code and click the blue + (plus sign). To learn more about comments, read “Commenting on a pull request”.master. Click a commit to see specific changes.For more information about this pull request, read “Leaving assignment feedback in GitHub”.
Subscribed: @ramsimihai