Solution#7 SJ-Cipher/Edited Second Edit

Author: SJ-Cipher

.vscode/c_cpp_properties.json

@@ -0,0 +1,18 @@
+{
+  "configurations": [
+    {
+      "name": "windows-gcc-x86",
+      "includePath": [
+        "${workspaceFolder}/**"
+      ],
+      "compilerPath": "C:/MinGW/bin/gcc.exe",
+      "cStandard": "${default}",
+      "cppStandard": "${default}",
+      "intelliSenseMode": "windows-gcc-x86",
+      "compilerArgs": [
+        ""
+      ]
+    }
+  ],
+  "version": 4
+}

.vscode/launch.json

@@ -0,0 +1,24 @@
+{
+  "version": "0.2.0",
+  "configurations": [
+    {
+      "name": "C/C++ Runner: Debug Session",
+      "type": "cppdbg",
+      "request": "launch",
+      "args": [],
+      "stopAtEntry": false,
+      "externalConsole": true,
+      "cwd": ".",
+      "program": "build/Debug/outDebug",
+      "MIMode": "gdb",
+      "miDebuggerPath": "gdb",
+      "setupCommands": [
+        {
+          "description": "Enable pretty-printing for gdb",
+          "text": "-enable-pretty-printing",
+          "ignoreFailures": true
+        }
+      ]
+    }
+  ]
+}

.vscode/settings.json

@@ -0,0 +1,59 @@
+{
+  "C_Cpp_Runner.cCompilerPath": "gcc",
+  "C_Cpp_Runner.cppCompilerPath": "g++",
+  "C_Cpp_Runner.debuggerPath": "gdb",
+  "C_Cpp_Runner.cStandard": "",
+  "C_Cpp_Runner.cppStandard": "",
+  "C_Cpp_Runner.msvcBatchPath": "C:/Program Files/Microsoft Visual Studio/VR_NR/Community/VC/Auxiliary/Build/vcvarsall.bat",
+  "C_Cpp_Runner.useMsvc": false,
+  "C_Cpp_Runner.warnings": [
+    "-Wall",
+    "-Wextra",
+    "-Wpedantic",
+    "-Wshadow",
+    "-Wformat=2",
+    "-Wcast-align",
+    "-Wconversion",
+    "-Wsign-conversion",
+    "-Wnull-dereference"
+  ],
+  "C_Cpp_Runner.msvcWarnings": [
+    "/W4",
+    "/permissive-",
+    "/w14242",
+    "/w14287",
+    "/w14296",
+    "/w14311",
+    "/w14826",
+    "/w44062",
+    "/w44242",
+    "/w14905",
+    "/w14906",
+    "/w14263",
+    "/w44265",
+    "/w14928"
+  ],
+  "C_Cpp_Runner.enableWarnings": true,
+  "C_Cpp_Runner.warningsAsError": false,
+  "C_Cpp_Runner.compilerArgs": [],
+  "C_Cpp_Runner.linkerArgs": [],
+  "C_Cpp_Runner.includePaths": [],
+  "C_Cpp_Runner.includeSearch": [
+    "*",
+    "**/*"
+  ],
+  "C_Cpp_Runner.excludeSearch": [
+    "**/build",
+    "**/build/**",
+    "**/.*",
+    "**/.*/**",
+    "**/.vscode",
+    "**/.vscode/**"
+  ],
+  "C_Cpp_Runner.useAddressSanitizer": false,
+  "C_Cpp_Runner.useUndefinedSanitizer": false,
+  "C_Cpp_Runner.useLeakSanitizer": false,
+  "C_Cpp_Runner.showCompilationTime": false,
+  "C_Cpp_Runner.useLinkTimeOptimization": false,
+  "C_Cpp_Runner.msvcSecureNoWarnings": false
+}

Math/#07-Reverse Integer-Medium/Explanation.md

@@ -0,0 +1,3 @@
+Explanation: (Reverse Integer)
+
+->First let us review the objective of the question. The main objective is to return a reversed integer or return 0 if the reversed number is greater than 2^31-1 or lesser than -2^31. So for a basic solution, we first need to store the maximum and minimum values. Then we need to store the sign of the number so that we can work with a positive number. But we need to note that if the number is -2^31, it will exceed our maximum value by 1. So here we can check and return 0 or we can create a new variable(in case of languages like C). Now we reverse the number and check if it is above or below our limit. If true then we return 0 or if within the limit we return the reversed number.

Math/#07-Reverse Integer-Medium/ReverseInteger.c

@@ -0,0 +1,26 @@
+
+#include<stdio.h>
+int reverse(int x){
+    int MAX_INT=pow(2,31)-1;
+    int MIN_INT=pow(-2,31);
+    if (x==0 || (x>-10 && x<10)){
+        return x;
+    }
+    int sign;
+    if(x>=0) sign=1; else sign=-1;
+    long int xx=labs(x);
+    long int rev=0;
+    while(xx){
+        rev=rev*10 + xx%10;
+        xx=xx/10;
+    }
+    if(rev*sign>MAX_INT || rev*sign<MIN_INT){
+        return 0;
+    }
+    return rev*sign;
+    
+}
+
+int main(){
+    printf("%d",reverse(13452));
+}

Math/#07-Reverse Integer-Medium/ReverseInteger.py

@@ -0,0 +1,17 @@
+
+def Solution( x: int) -> int:
+        MAX_INT=(2**31)-1
+        MIN_INT=-2**31
+        if -10<x<10==0:
+            return x
+        sign = (x)//abs(x)
+        rev = int(str(abs(x))[::-1])
+        if(sign==-1 and rev*sign<MIN_INT):
+            return 0
+        elif(sign==1 and rev>MAX_INT):
+            return 0
+        else:
+            return rev*sign
+             
+if __name__ == "__main__":
+    print(Solution(456))