added two js solutions. problems 3016 && 3175

javascript/_3016.js

@@ -0,0 +1,24 @@
+function minPushesToType(word) {
+  let freqMap = new Map();
+
+  // Using greedy frequency-based allocation (this is basically gives pirority based on frequenecy of occurence.).
+  // Count frequency of each letter.
+  for (let char of word) {
+      freqMap.set(char, (freqMap.get(char) || 0) + 1);
+  }
+
+  // Sort letters by frequency in descending order.
+  let frequencies = Array.from(freqMap.values()).sort((a, b) => b - a);
+
+  // Assign letters to keys 2-9.
+  let keys = Array(8).fill(0); 
+  let totalPushes = 0;
+
+  for (let i = 0; i < frequencies.length; i++) {
+      let keyIndex = i % 8;
+      let presses = Math.floor(i / 8) + 1;
+      totalPushes += frequencies[i] * presses;
+  }
+
+  return totalPushes;
+}

javascript/_3175.js

@@ -0,0 +1,25 @@
+function findWinner(skills, k) {
+  // This solution uses a queue to process the matches.
+  let n = skills.length;
+  let maxSkill = Math.max(...skills); 
+  let queue = []; 
+
+  let currentWinner = 0; 
+  let currentWins = 0;  
+
+  for (let i = 1; i < n; i++) {
+      if (skills[currentWinner] > skills[i]) {
+          currentWins++; 
+      } else {
+          currentWinner = i;
+          currentWins = 1;  
+      }
+
+      // If the champion has won k times or is the max skill player, return.
+      if (currentWins >= k || skills[currentWinner] === maxSkill) {
+          return currentWinner;
+      }
+  }
+
+  return currentWinner;
+}