CountFriendsPairing Algorithm Added

src/main/java/com/thealgorithms/dynamicprogramming/CountFriendsPairings.java

@@ -0,0 +1,23 @@
+import java.io.*;
+class CountFriendsPairings {
+// Returns count of ways n people
+// can remain single or paired up.
+static int countFriendsPairings(int n)
+{
+int dp[] = new int[n + 1];
+// Filling dp[] in bottom-up manner using
+// recursive formula explained above.
+for (int i = 0; i <= n; i++) {
+if (i <= 2)
+dp[i] = i;
+else
+dp[i] = dp[i - 1] + (i - 1) * dp[i - 2];
+}
+return dp[n];
+}
+public static void main(String[] args)
+{
+int n = 4;
+System.out.println(countFriendsPairings(n));
+}
+} 

src/main/java/com/thealgorithms/dynamicprogramming/GolombSequence.java

@@ -0,0 +1,24 @@
+import java.util.*;
+
+class GolombSequence
+{
+public static void printGolomb(int n)
+{
+int dp[] = new int[n + 1];
+
+dp[1] = 1;
+System.out.print(dp[1] + " ");
+
+for (int i = 2; i <= n; i++)
+{
+dp[i] = 1 + dp[i - dp[dp[i - 1]]];
+
+System.out.print(dp[i] + " ");
+}
+}
+public static void main (String[] args)
+{
+int n = 9;
+printGolomb(n);
+}
+}