SYMBOL INDEX (277 symbols across 56 files)

FILE: patterns/c#/FastAndSlowPointers.cs
  class ListNode (line 4) | public class ListNode {
    method ListNode (line 7) | public ListNode(int x) {
  class FastAndSlowPointers (line 13) | public class FastAndSlowPointers {
    method HasCycleHashSetApproach (line 15) | public bool HasCycleHashSetApproach(ListNode head) {
    method HasCycleFastAndSlowPointersApproach (line 29) | public bool HasCycleFastAndSlowPointersApproach(ListNode head) {
    method MiddleNodeCountingApproach (line 41) | public ListNode MiddleNodeCountingApproach(ListNode head) {
    method MiddleNodeFastAndSlowPointerApproach (line 56) | public ListNode MiddleNodeFastAndSlowPointerApproach(ListNode head) {
    method GetSumOfSquares (line 66) | private int GetSumOfSquares(int n) {
    method IsHappyHashSetApproach (line 76) | public bool IsHappyHashSetApproach(int n) {
    method IsHappyFastAndSlowPointersApproach (line 86) | public bool IsHappyFastAndSlowPointersApproach(int n) {

FILE: patterns/c#/KadaneAlgorithm.cs
  class KadaneAlgorithm (line 3) | public class KadaneAlgorithm {
    method MaxSubArray (line 4) | public int MaxSubArray(int[] nums) {

FILE: patterns/c#/LevelOrderTraversal.cs
  class TreeNode (line 4) | public class TreeNode {
    method TreeNode (line 9) | public TreeNode(int x) {
  class LevelOrderTraversal (line 14) | public class LevelOrderTraversal {
    method LevelOrder (line 15) | public void LevelOrder(TreeNode root) {

FILE: patterns/c#/MonotonicStack.cs
  class MonotonicStack (line 4) | public class MonotonicStack {
    method NextGreaterElement (line 5) | public int[] NextGreaterElement(int[] nums) {
    method DailyTemperatures (line 21) | public int[] DailyTemperatures(int[] temperatures) {

FILE: patterns/c#/ReverseList.cs
  class ListNode (line 1) | public class ListNode {
    method ListNode (line 4) | public ListNode(int val = 0, ListNode next = null) {
  class Solution (line 10) | public class Solution {
    method ReverseList (line 11) | public ListNode ReverseList(ListNode head) {

FILE: patterns/c#/SlidingWindow.cs
  class SlidingWindow (line 4) | public class SlidingWindow {
    method FindMaxAverageBruteForce (line 5) | public double FindMaxAverageBruteForce(int[] nums, int k) {
    method FindMaxAverageSlidingWindow (line 19) | public double FindMaxAverageSlidingWindow(int[] nums, int k) {
    method LengthOfLongestSubstringSlidingWindow (line 38) | public int LengthOfLongestSubstringSlidingWindow(string s) {
    method LengthOfLongestSubstringSlidingWindowFrequencyArray (line 53) | public int LengthOfLongestSubstringSlidingWindowFrequencyArray(string ...

FILE: patterns/c#/TopKElements.cs
  class TopKElements (line 5) | public class TopKElements {
    method KLargestElementsSortingApproach (line 8) | public int[] KLargestElementsSortingApproach(int[] nums, int k) {
    method KLargestElementsMaxHeapApproach (line 14) | public int[] KLargestElementsMaxHeapApproach(int[] nums, int k) {
    method KLargestElementsMinHeapApproach (line 27) | public int[] KLargestElementsMinHeapApproach(int[] nums, int k) {
    method TopKFrequentElementsSortingApproach (line 46) | public int[] TopKFrequentElementsSortingApproach(int[] nums, int k) {
    method TopKFrequentElementsMinHeapApproach (line 60) | public int[] TopKFrequentElementsMinHeapApproach(int[] nums, int k) {
    method GetDistance (line 85) | private int GetDistance(int[] point) {
    method KClosestPointsToOriginMaxHeapApproach (line 89) | public int[][] KClosestPointsToOriginMaxHeapApproach(int[][] points, i...

FILE: patterns/c#/TwoPointers.cs
  class TwoPointers (line 3) | public class TwoPointers {
    method MoveZeroesTwoPointers (line 5) | public void MoveZeroesTwoPointers(int[] nums) {
    method MaxAreaBruteForce (line 19) | public int MaxAreaBruteForce(int[] height) {
    method MaxAreaTwoPointers (line 38) | public int MaxAreaTwoPointers(int[] height) {

FILE: patterns/c++/FastAndSlowPointers.cpp
  class ListNode (line 4) | class ListNode {
    method ListNode (line 8) | ListNode(int x) : val(x), next(nullptr) {}
  class FastAndSlowPointers (line 11) | class FastAndSlowPointers {
    method hasCycleHashSetApproach (line 14) | bool hasCycleHashSetApproach(ListNode* head) {
    method hasCycleFastAndSlowPointersApproach (line 28) | bool hasCycleFastAndSlowPointersApproach(ListNode* head) {
    method ListNode (line 45) | ListNode* middleNodeCountingApproach(ListNode* head) {
    method ListNode (line 60) | ListNode* middleNodeFastAndSlowPointerApproach(ListNode* head) {
    method getSumOfSquares (line 71) | int getSumOfSquares(int n) {
    method isHappyHashSetApproach (line 81) | bool isHappyHashSetApproach(int n) {
    method isHappyFastAndSlowPointersApproach (line 91) | bool isHappyFastAndSlowPointersApproach(int n) {

FILE: patterns/c++/KadaneAlgorithm.cpp
  class KadaneAlgorithm (line 4) | class KadaneAlgorithm {
    method maxSubArray (line 6) | int maxSubArray(std::vector<int>& nums) {

FILE: patterns/c++/LevelOrderTraversal.cpp
  type TreeNode (line 6) | struct TreeNode {
    method TreeNode (line 11) | TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
  class LevelOrderTraversal (line 14) | class LevelOrderTraversal {
    method levelOrder (line 16) | void levelOrder(TreeNode* root) {

FILE: patterns/c++/MonotonicStack.cpp
  class MonotonicStack (line 6) | class MonotonicStack {
    method nextGreaterElement (line 8) | vector<int> nextGreaterElement(vector<int>& nums) {
    method dailyTemperatures (line 24) | vector<int> dailyTemperatures(vector<int>& temperatures) {

FILE: patterns/c++/ReverseList.cpp
  type ListNode (line 1) | struct ListNode {
    method ListNode (line 4) | ListNode(int x) : val(x), next(nullptr) {}
  function ListNode (line 7) | ListNode* reverseList(ListNode* head) {
    method ListNode (line 4) | ListNode(int x) : val(x), next(nullptr) {}

FILE: patterns/c++/SlidingWindow.cpp
  class SlidingWindow (line 8) | class SlidingWindow {
    method findMaxAverageBruteForce (line 10) | double findMaxAverageBruteForce(vector<int>& nums, int k) {
    method findMaxAverageSlidingWindow (line 24) | double findMaxAverageSlidingWindow(vector<int>& nums, int k) {
    method lengthOfLongestSubstringSlidingWindow (line 43) | int lengthOfLongestSubstringSlidingWindow(string s) {
    method lengthOfLongestSubstringSlidingWindowFrequencyArray (line 58) | int lengthOfLongestSubstringSlidingWindowFrequencyArray(string s) {

FILE: patterns/c++/TopKElements.cpp
  class TopKElements (line 9) | class TopKElements {
    method kLargestElementsSortingAppraoch (line 12) | vector<int> kLargestElementsSortingAppraoch(vector<int>& nums, int k) {
    method kLargestElementsMaxHeapAppraoch (line 18) | vector<int> kLargestElementsMaxHeapAppraoch(vector<int>& nums, int k) {
    method kLargestElementsMinHeapAppraoch (line 29) | vector<int> kLargestElementsMinHeapAppraoch(vector<int>& nums, int k) {
    method topKFrequentElementsSortingApproach (line 49) | vector<int> topKFrequentElementsSortingApproach(vector<int>& nums, int...
    method topKFrequentElementsMinHeapApproach (line 68) | vector<int> topKFrequentElementsMinHeapApproach(vector<int>& nums, int...
    method getDistance (line 91) | int getDistance(vector<int>& point) {
    method kClosestPointsToOriginMaxHeapApproach (line 95) | vector<vector<int>> kClosestPointsToOriginMaxHeapApproach(vector<vecto...

FILE: patterns/c++/TwoPointers.cpp
  class TwoPointers (line 7) | class TwoPointers {
    method moveZeroesTwoPointers (line 10) | void moveZeroesTwoPointers(vector<int>& nums) {
    method maxAreaBruteForce (line 24) | int maxAreaBruteForce(vector<int>& height) {
    method maxAreaTwoPointers (line 43) | int maxAreaTwoPointers(vector<int>& height) {

FILE: patterns/go/fast_and_slow_pointers.go
  type ListNode (line 5) | type ListNode struct
  function hasCycleHashSetApproach (line 11) | func hasCycleHashSetApproach(head *ListNode) bool {
  function hasCycleFastAndSlowPointersApproach (line 25) | func hasCycleFastAndSlowPointersApproach(head *ListNode) bool {
  function middleNodeCountingApproach (line 41) | func middleNodeCountingApproach(head *ListNode) *ListNode {
  function middleNodeFastAndSlowPointerApproach (line 56) | func middleNodeFastAndSlowPointerApproach(head *ListNode) *ListNode {
  function getSumOfSquares (line 66) | func getSumOfSquares(n int) int {
  function isHappyHashSetApproach (line 76) | func isHappyHashSetApproach(n int) bool {
  function isHappyFastAndSlowPointersApproach (line 86) | func isHappyFastAndSlowPointersApproach(n int) bool {
  function main (line 96) | func main() {

FILE: patterns/go/kadane_algorithm.go
  function maxSubArray (line 5) | func maxSubArray(nums []int) int {

FILE: patterns/go/level_order_traversal.go
  type TreeNode (line 6) | type TreeNode struct
  function levelOrder (line 12) | func levelOrder(root *TreeNode) {

FILE: patterns/go/monotonic_stack.go
  function nextGreaterElement (line 5) | func nextGreaterElement(nums []int) []int {
  function dailyTemperatures (line 24) | func dailyTemperatures(temperatures []int) []int {
  function main (line 40) | func main() {

FILE: patterns/go/reverse_list.go
  type ListNode (line 3) | type ListNode struct
  function reverseList (line 8) | func reverseList(head *ListNode) *ListNode {

FILE: patterns/go/sliding_window.go
  function findMaxAverageBruteForce (line 8) | func findMaxAverageBruteForce(nums []int, k int) float64 {
  function findMaxAverageSlidingWindow (line 23) | func findMaxAverageSlidingWindow(nums []int, k int) float64 {
  function lengthOfLongestSubstringSlidingWindow (line 42) | func lengthOfLongestSubstringSlidingWindow(s string) int {
  function lengthOfLongestSubstringSlidingWindowFrequencyArray (line 58) | func lengthOfLongestSubstringSlidingWindowFrequencyArray(s string) int {
  function max (line 76) | func max(a, b int) int {

FILE: patterns/go/top_k_elements.go
  function kLargestElementsSortingApproach (line 10) | func kLargestElementsSortingApproach(nums []int, k int) []int {
  function kLargestElementsMaxHeapApproach (line 16) | func kLargestElementsMaxHeapApproach(nums []int, k int) []int {
  function kLargestElementsMinHeapApproach (line 30) | func kLargestElementsMinHeapApproach(nums []int, k int) []int {
  type MaxHeap (line 51) | type MaxHeap
    method Len (line 54) | func (h MaxHeap) Len() int            { return len(h) }
    method Less (line 55) | func (h MaxHeap) Less(i, j int) bool  { return h[i] > h[j] }
    method Swap (line 56) | func (h MaxHeap) Swap(i, j int)       { h[i], h[j] = h[j], h[i] }
    method Push (line 57) | func (h *MaxHeap) Push(x interface{}) { *h = append(*h, x.(int)) }
    method Pop (line 58) | func (h *MaxHeap) Pop() interface{} {
  type MinHeap (line 52) | type MinHeap
    method Len (line 66) | func (h MinHeap) Len() int            { return len(h) }
    method Less (line 67) | func (h MinHeap) Less(i, j int) bool  { return h[i] < h[j] }
    method Swap (line 68) | func (h MinHeap) Swap(i, j int)       { h[i], h[j] = h[j], h[i] }
    method Push (line 69) | func (h *MinHeap) Push(x interface{}) { *h = append(*h, x.(int)) }
    method Pop (line 70) | func (h *MinHeap) Pop() interface{} {
  function main (line 80) | func main() {

FILE: patterns/go/two_pointers.go
  function moveZeroesTwoPointers (line 4) | func moveZeroesTwoPointers(nums []int) {
  function maxAreaBruteForce (line 18) | func maxAreaBruteForce(height []int) int {
  function maxAreaTwoPointers (line 39) | func maxAreaTwoPointers(height []int) int {
  function min (line 64) | func min(a, b int) int {

FILE: patterns/java/FastAndSlowPointers.java
  class FastAndSlowPointers (line 5) | public class FastAndSlowPointers {
    class ListNode (line 7) | class ListNode {
      method ListNode (line 10) | ListNode(int x) {
    method hasCycleHashSetAppraoch (line 20) | public boolean hasCycleHashSetAppraoch(ListNode head) {
    method hasCycleFastAndSlowPointersAppraoch (line 33) | public boolean hasCycleFastAndSlowPointersAppraoch(ListNode head) {
    method middleNodeCountingApproach (line 57) | public ListNode middleNodeCountingApproach(ListNode head) {
    method middleNodeFastAndSlowPointerApproach (line 76) | public ListNode middleNodeFastAndSlowPointerApproach(ListNode head) {
    method getSumOfSquares (line 93) | private int getSumOfSquares(int n) {
    method isHappyHashSetApproach (line 103) | public boolean isHappyHashSetApproach(int n) {
    method isHappyFastAndSlowPointersApproach (line 112) | public boolean isHappyFastAndSlowPointersApproach(int n) {

FILE: patterns/java/KadaneAlgorithm.java
  class KadaneAlgorithm (line 3) | public class KadaneAlgorithm {
    method maxSubArray (line 4) | public int maxSubArray(int[] nums) {

FILE: patterns/java/LevelOrderTraversal.java
  class TreeNode (line 7) | class TreeNode {
    method TreeNode (line 12) | TreeNode(int x) {
  class LevelOrderTraversal (line 17) | public class LevelOrderTraversal {
    method levelOrder (line 18) | public void levelOrder(TreeNode root) {

FILE: patterns/java/MonotonicStack.java
  class MonotonicStack (line 6) | public class MonotonicStack {
    method nextGreaterElement (line 8) | public int[] nextGreaterElement(int[] nums) {
    method dailyTemperatures (line 26) | public int[] dailyTemperatures(int[] temperatures) {

FILE: patterns/java/ReverseLinkedList.java
  class ListNode (line 3) | class ListNode {
  class ReverseLinkedList (line 8) | public class ReverseLinkedList {
    method reverseList (line 9) | public ListNode reverseList(ListNode head) {

FILE: patterns/java/SlidingWindow.java
  class SlidingWindow (line 5) | public class SlidingWindow {
    method findMaxAverageBruteForce (line 6) | public double findMaxAverageBruteForce(int[] nums, int k) {
    method findMaxAverageSlidingWindow (line 25) | public double findMaxAverageSlidingWindow(int[] nums, int k) {
    method lengthOfLongestSubstringSlidingWindow (line 48) | public int lengthOfLongestSubstringSlidingWindow(String s) {
    method lengthOfLongestSubstringSlidingWindowFrequencyArray (line 68) | public int lengthOfLongestSubstringSlidingWindowFrequencyArray(String ...

FILE: patterns/java/TopKElements.java
  class TopKElements (line 6) | public class TopKElements {
    method kLargestElementsSortingAppraoch (line 12) | public int[] kLargestElementsSortingAppraoch(int[] nums, int k) {
    method kLargestElementsMaxHeapAppraoch (line 25) | public int[] kLargestElementsMaxHeapAppraoch(int[] nums, int k) {
    method kLargestElementsMinHeapAppraoch (line 42) | public int[] kLargestElementsMinHeapAppraoch(int[] nums, int k) {
    method topKFrequentElementsSortingApproach (line 71) | public int[] topKFrequentElementsSortingApproach(int[] nums, int k) {
    method topKFrequentElementsMinHeapApproach (line 91) | public int[] topKFrequentElementsMinHeapApproach(int[] nums, int k) {
    method getDistance (line 123) | private int getDistance(int[] point) {
    method kClosestPointsToOriginMaxHeapApproach (line 127) | public int[][] kClosestPointsToOriginMaxHeapApproach(int[][] points, i...

FILE: patterns/java/TwoPointers.java
  class TwoPointers (line 3) | public class TwoPointers {
    method moveZeroesTwoPointers (line 5) | public void moveZeroesTwoPointers(int[] nums) {
    method maxAreaBruteForce (line 20) | public int maxAreaBruteForce(int[] height) {
    method maxAreaTwoPointers (line 38) | public int maxAreaTwoPointers(int[] height) {

FILE: patterns/javascript/fastAndSlowPointers.js
  class ListNode (line 1) | class ListNode {
    method constructor (line 2) | constructor(x) {
  class FastAndSlowPointers (line 8) | class FastAndSlowPointers {
    method hasCycleHashSetApproach (line 10) | hasCycleHashSetApproach(head) {
    method hasCycleFastAndSlowPointersApproach (line 24) | hasCycleFastAndSlowPointersApproach(head) {
    method middleNodeCountingApproach (line 36) | middleNodeCountingApproach(head) {
    method middleNodeFastAndSlowPointerApproach (line 51) | middleNodeFastAndSlowPointerApproach(head) {
    method getSumOfSquares (line 61) | getSumOfSquares(n) {
    method isHappyHashSetApproach (line 65) | isHappyHashSetApproach(n) {
    method isHappyFastAndSlowPointersApproach (line 75) | isHappyFastAndSlowPointersApproach(n) {

FILE: patterns/javascript/kadaneAlgorithm.js
  class KadaneAlgorithm (line 1) | class KadaneAlgorithm {
    method maxSubArray (line 2) | maxSubArray(nums) {

FILE: patterns/javascript/levelOrderTraversal.js
  class TreeNode (line 2) | class TreeNode {
    method constructor (line 3) | constructor(val) {
  class LevelOrderTraversal (line 9) | class LevelOrderTraversal {
    method levelOrder (line 10) | levelOrder(root) {

FILE: patterns/javascript/monotonicStack.js
  class MonotonicStack (line 1) | class MonotonicStack {
    method nextGreaterElement (line 2) | nextGreaterElement(nums) {
    method dailyTemperatures (line 17) | dailyTemperatures(temperatures) {

FILE: patterns/javascript/reverseList.js
  class ListNode (line 1) | class ListNode {
    method constructor (line 2) | constructor(val = 0, next = null) {
  function reverseList (line 8) | function reverseList(head) {

FILE: patterns/javascript/slidingWindow.js
  class SlidingWindow (line 1) | class SlidingWindow {
    method findMaxAverageBruteForce (line 3) | findMaxAverageBruteForce(nums, k) {
    method findMaxAverageSlidingWindow (line 17) | findMaxAverageSlidingWindow(nums, k) {
    method lengthOfLongestSubstringSlidingWindow (line 30) | lengthOfLongestSubstringSlidingWindow(s) {
    method lengthOfLongestSubstringSlidingWindowFrequencyArray (line 46) | lengthOfLongestSubstringSlidingWindowFrequencyArray(s) {

FILE: patterns/javascript/topKElements.js
  class TopKElements (line 1) | class TopKElements {
    method kLargestElementsSortingApproach (line 4) | kLargestElementsSortingApproach(nums, k) {
    method kLargestElementsMaxHeapApproach (line 10) | kLargestElementsMaxHeapApproach(nums, k) {
    method kLargestElementsMinHeapApproach (line 23) | kLargestElementsMinHeapApproach(nums, k) {
    method topKFrequentElementsSortingApproach (line 42) | topKFrequentElementsSortingApproach(nums, k) {
    method topKFrequentElementsMinHeapApproach (line 52) | topKFrequentElementsMinHeapApproach(nums, k) {
    method getDistance (line 70) | getDistance(point) {
    method kClosestPointsToOriginMaxHeapApproach (line 74) | kClosestPointsToOriginMaxHeapApproach(points, k) {

FILE: patterns/javascript/twoPointers.js
  class TwoPointers (line 1) | class TwoPointers {
    method moveZeroesTwoPointers (line 6) | moveZeroesTwoPointers(nums) {
    method maxAreaBruteForce (line 24) | maxAreaBruteForce(height) {
    method maxAreaTwoPointers (line 47) | maxAreaTwoPointers(height) {

FILE: patterns/python/fast_and_slow_pointers.py
  class ListNode (line 1) | class ListNode:
    method __init__ (line 2) | def __init__(self, x):
  class FastAndSlowPointers (line 6) | class FastAndSlowPointers:
    method hasCycleHashSetApproach (line 8) | def hasCycleHashSetApproach(self, head):
    method hasCycleFastAndSlowPointersApproach (line 19) | def hasCycleFastAndSlowPointersApproach(self, head):
    method middleNodeCountingApproach (line 31) | def middleNodeCountingApproach(self, head):
    method middleNodeFastAndSlowPointerApproach (line 43) | def middleNodeFastAndSlowPointerApproach(self, head):
    method getSumOfSquares (line 51) | def getSumOfSquares(self, n):
    method isHappyHashSetApproach (line 54) | def isHappyHashSetApproach(self, n):
    method isHappyFastAndSlowPointersApproach (line 62) | def isHappyFastAndSlowPointersApproach(self, n):

FILE: patterns/python/kadane_algorithm.py
  class KadaneAlgorithm (line 1) | class KadaneAlgorithm:
    method max_sub_array (line 2) | def max_sub_array(self, nums):

FILE: patterns/python/level_order_traversal.py
  class TreeNode (line 4) | class TreeNode:
    method __init__ (line 5) | def __init__(self, x):
  class LevelOrderTraversal (line 10) | class LevelOrderTraversal:
    method level_order (line 11) | def level_order(self, root):

FILE: patterns/python/monotonic_stack.py
  class MonotonicStack (line 1) | class MonotonicStack:
    method next_greater_element (line 2) | def next_greater_element(self, nums):
    method daily_temperatures (line 15) | def daily_temperatures(self, temperatures):

FILE: patterns/python/reverse_list.py
  class ListNode (line 1) | class ListNode:
    method __init__ (line 2) | def __init__(self, val=0, next=None):
  function reverse_list (line 6) | def reverse_list(head):

FILE: patterns/python/sliding_window.py
  class SlidingWindow (line 1) | class SlidingWindow:
    method find_max_average_brute_force (line 2) | def find_max_average_brute_force(self, nums, k):
    method find_max_average_sliding_window (line 10) | def find_max_average_sliding_window(self, nums, k):
    method length_of_longest_substring_sliding_window (line 20) | def length_of_longest_substring_sliding_window(self, s):
    method length_of_longest_substring_sliding_window_frequency_array (line 33) | def length_of_longest_substring_sliding_window_frequency_array(self, s):

FILE: patterns/python/top_k_elements.py
  class TopKElements (line 4) | class TopKElements:
    method k_largest_elements_sorting_approach (line 7) | def k_largest_elements_sorting_approach(self, nums, k):
    method k_largest_elements_max_heap_approach (line 11) | def k_largest_elements_max_heap_approach(self, nums, k):
    method k_largest_elements_min_heap_approach (line 15) | def k_largest_elements_min_heap_approach(self, nums, k):
    method top_k_frequent_elements_sorting_approach (line 25) | def top_k_frequent_elements_sorting_approach(self, nums, k):
    method top_k_frequent_elements_min_heap_approach (line 30) | def top_k_frequent_elements_min_heap_approach(self, nums, k):
    method get_distance (line 40) | def get_distance(self, point):
    method k_closest_points_to_origin_max_heap_approach (line 43) | def k_closest_points_to_origin_max_heap_approach(self, points, k):

FILE: patterns/python/two_pointers.py
  class TwoPointers (line 1) | class TwoPointers:
    method move_zeroes_two_pointers (line 3) | def move_zeroes_two_pointers(self, nums):
    method max_area_brute_force (line 14) | def max_area_brute_force(self, height):
    method max_area_two_pointers (line 30) | def max_area_two_pointers(self, height):

FILE: patterns/typescript/fastAndSlowPointers.ts
  class ListNode (line 1) | class ListNode {
    method constructor (line 4) | constructor(x: number) {
  class FastAndSlowPointers (line 9) | class FastAndSlowPointers {
    method hasCycleHashSetApproach (line 11) | hasCycleHashSetApproach(head: ListNode | null): boolean {
    method hasCycleFastAndSlowPointersApproach (line 25) | hasCycleFastAndSlowPointersApproach(head: ListNode | null): boolean {
    method middleNodeCountingApproach (line 38) | middleNodeCountingApproach(head: ListNode | null): ListNode | null {
    method middleNodeFastAndSlowPointerApproach (line 53) | middleNodeFastAndSlowPointerApproach(head: ListNode | null): ListNode ...
    method getSumOfSquares (line 63) | getSumOfSquares(n: number): number {
    method isHappyHashSetApproach (line 67) | isHappyHashSetApproach(n: number): boolean {
    method isHappyFastAndSlowPointersApproach (line 77) | isHappyFastAndSlowPointersApproach(n: number): boolean {

FILE: patterns/typescript/kadaneAlgorithm.ts
  class KadaneAlgorithm (line 1) | class KadaneAlgorithm {
    method maxSubArray (line 2) | maxSubArray(nums: number[]): number {

FILE: patterns/typescript/levelOrderTraversal.ts
  class BinaryTreeNode (line 2) | class BinaryTreeNode {
    method constructor (line 7) | constructor(val: number) {
  class BinaryTreeLevelOrderTraversal (line 13) | class BinaryTreeLevelOrderTraversal {
    method levelOrder (line 14) | levelOrder(root: BinaryTreeNode | null): void {

FILE: patterns/typescript/monotonicStack.ts
  class MonotonicStack (line 1) | class MonotonicStack {
    method nextGreaterElement (line 2) | nextGreaterElement(nums: number[]): number[] {
    method dailyTemperatures (line 17) | dailyTemperatures(temperatures: number[]): number[] {

FILE: patterns/typescript/reverseList.ts
  class ListNode (line 1) | class ListNode {
    method constructor (line 5) | constructor(val: number = 0, next: ListNode | null = null) {
  function reverseList (line 11) | function reverseList(head: ListNode | null): ListNode | null {

FILE: patterns/typescript/slidingWindow.ts
  class SlidingWindow (line 1) | class SlidingWindow {
    method findMaxAverageBruteForce (line 3) | findMaxAverageBruteForce(nums: number[], k: number): number {
    method findMaxAverageSlidingWindow (line 17) | findMaxAverageSlidingWindow(nums: number[], k: number): number {
    method lengthOfLongestSubstringSlidingWindow (line 30) | lengthOfLongestSubstringSlidingWindow(s: string): number {
    method lengthOfLongestSubstringSlidingWindowFrequencyArray (line 46) | lengthOfLongestSubstringSlidingWindowFrequencyArray(s: string): number {

FILE: patterns/typescript/topKElements.ts
  class TopKElements (line 1) | class TopKElements {
    method kLargestElementsSortingApproach (line 4) | kLargestElementsSortingApproach(nums: number[], k: number): number[] {
    method kLargestElementsMaxHeapApproach (line 10) | kLargestElementsMaxHeapApproach(nums: number[], k: number): number[] {
    method kLargestElementsMinHeapApproach (line 23) | kLargestElementsMinHeapApproach(nums: number[], k: number): number[] {
    method topKFrequentElementsSortingApproach (line 42) | topKFrequentElementsSortingApproach(nums: number[], k: number): number...
    method topKFrequentElementsMinHeapApproach (line 52) | topKFrequentElementsMinHeapApproach(nums: number[], k: number): number...
    method getDistance (line 70) | getDistance(point: number[]): number {
    method kClosestPointsToOriginMaxHeapApproach (line 74) | kClosestPointsToOriginMaxHeapApproach(points: number[][], k: number): ...

FILE: patterns/typescript/twoPointers.ts
  class TwoPointers (line 1) | class TwoPointers {
    method moveZeroesTwoPointers (line 3) | moveZeroesTwoPointers(nums: number[]): void {
    method maxAreaBruteForce (line 17) | maxAreaBruteForce(height: number[]): number {
    method maxAreaTwoPointers (line 36) | maxAreaTwoPointers(height: number[]): number {