maoxiaoke

You are ChatGPT, a large language model based on the GPT-5 model and trained by OpenAI.
Knowledge cutoff: 2024-06
Current date: 2025-08-08

Image input capabilities: Enabled
Personality: v2
Do not reproduce song lyrics or any other copyrighted material, even if asked.
You're an insightful, encouraging assistant who combines meticulous clarity with genuine enthusiasm and gentle humor.
Supportive thoroughness: Patiently explain complex topics clearly and comprehensively.
Lighthearted interactions: Maintain friendly tone with subtle humor and warmth.

beratcmn

"""
Requirements:
annotated-types==0.6.0
cachetools==5.3.3
certifi==2024.2.2
cffi==1.16.0
charset-normalizer==3.3.2
click==8.1.7
colorama==0.4.6
curl-cffi==0.6.2

win3zz

GitHub Search Syntax for Finding API Keys/Secrets/Tokens

As a security professional, it is important to conduct a thorough reconnaissance. With the increasing use of APIs nowadays, it has become paramount to keep access tokens and other API-related secrets secure in order to prevent leaks. However, despite technological advances, human error remains a factor, and many developers still unknowingly hardcode their API secrets into source code and commit them to public repositories. GitHub, being a widely popular platform for public code repositories, may inadvertently host such leaked secrets. To help identify these vulnerabilities, I have created a comprehensive search list using powerful search syntax that enables the search of thousands of leaked keys and secrets in a single search.

Search Syntax:

(path:*.{File_extension1} OR path:*.{File_extension-N}) AND ({Keyname1} OR {Keyname-N}) AND (({Signature/pattern1} OR {Signature/pattern-N}) AND ({PlatformTag1} OR {PlatformTag-N}))

Examples:

**1.

adrianhajdin

import React, { useEffect, useState } from 'react'
import { ActivityIndicator, FlatList, Image, TouchableOpacity, View } from 'react-native'
import { Stack, useRouter, useSearchParams } from 'expo-router'
import { Text, SafeAreaView } from 'react-native'
import axios from 'axios'

import { ScreenHeaderBtn, NearbyJobCard } from '../../components'
import { COLORS, icons, SIZES } from '../../constants'
import styles from '../../styles/search'

Ayke

Prerequisites, i.e. the most important things

0. Time of writing: Jan 18, 2023, updated on Sep 22, 2024. The following assumes that you're trying to install CUDA on WSL2 Ubuntu.

1. Check support matrix first before you install any version of CUDA, because chances are the latest CUDA does not have cuDNN support yet, then you would have to re-install older version if you found out later.

   https://docs.nvidia.com/deeplearning/cudnn/support-matrix/index.html#cudnn-cuda-hardware-versions

   At the time of writing, the latest cuDNN version is 8.7 and it supports CUDA 11.8.

2. Windows 10 must be build 20145 or later, or you should be on Windows 11.

ivan

[This page is best viewed with https://github.com/ludios/expand-everything, which will load all the comnents below.]

Wherein I try to prioritize reading for the limited amount of time I have this year, and to remind myself to read more than just comments on the Internet. Because of problems of time and shifting interests, I will consider this a success if I read a third of the list. I'll reflect on the reading and deviations from the plan in Jan 2024.

{+} = added after initial planning

• Jamie Brandon - Reflections of a decade of coding
• {+} Aleksandr Hovhannisyan's blog
• the SvelteKit tutorial
• the SvelteKit documentation

luisquintanilla

priyavrat-misra

LeetCode Study Plans

• Programming Skills
• Data Structure
• Algorithm
• Graph Theory
• Dynamic Programming
• Binary Search
• SQL

ali-alaei

class Solution {
  public String alienOrder(String[] words) {
       //For catching Errors
       if(words.length==0) return "";
       //The dependencyMap and countMap data structures 
       Map<Character, Set<Character>> dependencyMap = new HashMap<>();
       Map<Character, Integer> countMap = new HashMap<>();
       //a boolean that determines whether we can build a graph or not
       boolean success = buildGraph(words, dependencyMap, countMap);
       if(!success) return "";

itzmeanjan

#!/usr/bin/python3

from math import ceil
from typing import List, Tuple
from random import randint


def bit_count(num: int) -> int:
    '''
    Same as len(bin(num)[2:])