dddd

https://pepsized.com/customize-your-google-map-markers/
https://medium.com/@yilmazvolkan/custom-map-marker-8b136212d766
https://www.ipragmatech.com/add-custom-image-in-google-maps-marker-android/
https://github.com/tellmehowblog/Android-Google-Map-Polygon



 int[][] arr = new int[n][m];
        foreach(int i :indices)
        {
            for(int r=0;r<n;r++)
                arr[r][indices[i][0]]++;

            for(int c =0;c<m;c++)
                arr[indices[i][1]][c]++;
        }
        int odd=0;
        for(int r=0;r<n;r++)
            for(int c =0;c<m;c++)
                if(arr[r][c]%2=1)
                    odd++;
        return odd;

https://medium.com/@rsinghal757/kadanes-algorithm-dynamic-programming-how-and-why-does-it-work-3fd8849ed73d

https://www.quora.com/How-should-I-explain-dynamic-programming-to-a-4-year-old/answer/Jonathan-Paulson

https://github.com/liyin2015/Algorithms-and-Coding-Interviews?source=post_page-----2ed289925acf----------------------

https://medium.com/outco/how-to-solve-sliding-window-problems-28d67601a66

https://www.geeksforgeeks.org/centroid-decomposition-of-tree/

https://codeforces.com/blog/entry/52492

https://www.topcoder.com/community/competitive-programming/tutorials/an-introduction-to-binary-search-and-red-black-trees/

https://codeforces.com/blog/entry/19175

https://www.quora.com/q/threadsiiithyderabad/Centroid-Decomposition-of-a-Tree

https://akshay.jaggi.co/blog/suffix-automata/

https://saisumit.wordpress.com/2016/01/26/suffix-automaton/

https://medium.com/@iamcrypticcoder/segment-tree-note-1-11245fbf3ed6

https://rezwanarefin01.github.io/posts/block-decomposition-01/

https://github.com/dmariselli/Ukkonen-Suffix-Tree/blob/master/Ukkonen.java

https://www.freecodecamp.org/news/follow-these-steps-to-solve-any-dynamic-programming-interview-problem-cc98e508cd0e/