top of page
![](https://static.wixstatic.com/media/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.jpg/v1/fill/w_250,h_250,fp_0.50_0.50,q_30,blur_30,enc_auto/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.webp)
![142. Linked List Cycle II - LeetCode Fastest Solution](https://static.wixstatic.com/media/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.jpg/v1/fill/w_454,h_341,fp_0.50_0.50,q_90,enc_auto/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.webp)
Code Recipe
Jan 164 min read
142. Linked List Cycle II - LeetCode Fastest Solution
Given the head node of a linked list, return the node where the cycle starts. If cycle does not exist, return null. Do not modify the linked
40 views1 comment
![](https://static.wixstatic.com/media/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.jpg/v1/fill/w_250,h_250,fp_0.50_0.50,q_30,blur_30,enc_auto/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.webp)
![141. Linked List Cycle - LeetCode Fastest Solution](https://static.wixstatic.com/media/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.jpg/v1/fill/w_454,h_341,fp_0.50_0.50,q_90,enc_auto/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.webp)
Code Recipe
Jan 144 min read
141. Linked List Cycle - LeetCode Fastest Solution
Given the head node of a singly linked list, determine if the linked list has a cycle in it. A linked list has a cycle if some node in the
159 views1 comment
![](https://static.wixstatic.com/media/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.jpg/v1/fill/w_250,h_250,fp_0.50_0.50,q_30,blur_30,enc_auto/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.webp)
![215. Kth Largest Element in an Array - LeetCode Fastest Solution](https://static.wixstatic.com/media/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.jpg/v1/fill/w_454,h_341,fp_0.50_0.50,q_90,enc_auto/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.webp)
Ashwin Shirva
Jan 136 min read
215. Kth Largest Element in an Array - LeetCode Fastest Solution
Given an array of integers nums and an integer k, return the kth largest element in the array. Note that you have to return the kth largest
93 views1 comment
![](https://static.wixstatic.com/media/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.jpg/v1/fill/w_250,h_250,fp_0.50_0.50,q_30,blur_30,enc_auto/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.webp)
![113. Path Sum II - LeetCode Fastest Solution](https://static.wixstatic.com/media/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.jpg/v1/fill/w_454,h_341,fp_0.50_0.50,q_90,enc_auto/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.webp)
Code Recipe
Jan 104 min read
113. Path Sum II - LeetCode Fastest Solution
Given the root node of the binary tree and an integer targetSum, return all root to leaf paths in this tree such that, sum of these paths is
31 views1 comment
![](https://static.wixstatic.com/media/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.jpg/v1/fill/w_250,h_250,fp_0.50_0.50,q_30,blur_30,enc_auto/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.webp)
![242. Valid Anagram - LeetCode Fastest Solution](https://static.wixstatic.com/media/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.jpg/v1/fill/w_454,h_341,fp_0.50_0.50,q_90,enc_auto/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.webp)
Code Recipe
Jan 94 min read
242. Valid Anagram - LeetCode Fastest Solution
Given two strings s and t, return true if t is a valid anagram of s. Otherwise return false. An anagram is a word or phrase made by
43 views1 comment
![](https://static.wixstatic.com/media/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.jpg/v1/fill/w_250,h_250,fp_0.50_0.50,q_30,blur_30,enc_auto/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.webp)
![112. Path Sum - LeetCode Fastest Solution](https://static.wixstatic.com/media/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.jpg/v1/fill/w_454,h_341,fp_0.50_0.50,q_90,enc_auto/d6c009_43026980286f4ac8a1e71e9b9524c9be~mv2.webp)
Code Recipe
Jan 84 min read
112. Path Sum - LeetCode Fastest Solution
Given the root node of a binary tree and an integer targetSum, return true if the tree has a path from root-to-leaf such that the sum of all
7 views1 comment
bottom of page