programmingGod-byte’s gists

programmingGod-byte / hacking.cpp

Created October 30, 2025 08:01

	class Solution {
	public:
	int lengthOfLIS(vector<int>& nums) {
	vector<int>ans;
	for(int i=0;i<nums.size();i++){
	auto it = lower_bound(ans.begin(),ans.end(),nums[i]);
	if(it==ans.end()){
	ans.push_back(nums[i]);
	}else{
	*it = nums[i];

programmingGod-byte / test-neft.json

Created October 23, 2025 09:35

	{
	"name": "test nft",
	"description": "Description for Test nft",
	"image": "https://raw.githubusercontent.com/programmingGod-byte/cpp-algorithm/refs/heads/main/logo.png"
	}

programmingGod-byte / mycollection.json

Created October 23, 2025 09:11

	{
	"name": "test Collection",
	"description": "Description for Test collections",
	"image": "https://raw.githubusercontent.com/programmingGod-byte/cpp-algorithm/refs/heads/main/logo.png"
	}

programmingGod-byte / token.json

Created October 23, 2025 08:29

	{
	"name": "Devent Token",
	"symbol": "DEVT",
	"description": "Devent Token (DEVT) is a Solana-based utility token designed for powering decentralized event management and ticketing solutions.",
	"image": "https://example.com/images/devent_token.png"
	}

programmingGod-byte / gist:68bd5dd87fdf4595177ec5113143f73d

Created September 18, 2025 05:47

final_exam_hack.cpp

	#include <bits/stdc++.h>
	using namespace std;

	void dfs(int node, vector<int> adj[], int vis[], vector<int> &ls)
	{
	vis[node] = 1;
	ls.push_back(node);
	for (auto it : adj[node])
	{
	if (!vis[it])

programmingGod-byte / hash.cpp

Created September 11, 2025 08:02

	#include <bits/stdc++.h>
	using namespace std;

	class Solution {
	private:
	void dfs(int node, int vis[], stack<int> &st,
	vector<int> adj[]) {
	vis[node] = 1;
	for (auto it : adj[node]) {
	if (!vis[it]) dfs(it, vis, st, adj);

programmingGod-byte / gist:dd7b8a73e17bff90aecc42a13b1eac53

Created September 4, 2025 07:54

hack

	#include<bits/stdc++.h>
	using namespace std;

	int partition(vector<int>& arr, int l, int r, int pivot){
	int pivotIndex = find(arr.begin()+l, arr.begin()+r+1, pivot) - arr.begin();
	swap(arr[pivotIndex], arr[r]);
	int storeIndex = l;

	for(int i = l; i < r; i++){
	if(arr[i] < pivot){

programmingGod-byte / Dockerfile

Created October 2, 2024 06:08 — forked from piyushgarg-dev/Dockerfile

Docker In One Shot

	FROM ubuntu

	RUN apt-get update
	RUN apt-get install -y curl
	RUN curl -sL https://deb.nodesource.com/setup_18.x \| bash -
	RUN apt-get upgrade -y
	RUN apt-get install -y nodejs

	COPY package.json package.json
	COPY package-lock.json package-lock.json