pknowledge

Installing NemoClaw

1. Prerequisites

Before starting, ensure you have these components installed on your Windows host:

• WSL2: Open PowerShell as Administrator and run wsl --install. Ensure you are using a modern distribution like Ubuntu 22.04 or 24.04.
• Docker Desktop: Download and install Docker Desktop.
  • In Docker Settings, go to Resources > WSL Integration and ensure your Ubuntu distro is toggled ON.
• NVIDIA API Key: Go to build.nvidia.com, sign up for a free account, and generate an API key (it will start with nvapi-).

pknowledge

version: '3.8'

services:
  sql:
    image: mcr.microsoft.com/azure-sql-edge
    container_name: sql
    ports:
      - "1433:1433"
    environment:
      ACCEPT_EULA: "1"

pknowledge

#define ROW_1 2
#define ROW_2 3
#define ROW_3 4
#define ROW_4 5
#define ROW_5 6
#define ROW_6 7
#define ROW_7 8
#define ROW_8 9

#define COL_1 10

pknowledge

#Image Captcha: 

from captcha.image import  ImageCaptcha 

image = ImageCaptcha 

data = image.generate(‘9876543’) 

image.write (‘9876543’,’sam.png’) 

pknowledge

# UNDIRECTED GRAPH

'''
ADJ MATRIX
ADJ LIST
'''

'''
V E
FOR EVERY EDGE

pknowledge

# n convert it into binary
def intToBin(n):
    return str(bin(n))[2:]

# bin to int 
def binToInt(s):
    return int(s,2)

# kth bit set from right
def kthbit(n,k):

pknowledge

# ispowerof 2
# n -> input
# True/False -> output
# check if n is a powerof 2
# 512 -> True 512 = 2**9
# 1024 -> True 1024 = 2**10

def ispowerof2(n):
    # T.C = O(1)
    if n <= 0:

pknowledge

# bitwise operator and - &
# bitwise operator or - |
# bitwise operator not - ~
# bitwise operator xor - ^
# bitwise operator  right shift - >> 
# bitwise operator left shift <<
# rightshift is divide in power of 2
# leftshift is multiply in power of 2
def evenodd(n):
    if n&1 == 1:

pknowledge

from math import *
def genprimes(n):
    primes = [True]*(n+1)
    primes[0] = False
    primes[1] = False
    for p in range(2,int(sqrt(n))+1):
        if primes[p] == True:
            for i in range(p*p,n+1,p):
                primes[i] = False

pknowledge

# Prime numbers two factors 1 , Number Itself
# Approach One O(n)
# Aprroach Two: Base Case + Hint: O(1) -> O(root(N))
from math import *

def approach1(n):
    divcnt = 0
    for i in range(1,n+1): # [1,n]
        if n%i == 0:
            divcnt+=1