Skip to content

Instantly share code, notes, and snippets.

Avatar
:octocat:
WFH

Hritik Kumar Sharma hrit-ikkumar

:octocat:
WFH
View GitHub Profile
View PostgreSQLGettingStartedCommands
sudo -i -u postgres
sudo -i -u hritikkumar #for specific user hritikkumar
psql #for the psql query command line interface
\dt #tables
View EulerianPath
/**
* Implementation of finding an Eulerian Path on a graph. This implementation verifies that the
* input graph is fully connected and supports self loops and repeated edges between nodes.
*
* <p>Test against: https://open.kattis.com/problems/eulerianpath
* http://codeforces.com/contest/508/problem/D
*
* <p>Run: ./gradlew run -Palgorithm=graphtheory.EulerianPathDirectedEdgesAdjacencyList
*
* <p>Time Complexity: O(E)
View demo
mongod --dbpath=data/ --bind_ip 127.0.0.1
View utf-8''week1.ipynb
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.