|
7 | 7 | | Current Status| Stats |
|
8 | 8 | | :------------: | :----------: |
|
9 | 9 | | Total C++ Problems | 188 |
|
10 | | -| Total Python Problems | 8 | |
11 | | -| Current Daily Streak| 3 | |
| 10 | +| Total Python Problems | 9 | |
| 11 | +| Current Daily Streak| 4 | |
12 | 12 | | Last Streak | 06/20/2019 - 06/21/2019|
|
13 | | -| Current Streak | 06/23/2019 - 06/25/2019| |
| 13 | +| Current Streak | 06/23/2019 - 06/26/2019| |
14 | 14 |
|
15 | 15 | </center>
|
16 | 16 |
|
|
22 | 22 | | Find the nth node of linked list from last. |[nthToLastNode.cpp](linked_list_problems/nthToLastNode.cpp), [nth_to_last_node.py](linked_list_problems/nth_to_last_node.py) |
|
23 | 23 | | Add numbers where each digit of the number is represented by node of a linkedlist. Give output as a linked list. | [add_two_numbers_lists.cpp](linked_list_problems/add_two_numbers_lists.cpp), [add_two_numbers_list.py](linked_list_problems/add_two_numbers_lists.py)|
|
24 | 24 | | Swap nodes of a linkedlist without swapping data. |[swapNodesWithoutSwappingData.cpp](linked_list_problems/swapNodesWithoutSwappingData.cpp), [swap_nodes_without_swapping_data.py](linked_list_problems/swap_nodes_without_swapping_data.py)|
|
25 | | -| Reverse a linked list, iteratively and recursively | [reverseLinkedListIterAndRecurse.cpp](linked_list_problems/reverseLinkedListIterAndRecurse.cpp)| |
| 25 | +| Reverse a linked list, iteratively and recursively | [reverseLinkedListIterAndRecurse.cpp](linked_list_problems/reverseLinkedListIterAndRecurse.cpp), [reverse_linkedlist.py](linked_list_problems/reverse_linkedlist.py)| |
26 | 26 | | Given a linked list, reverse alternate nodes and append at the end. | [reverseAlternateNodes.cpp](linked_list_problems/reverseAlternateNodes.cpp) |
|
27 | 27 | | Only given a node pointer, delete the node from the linked list. | [deleteNode.cpp](linked_list_problems/deleteNode.cpp)|
|
28 | 28 | | Delete the entire linkedlist. | [deleteLinkedlist.cpp](linked_list_problems/deleteLinkedlist.cpp)|
|
|
0 commit comments