Skip to content

Instantly share code, notes, and snippets.

View SaptakS's full-sized avatar

Saptak Sengupta SaptakS

View GitHub Profile

Keybase proof

I hereby claim:

  • I am saptaks on github.
  • I am saptaks (https://keybase.io/saptaks) on keybase.
  • I have a public key ASCigLm8JMrwAEYCiM-Oy_ayXkTGv1KqH0-mTxAkfE_vVwo

To claim this, I am signing this object:

@SaptakS
SaptakS / gpg-import-and-export-instructions.md
Created August 23, 2019 08:46 — forked from chrisroos/gpg-import-and-export-instructions.md
Instructions for exporting/importing (backup/restore) GPG keys

Every so often I have to restore my gpg keys and I'm never sure how best to do it. So, I've spent some time playing around with the various ways to export/import (backup/restore) keys.

Method 1

Backup the public and secret keyrings and trust database

cp ~/.gnupg/pubring.gpg /path/to/backups/
cp ~/.gnupg/secring.gpg /path/to/backups/
cp ~/.gnupg/trustdb.gpg /path/to/backups/

or, instead of backing up trustdb...

@SaptakS
SaptakS / gist:7c75db0bdf6e892ea5b55f380ad1c439
Created December 5, 2017 06:47 — forked from rxaviers/gist:7360908
Complete list of github markdown emoji markup

People

:bowtie: :bowtie: 😄 :smile: 😆 :laughing:
😊 :blush: 😃 :smiley: ☺️ :relaxed:
😏 :smirk: 😍 :heart_eyes: 😘 :kissing_heart:
😚 :kissing_closed_eyes: 😳 :flushed: 😌 :relieved:
😆 :satisfied: 😁 :grin: 😉 :wink:
😜 :stuck_out_tongue_winking_eye: 😝 :stuck_out_tongue_closed_eyes: 😀 :grinning:
😗 :kissing: 😙 :kissing_smiling_eyes: 😛 :stuck_out_tongue:

GSoC 2016 Final Product, Saptak Sengupta - FOSSASIA

I worked on the Open Event Organiser Server Project of FOSSASIA this summer. The idea was to build a server open for all event organiser to create their own event and make it completely customisable. I have implemented quite some features like custom session and speaker forms, call for papers, event wizard, scheduler calendar, profile page and guest pages. Apart from this I have worked in improving the UI at various places and also making the project mobile ready. I have worked on making the entire project responsive so that it can be used smoothly in all devices. I have also cleaned the code and configured codacy to suit our project. I have worked on the entire architecture of the project along with other team members and also worked on testing and bug fixings.
The project has a lot of features and is quite unique from other such available projects. The project is highly customisable and grea

@SaptakS
SaptakS / domain-age.php
Created January 20, 2016 08:48
PHP code to find Domain Age of a domain
<?php
$domain = $_GET['domain'];
$w = new DomainAge();
echo $w->age($domain);
class DomainAge
{
private $WHOIS_SERVERS = array(
"com" => array("whois.verisign-grs.com", "/Creation Date:(.*)/"),
"net" => array("whois.verisign-grs.com", "/Creation Date:(.*)/"),
@SaptakS
SaptakS / iter_deep_8puzzle.py
Created September 4, 2015 18:15
8 puzzle using iterative deepening
# -*- coding: utf-8 -*-
"""
Created on Fri Sep 04 23:10:25 2015
@author: SAPTAK
"""
import math
import collections
class Node:
@SaptakS
SaptakS / q1.py
Created September 4, 2015 16:47
Maze Problem (A.I.)
from math import sqrt
import heapq
import itertools
class Node:
def __init__(self, x, y, cost):
self.x = x
self.y = y
self.cost = cost
def __eq__(self, other):
return (self.x, self.y) == (other.x, other.y)
@SaptakS
SaptakS / n-PuzzleProblem-variation-in-goal.py
Created August 25, 2015 14:11
This problem is basically the same as that mentioned in this gist(https://gist.github.com/SaptakS/911d597fbff5796bfb62). The only variation here is in the goal. in this case, the goal can have 8 possible combinations obtained by rotating the goal_board by 90 degree or by rotating and then transposing.
import math
import collections
class Node:
def __init__(self, puzzle, parent=None, action=None):
self.puzzle = puzzle
self.parent = parent
self.action = action
def state(self):
#print(self.puzzle.board)
@SaptakS
SaptakS / n-PuzzleProblem-using-bfs.py
Created August 25, 2015 14:08
This is the solution for the n-puzzle problem (a very famous A.I. lab question) using breadth first search algorithm. Here I have used a single array to represent the 2d array. I have a class Node which contains all the informations about a particular node in the graph such as puzzle, parent, action. The Environment class contains all the detail…
import math
import collections
class Node:
def __init__(self, puzzle, parent=None, action=None):
self.puzzle = puzzle
self.parent = parent
self.action = action
def state(self):
#print(self.puzzle.board)