ds-algo-study/DS-n-Algos/web-dev/tagify-arr/tagify-arr.js

Just experimenting with publishing a package

let htmlArr2 = ["./DS-n-Algos/Arrays/all/all.html","./DS-n-Algos/Arrays/all/Array.prototype.every().html","./DS-n-Algos/Arrays/all/boolean-constructor.html","./DS-n-Algos/Arrays/AllUnique/test/scrap.html","./DS-n-Algos/Arrays/flatten/flatten1.html","./DS-n-Algos/Arrays/flatten/flatten2.html","./DS-n-Algos/async/async_await/index.html","./DS-n-Algos/async/choosing_the_right_approach/index.html","./DS-n-Algos/async/concepts/index.html","./DS-n-Algos/async/index.html","./DS-n-Algos/async/introducing/index.html","./DS-n-Algos/async/promises/index.html","./DS-n-Algos/async/timeouts_and_intervals/index.html","./DS-n-Algos/Binary-Search-Trees/Binary-Search-Tree/binary-search.html","./DS-n-Algos/Binary-Search-Trees/Binary-Search-Tree/BST.html","./DS-n-Algos/Binary-Search-Trees/leetcode-450-delete-bst-node/DeleteNodeinaBST.html","./DS-n-Algos/Binary-Search-Trees/leetcode108-sorted-arr-2-bst/ConvertSortedArraytoBinarySearchTree.html","./DS-n-Algos/Binary-Trees/105-construct-b-tree/105-withcomments.html","./DS-n-Algos/Binary-Trees/binary-tree-reading.html","./DS-n-Algos/Binary-Trees/leetcode110-balanced-bin-tree/BalancedBinaryTree-LeetCode.html","./DS-n-Algos/functions/bindTo/function.apply().html","./DS-n-Algos/functions/bindTo/function.bind().html","./DS-n-Algos/functions/MemoizeFunc/advanced-memoize.html","./DS-n-Algos/Graphs/graphs.html","./DS-n-Algos/java-data-structure-examples/actual-java-code/strings/all-unique/notes.html","./DS-n-Algos/java-data-structure-examples/actual-java-code/strings/anagrams/notes.html","./DS-n-Algos/java-data-structure-examples/actual-java-code/strings/count-words/notes.html","./DS-n-Algos/java-data-structure-examples/actual-java-code/strings/first-unique/notes.html","./DS-n-Algos/java-data-structure-examples/actual-java-code/strings/longest-uniform-substring/notes.html","./DS-n-Algos/java-data-structure-examples/actual-java-code/strings/longest-word-w-all-letters/notes.html","./DS-n-Algos/java-data-structure-examples/actual-java-code/strings/palindrome/notes.html","./DS-n-Algos/java-data-structure-examples/actual-java-code/strings/pattern-match/notes.html","./DS-n-Algos/java-data-structure-examples/actual-java-code/strings/remove/notes.html","./DS-n-Algos/java-data-structure-examples/actual-java-code/strings/reverse-strings/notes.html","./DS-n-Algos/java-data-structure-examples/actual-java-code/strings/rotate/notes.html","./DS-n-Algos/java-data-structure-examples/actual-java-code/strings/word-distance/notes.html","./DS-n-Algos/java-data-structure-examples/java-data-structures/DP+Problems.doc.html","./DS-n-Algos/java-data-structure-examples/java-data-structures/Fifo-Lifo+Problems.doc.html","./DS-n-Algos/java-data-structure-examples/java-data-structures/Functional+Problems.doc.html","./DS-n-Algos/java-data-structure-examples/java-data-structures/Graph+Problems.doc.html","./DS-n-Algos/java-data-structure-examples/java-data-structures/List+Problems.doc.html","./DS-n-Algos/java-data-structure-examples/java-data-structures/Map+Problems.doc.html","./DS-n-Algos/java-data-structure-examples/java-data-structures/Numbers+Problems.doc.html","./DS-n-Algos/java-data-structure-examples/java-data-structures/Recursion+Problems.doc.html","./DS-n-Algos/java-data-structure-examples/java-data-structures/Sort+Problems.doc.html","./DS-n-Algos/java-data-structure-examples/java-data-structures/Strings+Problems.doc.html","./DS-n-Algos/Misc/whiteboarding/whiteboarding-problems.html","./DS-n-Algos/POJOs/utils.html","./DS-n-Algos/Recursion/fibonacci/README.html","./DS-n-Algos/Recursion/longest-common-subsequence/README.html","./DS-n-Algos/Sorting-n-Searching/2-sorting-algorithms/subsequence-quicksort.html","./DS-n-Algos/Strings/03-lengthOfLongestSubString/length-of-longest-substr.html","./DS-n-Algos/web-dev/listenForEvent-s/DOMEventHandlers.html","./index.html","./Resources/My-Data-Structures-Notes/Data-Structures-Cheat-Sheet.html","./Resources/My-Data-Structures-Notes/Data-Structures-Concepts.html","./Resources/My-Data-Structures-Notes/My-ds-notes.html","./Resources/_Articles/algorithmic-thinking/check_palindromic_linkedlist.html","./Resources/_Articles/algorithmic-thinking/Find-Duplicate-and-Missing-Element.html","./Resources/_Articles/algorithmic-thinking/findSebesquenceWithBinarySearch.html","./Resources/_Articles/algorithmic-thinking/LRU_algorithm.html","./Resources/_Articles/algorithmic-thinking/missing_elements.html","./Resources/_Articles/algorithmic-thinking/one-line-code-puzzles.html","./Resources/_Articles/algorithmic-thinking/Print_PrimeNumbers.html","./Resources/_Articles/algorithmic-thinking/RemoveDuplicatesfromSortedArray.html","./Resources/_Articles/algorithmic-thinking/ReservoirSampling.html","./Resources/_Articles/algorithmic-thinking/reverse-nodes-in-k-group.html","./Resources/_Articles/algorithmic-thinking/Seatscheduling.html","./Resources/_Articles/algorithmic-thinking/Subset_Permutation_Combination.html","./Resources/_Articles/algorithmic-thinking/TheLongestPalindromicSubstring.html","./Resources/_Articles/algorithmic-thinking/Trapping_Rain_Water.html","./Resources/_Articles/algorithmic-thinking/UsingBinarySearchAlgorithm.html","./Resources/_Articles/algorithmic-thinking/valid-parentheses.html","./Resources/_Articles/algorithms/intro-to-algorithms.html","./Resources/_Articles/algorithms/searching.html","./Resources/_Articles/algorithms/sorting.html","./Resources/_Articles/data-structures/deque.html","./Resources/_Articles/data-structures/hash-tables.html","./Resources/_Articles/data-structures/intro-to-data-structures.html","./Resources/_Articles/data-structures/linked-lists.html","./Resources/_Articles/data-structures/queues.html","./Resources/_Articles/data-structures/stack.html","./Resources/_Articles/data-structures/trees.html","./Resources/_Articles/dynamic_programming/AnalysisOfDynamicProgramming.html","./Resources/_Articles/dynamic_programming/BestTimeToBuyAndSellStock.html","./Resources/_Articles/dynamic_programming/DemystifyingDynamicProgramming.html","./Resources/_Articles/dynamic_programming/EditDistance.html","./Resources/_Articles/dynamic_programming/FourKeysKeyboard.html","./Resources/_Articles/dynamic_programming/GameProblemsInDynamicProgramming.html","./Resources/_Articles/dynamic_programming/HouseRobber.html","./Resources/_Articles/dynamic_programming/IntervalScheduling.html","./Resources/_Articles/dynamic_programming/KMPCharacterMatchingAlgorithmInDynamicProgramming.html","./Resources/_Articles/dynamic_programming/LongestCommonSubsequence.html","./Resources/_Articles/dynamic_programming/LongestIncreasingSubsequence.html","./Resources/_Articles/dynamic_programming/OptimalSubstructure.html","./Resources/_Articles/dynamic_programming/RegularExpression.html","./Resources/_Articles/dynamic_programming/StrategiesForSubsequenceProblem.html","./Resources/_Articles/dynamic_programming/SuperEggDropAdvanced.html","./Resources/_Articles/dynamic_programming/ThrowingEggsinHighBuildings.html","./Resources/_Articles/js-documentation/MDN-exports.html","./Resources/_Articles/js-documentation/MDN-regex-cheetsheet.html","./Resources/_Articles/recursion/recursion.html","./Resources/_Articles/runtime-complexity/index.html","./Resources/_Articles/runtime-complexity/README.html","./Resources/_Articles/runtime-complexity/runtime-complexity.html","./Resources/_Articles/runtime-complexity/runtime3-solving.html"];
const fs = require( 'fs' );
function tagify ( arr ) {
  let tagsArr = [];
  for ( let i = 0; i < arr.length; i++ ){
    
    let curPath=arr[i];
    let tag= '<div class="btn"><a class="btn" href="'+`${curPath}`+`"`+`>${curPath.slice(0,1)+curPath.slice(6)}</a></div>`;
    console.log( tag );
    tagsArr.push( tag);
    tagsArr.push('\n' );
    var tagStr = tagsArr.join('');
    console.log('tagStr: ', tagStr);
  
  }

  return tagStr;

}
let data = tagify( htmlArr2 );
fs.writeFile( 'output.txt',data , ( err ) => {
      
  // In case of a error throw err. 
  if ( err ) throw err;
} );