Added tasks 234, 236, 238

Author: javadev

README.md

@@ -430,6 +430,7 @@ Go-based LeetCode algorithm problem solutions, regularly updated.
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0019 |[Remove Nth Node From End of List](src/main/go/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.go)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00
+| 0234 |[Palindrome Linked List](src/main/go/g0201_0300/s0234_palindrome_linked_list/solution.go)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 104 | 97.77
 
 #### Day 4 Linked List
 
@@ -572,6 +573,7 @@ Go-based LeetCode algorithm problem solutions, regularly updated.
 | 0189 |[Rotate Array](src/main/go/g0101_0200/s0189_rotate_array/solution.go)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 20 | 92.61
 | 0055 |[Jump Game](src/main/go/g0001_0100/s0055_jump_game/solution.go)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 48 | 71.95
 | 0075 |[Sort Colors](src/main/go/g0001_0100/s0075_sort_colors/solution.go)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 1 | 76.26
+| 0238 |[Product of Array Except Self](src/main/go/g0201_0300/s0238_product_of_array_except_self/solution.go)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 20 | 77.65
 | 0041 |[First Missing Positive](src/main/go/g0001_0100/s0041_first_missing_positive/solution.go)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n) | 39 | 92.34
 | 0239 |[Sliding Window Maximum](src/main/go/g0201_0300/s0239_sliding_window_maximum/solution.go)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Big_O_Time_O(n\*k)_Space_O(n+k) | 168 | 99.41
 
@@ -614,6 +616,7 @@ Go-based LeetCode algorithm problem solutions, regularly updated.
 | 0206 |[Reverse Linked List](src/main/go/g0201_0300/s0206_reverse_linked_list/solution.go)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 2 | 76.97
 | 0021 |[Merge Two Sorted Lists](src/main/go/g0001_0100/s0021_merge_two_sorted_lists/solution.go)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 0 | 100.00
 | 0160 |[Intersection of Two Linked Lists](src/main/go/g0101_0200/s0160_intersection_of_two_linked_lists/solution.go)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(M+N)_Space_O(1) | 16 | 99.84
+| 0234 |[Palindrome Linked List](src/main/go/g0201_0300/s0234_palindrome_linked_list/solution.go)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 104 | 97.77
 | 0138 |[Copy List with Random Pointer](src/main/go/g0101_0200/s0138_copy_list_with_random_pointer/solution.go)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Big_O_Time_O(N)_Space_O(N) | 2 | 70.11
 | 0025 |[Reverse Nodes in k-Group](src/main/go/g0001_0100/s0025_reverse_nodes_in_k_group/solution.go)| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 0 | 100.00
 | 0146 |[LRU Cache](src/main/go/g0101_0200/s0146_lru_cache/lrucache.go)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 421 | 93.60
@@ -629,6 +632,7 @@ Go-based LeetCode algorithm problem solutions, regularly updated.
 | 0104 |[Maximum Depth of Binary Tree](src/main/go/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.go)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00
 | 0124 |[Binary Tree Maximum Path Sum](src/main/go/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.go)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 10 | 89.68
 | 0098 |[Validate Binary Search Tree](src/main/go/g0001_0100/s0098_validate_binary_search_tree/solution.go)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 6 | 55.36
+| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/go/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.go)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 5 | 90.18
 
 #### Udemy Trie and Heap
 
@@ -797,6 +801,7 @@ Go-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0238 |[Product of Array Except Self](src/main/go/g0201_0300/s0238_product_of_array_except_self/solution.go)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 20 | 77.65
 | 0560 |[Subarray Sum Equals K](src/main/go/g0501_0600/s0560_subarray_sum_equals_k/solution.go)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Big_O_Time_O(n)_Space_O(n) | 40 | 70.56
 
 #### Day 6 String
@@ -874,6 +879,7 @@ Go-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/go/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.go)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 5 | 90.18
 
 #### Day 19 Graph
 
