diff --git "a/Beginner Level \360\237\223\201/PrintPerfectSquares/PerfectSquare.cpp" "b/Beginner Level \360\237\223\201/PrintPerfectSquares/PerfectSquare.cpp"
new file mode 100644
index 00000000..a8821f6e
--- /dev/null
+++ "b/Beginner Level \360\237\223\201/PrintPerfectSquares/PerfectSquare.cpp"	
@@ -0,0 +1,11 @@
+#include "bits/stdc++.h"
+using namespace std;
+
+int main(){
+    long long n;
+    cin>>n;
+    long long x = floor(sqrt(n));
+    for(long long i = 1;i<=x;i++){
+        cout<<(i*i)<<endl;
+    }
+}
\ No newline at end of file
diff --git "a/Beginner Level \360\237\223\201/PrintPerfectSquares/question.md" "b/Beginner Level \360\237\223\201/PrintPerfectSquares/question.md"
new file mode 100644
index 00000000..fffb3747
--- /dev/null
+++ "b/Beginner Level \360\237\223\201/PrintPerfectSquares/question.md"	
@@ -0,0 +1,7 @@
+### Odd Divisors problem
+
+Take input N
+Range of 1<=N <=1e18
+Print all numbers having odd divisors in the range [1,n]
+
+#### Approach : Number which are perfect squares they have odd divisors (Complexity(O(sqrt(n))))
\ No newline at end of file
diff --git "a/Beginner Level \360\237\223\201/data.json" "b/Beginner Level \360\237\223\201/data.json"
index 23297d68..c9e9c9a2 100644
--- "a/Beginner Level \360\237\223\201/data.json"	
+++ "b/Beginner Level \360\237\223\201/data.json"	
@@ -146,5 +146,10 @@
     "githubUsername": "vimall03"
   },
 
+  {
+    "name":"Jasleen Kaur",
+    "githubUsername": "7SepRash"
+  },
+
 ]