Kumawat Lalit Kumawatlalit912
🎯
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| for nodejs just copy and run below command | |
| curl -fsSL https://deb.nodesource.com/setup_18.x | sudo -E bash - &&\ | |
| sudo apt-get install -y nodejs | |
| for nvm | |
| curl -o- https://raw.githubusercontent.com/nvm-sh/nvm/v0.39.3/install.sh | bash | |
| then just refresh the bashrc file |
Kumawatlalit912
/ insertLargeCsv.js
Created
February 24, 2023 06:15
how to insert large csv dataset in elastic using nodejs
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| const { Client } = require('@elastic/elasticsearch'); | |
| const fs = require('fs'); | |
| const readline = require('readline'); | |
| const csv = require('csv-parser'); | |
| const client = new Client({ node: 'http://localhost:9200' }); | |
| const filePath = '/path/to/large/csv/file'; // Replace with the path to your CSV file | |
| const chunkSize = 100000; // Replace with the desired chunk size |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| put hola/ | |
| { | |
| "settings":{ | |
| "analysis":{ | |
| "analyzer":{ | |
| "my-analyzer":{ | |
| "tokenizer":"my-tokenizer", | |
| "filter":["lowercase"] | |
| }, |
Kumawatlalit912
/ FAkejSonforCrud(postman).json
Last active
December 9, 2022 19:08
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| ---first | |
| dowload this npm install -g json-server | |
| then | |
| create fake data----> | |
| { | |
| "users": [ | |
| { | |
| "id": 1, | |
| "name": "user1", | |
| "email": "user1@testmail.com" |
Kumawatlalit912
/ MyOhMyPoshTheme.omp.json
Created
October 8, 2022 05:52
customize theme from tohtaltech(yt)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| { | |
| "$schema": "https://raw.githubusercontent.com/JanDeDobbeleer/oh-my-posh/main/themes/schema.json", | |
| "blocks": [ | |
| { | |
| "alignment": "left", | |
| "segments": [ | |
| { | |
| "background": "#c386f1", | |
| "foreground": "#ffffff", | |
| "leading_diamond": "\ue0b6", |
Kumawatlalit912
/ MyOhMyPoshTheme.omp.json
Created
October 8, 2022 05:52
customize theme from tohtaltech(yt)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| { | |
| "$schema": "https://raw.githubusercontent.com/JanDeDobbeleer/oh-my-posh/main/themes/schema.json", | |
| "blocks": [ | |
| { | |
| "alignment": "left", | |
| "segments": [ | |
| { | |
| "background": "#c386f1", | |
| "foreground": "#ffffff", | |
| "leading_diamond": "\ue0b6", |
Kumawatlalit912
/ ChocolatePickup.cpp
Created
September 10, 2022 15:54
3d dp concept chocolate pickup
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include<bits/stdc++.h> | |
| const int mod=-1e9+7; | |
| int dp[50][50][50]; | |
| int solve(int i,int j1,int j2,vector<vector<int>>&grid,int r,int c){ | |
| if( j1<0 || j2<0 || j1>c-1 || j2>c-1 ) return mod; | |
| if(i==r-1){ | |
| if(j1==j2) return grid[i][j1]; | |
| else{ | |
| return grid[i][j1]+grid[i][j2]; | |
| } |