@@ -1425,6 +1431,9 @@ Go-based LeetCode algorithm problem solutions, regularly updated.
 | 0283 |[Move Zeroes](src/main/go/g0201_0300/s0283_move_zeroes/solution.go)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers, Algorithm_I_Day_3_Two_Pointers, Programming_Skills_I_Day_6_Array, Udemy_Arrays, Big_O_Time_O(n)_Space_O(1) | 15 | 88.69
 | 0240 |[Search a 2D Matrix II](src/main/go/g0201_0300/s0240_search_a_2d_matrix_ii/solution.go)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Data_Structure_II_Day_4_Array, Binary_Search_II_Day_8, Big_O_Time_O(n+m)_Space_O(1) | 11 | 96.10
 | 0239 |[Sliding Window Maximum](src/main/go/g0201_0300/s0239_sliding_window_maximum/solution.go)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Udemy_Arrays, Big_O_Time_O(n\*k)_Space_O(n+k) | 168 | 99.41
+| 0238 |[Product of Array Except Self](src/main/go/g0201_0300/s0238_product_of_array_except_self/solution.go)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Prefix_Sum, Data_Structure_II_Day_5_Array, Udemy_Arrays, Big_O_Time_O(n^2)_Space_O(n) | 20 | 77.65
+| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/go/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.go)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_18_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(n)_Space_O(n) | 5 | 90.18
+| 0234 |[Palindrome Linked List](src/main/go/g0201_0300/s0234_palindrome_linked_list/solution.go)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Stack, Linked_List, Recursion, Level_2_Day_3_Linked_List, Udemy_Linked_List, Big_O_Time_O(n)_Space_O(1) | 104 | 97.77
 | 0230 |[Kth Smallest Element in a BST](src/main/go/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.go)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_II_Day_17_Tree, Level_2_Day_9_Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
 | 0226 |[Invert Binary Tree](src/main/go/g0201_0300/s0226_invert_binary_tree/solution.go)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_12_Tree, Level_2_Day_6_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
 | 0221 |[Maximal Square](src/main/go/g0201_0300/s0221_maximal_square/solution.go)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16, Big_O_Time_O(m\*n)_Space_O(m\*n) | 0 | 100.00

src/main/go/g0001_0100/s0002_add_two_numbers/solution.go

@@ -4,19 +4,18 @@ package s0002_add_two_numbers
 // #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15
 // #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) #2024_03_05_Time_4_ms_(84.60%)_Space_4.4_MB_(47.97%)
 
-/*
+type ListNode struct {
+	Val  int
+	Next *ListNode
+}
+
+/**
  * Definition for singly-linked list.
  * type ListNode struct {
  *     Val int
  *     Next *ListNode
  * }
  */
-
-type ListNode struct {
-	Val  int
-	Next *ListNode
-}
-
 func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
 	dummyHead := &ListNode{}
 	p, q, curr := l1, l2, dummyHead

src/main/go/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.go

@@ -4,19 +4,18 @@ package s0019_remove_nth_node_from_end_of_list
 // #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Big_O_Time_O(L)_Space_O(L)
 // #2024_03_07_Time_0_ms_(100.00%)_Space_2.2_MB_(19.66%)
 
-/*
+type ListNode struct {
+	Val  int
+	Next *ListNode
+}
+
+/**
  * Definition for singly-linked list.
  * type ListNode struct {
  *     Val int
  *     Next *ListNode
  * }
  */
