diff --git a/snippets/Basics/go/prime-check.go b/snippets/Basics/go/prime-check.go
index ed9daba..e473a0b 100644
--- a/snippets/Basics/go/prime-check.go
+++ b/snippets/Basics/go/prime-check.go
@@ -1,6 +1,29 @@
-# Title: Check primality (sqrt method)
-# Topic: Basics
-# Language: go
-# Example: see bottom
+package main
 
-// Check primality (sqrt method) - placeholder in go
+import "fmt"
+
+// isPrime returns true if n is a prime number
+func isPrime(n int) bool {
+	if n <= 1 {
+		return false
+	}
+	if n <= 3 {
+		return true
+	}
+	if n%2 == 0 || n%3 == 0 {
+		return false
+	}
+	for i := 5; i*i <= n; i += 6 {
+		if n%i == 0 || n%(i+2) == 0 {
+			return false
+		}
+	}
+	return true
+}
+
+func main() {
+	var n int
+	fmt.Print("Enter a number: ")
+	fmt.Scan(&n)
+	fmt.Printf("%d prime? %v\n", n, isPrime(n))
+}
diff --git a/snippets/Basics/javascript/prime-check.js b/snippets/Basics/javascript/prime-check.js
index f8dcccd..3c68135 100644
--- a/snippets/Basics/javascript/prime-check.js
+++ b/snippets/Basics/javascript/prime-check.js
@@ -1,6 +1,26 @@
-# Title: Check primality (sqrt method)
-# Topic: Basics
-# Language: javascript
-# Example: see bottom
+// Prime Check in JavaScript
+// This program checks whether a number is prime
 
-// Check primality (sqrt method) - placeholder in javascript
+// Function to check if a number is prime
+function isPrime(n) {
+    if (n <= 1) return false;       // 0 and 1 are not prime
+    if (n <= 3) return true;        // 2 and 3 are prime
+
+    if (n % 2 === 0 || n % 3 === 0) return false;
+
+    // Check divisibility using 6k ± 1 optimization
+    for (let i = 5; i * i <= n; i += 6) {
+        if (n % i === 0 || n % (i + 2) === 0) return false;
+    }
+
+    return true;
+}
+
+// Example usage:
+const n= prompt("Enter a number to check if it's prime: ");
+const num = parseInt(n);
+if (isNaN(number)) {
+    console.log("Please enter a valid number!");
+} else {
+    console.log(`${number} is prime? ${isPrime(number)}`);
+}
\ No newline at end of file
diff --git a/snippets/Basics/python/prime-check.py b/snippets/Basics/python/prime-check.py
index a163067..1d875f9 100644
--- a/snippets/Basics/python/prime-check.py
+++ b/snippets/Basics/python/prime-check.py
@@ -1,15 +1,31 @@
-# Title: Check primality (sqrt method)
-# Topic: Basics
-# Language: python
-# Example: see bottom
+import math
 
-def main(n=10):
-    a,b=0,1
-    out=[]
-    for _ in range(n):
-        out.append(a)
-        a,b=b,a+b
-    return out
+def is_prime(n):
+    # Check if number is less than 2
+    if n < 2:
+        return False
+    
+    # Check if number is 2
+    if n == 2:
+        return True
+    
+    # Check if number is even
+    if n % 2 == 0:
+        return False
+    
+    # Check odd numbers up to square root of n
+    for i in range(3, int(math.sqrt(n)) + 1, 2):
+        if n % i == 0:
+            return False
+    
+    return True
 
-if __name__ == '__main__':
-    print(main(10))
+# Get input from user
+try:
+    num = int(input("Enter a number to check if it's prime: "))
+    if is_prime(num):
+        print(f"{num} is a prime number")
+    else:
+        print(f"{num} is not a prime number")
+except ValueError:
+    print("Please enter a valid integer")
\ No newline at end of file