Merge branch 'geekcomputers:master' into master

Author: HarshitGourlariya

.github/workflows/datadog-synthetics.yml

@@ -0,0 +1,38 @@
+# This workflow will trigger Datadog Synthetic tests within your Datadog organisation
+# For more information on running Synthetic tests within your GitHub workflows see: https://docs.datadoghq.com/synthetics/cicd_integrations/github_actions/
+
+# This workflow uses actions that are not certified by GitHub.
+# They are provided by a third-party and are governed by
+# separate terms of service, privacy policy, and support
+# documentation.
+
+# To get started:
+
+# 1. Add your Datadog API (DD_API_KEY) and Application Key (DD_APP_KEY) as secrets to your GitHub repository. For more information, see: https://docs.datadoghq.com/account_management/api-app-keys/.
+# 2. Start using the action within your workflow
+
+name: Run Datadog Synthetic tests
+
+on:
+  push:
+    branches: [ "master" ]
+  pull_request:
+    branches: [ "master" ]
+
+jobs:
+  build:
+    runs-on: ubuntu-latest
+
+    steps:
+    - uses: actions/checkout@v4
+
+    # Run Synthetic tests within your GitHub workflow.
+    # For additional configuration options visit the action within the marketplace: https://github.com/marketplace/actions/datadog-synthetics-ci
+    - name: Run Datadog Synthetic tests
+      uses: DataDog/synthetics-ci-github-action@87b505388a22005bb8013481e3f73a367b9a53eb # v1.4.0
+      with:
+        api_key: ${{secrets.DD_API_KEY}}
+        app_key: ${{secrets.DD_APP_KEY}}
+        test_search_query: 'tag:e2e-tests' #Modify this tag to suit your tagging strategy
+
+

.github/workflows/lint_python.yml

@@ -1,4 +1,4 @@
-name: lint_python
+name: python
 on: [pull_request, push]
 jobs:
   lint_python:

.gitignore

@@ -16,10 +16,12 @@ for i in string:
         odd+=i
 print(lower+upper+odd+even)
 
+.venv
 # operating system-related files
 
 # file properties cache/storage on macOS
 *.DS_Store
 
 # thumbnail cache on Windows
 Thumbs.db
+bankmanaging.db

.vscode/c_cpp_properties.json

@@ -0,0 +1,18 @@
+{
+  "configurations": [
+    {
+      "name": "windows-gcc-x64",
+      "includePath": [
+        "${workspaceFolder}/**"
+      ],
+      "compilerPath": "gcc",
+      "cStandard": "${default}",
+      "cppStandard": "${default}",
+      "intelliSenseMode": "windows-gcc-x64",
+      "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": "c:/Users/prave/python_examples/geekcomputers",
+      "program": "c:/Users/prave/python_examples/geekcomputers/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
+}

1 File handle/File handle text/question 5.py

@@ -1,7 +1,8 @@
 """Write a function in python to count the number of lowercase
 alphabets present in a text file “happy.txt"""
 
-import time, os
+import time
+import os
 from counter import Counter
 
 print("You will see the count of lowercase, uppercase and total count of alphabets in provided file..")

1 File handle/File handle text/question 6.py

@@ -1,5 +1,5 @@
 """Write a function in python to count the number of lowercase
-alphabets present in a text file “happy.txt"""
+alphabets present in a text file “happy.txt”"""
 
 from counter import Counter
 

8_puzzle.py

@@ -0,0 +1,92 @@
+from queue import PriorityQueue
+
+class PuzzleState:
+    def __init__(self, board, goal, moves=0, previous=None):
+        self.board = board
+        self.goal = goal
+        self.moves = moves
+        self.previous = previous
+
+    def __lt__(self, other):
+        return self.priority() < other.priority()
+
+    def priority(self):
+        return self.moves + self.manhattan()
+
+    def manhattan(self):
+        distance = 0
+        for i in range(3):
+            for j in range(3):
+                if self.board[i][j] != 0:
+                    x, y = divmod(self.board[i][j] - 1, 3)
+                    distance += abs(x - i) + abs(y - j)
+        return distance
+
+    def is_goal(self):
+        return self.board == self.goal
+
+    def neighbors(self):
+        neighbors = []
+        x, y = next((i, j) for i in range(3) for j in range(3) if self.board[i][j] == 0)
+        directions = [(-1, 0), (1, 0), (0, -1), (0, 1)]
+
+        for dx, dy in directions:
+            nx, ny = x + dx, y + dy
+            if 0 <= nx < 3 and 0 <= ny < 3:
+                new_board = [row[:] for row in self.board]
+                new_board[x][y], new_board[nx][ny] = new_board[nx][ny], new_board[x][y]
+                neighbors.append(PuzzleState(new_board, self.goal, self.moves + 1, self))
+
+        return neighbors
+
+def solve_puzzle(initial_board, goal_board):
+    initial_state = PuzzleState(initial_board, goal_board)
+    frontier = PriorityQueue()
+    frontier.put(initial_state)
+    explored = set()
+
+    while not frontier.empty():
+        current_state = frontier.get()
+
+        if current_state.is_goal():
+            return current_state
+
+        explored.add(tuple(map(tuple, current_state.board)))
+
+        for neighbor in current_state.neighbors():
+            if tuple(map(tuple, neighbor.board)) not in explored:
+                frontier.put(neighbor)
+
+    return None
+
+def print_solution(solution):
+    steps = []
+    while solution:
+        steps.append(solution.board)
+        solution = solution.previous
+    steps.reverse()
+
+    for step in steps:
+        for row in step:
+            print(' '.join(map(str, row)))
+        print()
+
+# Example usage
+initial_board = [
+    [1, 2, 3],
+    [4, 0, 5],
+    [7, 8, 6]
+]
+
+goal_board = [
+    [1, 2, 3],
+    [4, 5, 6],
+    [7, 8, 0]
+]
+
+solution = solve_puzzle(initial_board, goal_board)
+if solution:
+    print("Solution found:")
+    print_solution(solution)
+else:
+    print("No solution found.")