-
-type ListNode struct {
-	Val  int
-	Next *ListNode
-}
-
 func removeNthFromEnd(head *ListNode, n int) *ListNode {
 	dummy := &ListNode{Next: head}
 	slow, fast := dummy, dummy

src/main/go/g0001_0100/s0021_merge_two_sorted_lists/solution.go

@@ -5,19 +5,18 @@ package s0021_merge_two_sorted_lists
 // #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(m+n)_Space_O(m+n)
 // #2024_03_07_Time_0_ms_(100.00%)_Space_2.5_MB_(95.02%)
 
+type ListNode struct {
+	Val  int
+	Next *ListNode
+}
+
 /**
  * Definition for singly-linked list.
  * type ListNode struct {
  *     Val int
  *     Next *ListNode
  * }
  */
-
-type ListNode struct {
-	Val  int
-	Next *ListNode
-}
-
 func mergeTwoLists(list1 *ListNode, list2 *ListNode) *ListNode {
 	var sortedListNode, tail *ListNode = &ListNode{}, &ListNode{}
 

src/main/go/g0001_0100/s0023_merge_k_sorted_lists/solution.go

@@ -6,19 +6,18 @@ import "container/heap"
 // #Divide_and_Conquer #Merge_Sort #Big_O_Time_O(k*n*log(k))_Space_O(log(k))
 // #2024_03_08_Time_3_ms_(96.74%)_Space_5.5_MB_(25.28%)
 
-/*
+type ListNode struct {
+	Val  int
+	Next *ListNode
+}
+
+/**
  * Definition for singly-linked list.
  * type ListNode struct {
  *     Val int
  *     Next *ListNode
  * }
  */
-
-type ListNode struct {
-	Val  int
-	Next *ListNode
-}
-
 func mergeKLists(lists []*ListNode) *ListNode {
 	var h minHeap
 	for _, node := range lists {

src/main/go/g0001_0100/s0024_swap_nodes_in_pairs/solution.go

@@ -4,19 +4,18 @@ package s0024_swap_nodes_in_pairs
 // #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1)
 // #2024_03_08_Time_0_ms_(100.00%)_Space_2.1_MB_(95.56%)
 
-/*
+type ListNode struct {
+	Val  int
+	Next *ListNode
+}
+
+/**
  * Definition for singly-linked list.
  * type ListNode struct {
  *     Val int
  *     Next *ListNode
  * }
  */
-
-type ListNode struct {
-	Val  int
-	Next *ListNode
-}
-
 func swapPairs(head *ListNode) *ListNode {
 	if head == nil || head.Next == nil {
 		return head

src/main/go/g0001_0100/s0025_reverse_nodes_in_k_group/solution.go

@@ -4,20 +4,18 @@ package s0025_reverse_nodes_in_k_group
 // #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(k)
 // #2024_03_08_Time_0_ms_(100.00%)_Space_3.6_MB_(72.87%)
 
-/*
+type ListNode struct {
+	Val  int
+	Next *ListNode
+}
+
+/**
  * Definition for singly-linked list.
  * type ListNode struct {
  *     Val int
  *     Next *ListNode
  * }
  */
-
-type ListNode struct {
-	Val  int
-	Next *ListNode
-}
-
-// reverseKGroup reverses nodes in k-group in the linked list.
 func reverseKGroup(head *ListNode, k int) *ListNode {
 	if head == nil || head.Next == nil || k == 1 {
 		return head

src/main/go/g0001_0100/s0094_binary_tree_inorder_traversal/solution.go

@@ -10,7 +10,7 @@ type TreeNode struct {
 	Right *TreeNode
 }
 
-/*
+/**
  * Definition for a binary tree node.
  * type TreeNode struct {
  *     Val int

src/main/go/g0101_0200/s0101_symmetric_tree/solution.go

@@ -10,7 +10,7 @@ type TreeNode struct {
 	Right *TreeNode
 }
 
-/*
+/**
  * Definition for a binary tree node.
  * type TreeNode struct {
  *     Val int

src/main/go/g0101_0200/s0102_binary_tree_level_order_traversal/solution.go

@@ -10,7 +10,7 @@ type TreeNode struct {
 	Right *TreeNode
 }
 
-/*
+/**
  * Definition for a binary tree node.
  * type TreeNode struct {
  *     Val int

src/main/go/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.go

@@ -11,7 +11,7 @@ type TreeNode struct {
 	Right *TreeNode
 }
 
-/*
+/**
  * Definition for a binary tree node.
  * type TreeNode struct {
  *     Val int

src/main/go/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.go

@@ -10,7 +10,7 @@ type TreeNode struct {
 	Right *TreeNode
 }
 
-/*
+/**
  * Definition for a binary tree node.
  * type TreeNode struct {
  *     Val int

src/main/go/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.go

@@ -10,7 +10,7 @@ type TreeNode struct {
 	Right *TreeNode
 }
 
-/*
+/**
  * Definition for a binary tree node.
  * type TreeNode struct {
  *     Val int

src/main/go/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.go

@@ -10,7 +10,7 @@ type TreeNode struct {
 	Right *TreeNode
 }
 
-/*
+/**
  * Definition for a binary tree node.
  * type TreeNode struct {
  *     Val int

src/main/go/g0101_0200/s0138_copy_list_with_random_pointer/solution.go

@@ -10,7 +10,7 @@ type Node struct {
 	Random *Node
 }
 
-/*
+/**
  * Definition for a Node.
  * type Node struct {
  *     Val int

src/main/go/g0101_0200/s0141_linked_list_cycle/solution.go

@@ -9,7 +9,7 @@ type ListNode struct {
 	Next *ListNode
 }
 
-/*
+/**
  * Definition for singly-linked list.
  * type ListNode struct {
  *     Val int

src/main/go/g0101_0200/s0142_linked_list_cycle_ii/solution.go

@@ -9,7 +9,7 @@ type ListNode struct {
 	Next *ListNode
 }
 
-/*
+/**
  * Definition for singly-linked list.
  * type ListNode struct {
  *     Val int

src/main/go/g0101_0200/s0146_lru_cache/lrucache.go

@@ -46,7 +46,7 @@ func (this *LRUCache) Put(key int, value int) {
 	}
 }
 
-/*
+/**
  * Your LRUCache object will be instantiated and called as such:
  * obj := Constructor(capacity);
  * param_1 := obj.Get(key);

src/main/go/g0101_0200/s0148_sort_list/solution.go

@@ -11,7 +11,7 @@ type ListNode struct {
 	Next *ListNode
 }
 
-/*
+/**
  * Definition for singly-linked list.
  * type ListNode struct {
  *     Val int

src/main/go/g0101_0200/s0155_min_stack/minstack.go

@@ -40,7 +40,7 @@ func (this *MinStack) GetMin() int {
 	return this.Min
 }
 
-/*
+/**
  * Your MinStack object will be instantiated and called as such:
  * obj := Constructor();
  * obj.Push(val);

src/main/go/g0101_0200/s0160_intersection_of_two_linked_lists/solution.go

@@ -9,7 +9,7 @@ type ListNode struct {
 	Next *ListNode
 }
 
-/*
+/**
  * Definition for singly-linked list.
  * type ListNode struct {
  *     Val int

src/main/go/g0201_0300/s0206_reverse_linked_list/solution.go

@@ -10,7 +10,7 @@ type ListNode struct {
 	Next *ListNode
 }
 
-/*
+/**
  * Definition for singly-linked list.
  * type ListNode struct {
  *     Val int

src/main/go/g0201_0300/s0208_implement_trie_prefix_tree/trie.go

@@ -74,7 +74,7 @@ func insert(root *node, word string) *node {
 	return root
 }
 
-/*
+/**
  * Your Trie object will be instantiated and called as such:
  * obj := Constructor();
  * obj.Insert(word);

src/main/go/g0201_0300/s0226_invert_binary_tree/solution.go

@@ -10,7 +10,7 @@ type TreeNode struct {
 	Right *TreeNode
 }
 
-/*
+/**
  * Definition for a binary tree node.
  * type TreeNode struct {
  *     Val int

src/main/go/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.go

@@ -15,7 +15,7 @@ type Node struct {
 	value int
 }
 
-/*
+/**
  * Definition for a binary tree node.
  * type TreeNode struct {
  *     Val int