nachiket18 Goto Github PK

100-pandas-puzzles

100 data puzzles for pandas, ranging from short and simple to super tricky (60% complete)

5905-fall-2021

big-data_external_memory_project

Repository for computing external memory algorithm for betweeness centrality

breadthfirstsearchsmartpointer

This is the code for C++ Users group challenge to create a BreadthFirstSearch solution for a binary tree

compiler

Classroom Object-Oriented Language Compiler

compiler-project

code framework for front-end and back-end of compiler

concurrentgraphds

This repository contains the source code of the Concurrent Graph Data Structure

coursera-data-structures-and-algorithms

Coursera: Data Structures and Algorithms Specialization

databasequeriesmonet

Queries to be run on TPC-H benchmark for comparison on MonetDB and MySQL

employee-performance-review-system-final

Final Year Project

igraph

Library for the analysis of networks

independentstudy

The repository contains code for Independent Study on Type-2 Diabetes and OSteoporosis

kaizn

Repository for the take-home challenge

leetcode-practice

mlxtend

A library of extension and helper modules for Python's data analysis and machine learning libraries.

my-app

nachiket18.github.io

Repository to host the online resume

nist-chem

Python functionality to access NIST Webbook for Chemistry

opinionmining

Repository for Opinion Mining Framework

optum-case-anomaly-detectors

peregrine

A blazing fast language for the blazing fast world(WIP)

powerconsumption

The tutorial for TimescaleDB which is explained with the help of Household power consumption data from UCI repository

pygrametl-introduction

The Pygram ETL tutorial with access to column store database MonetDB

quicksort

rla_spark

RLA - Record Linkage code implementation in Spark

splink

vizier-scala

The Vizier kernel-free notebook programming environment

vizierdb-jupyterintegration-

The repository contains code that will be used for VizierDB project as a component to convert the Jupyter Notebook in to Vizier accepted format

widewells

For an array of integers, find pairs of positions holding equal values provided there is no position in between with a smaller value. e.g. For Input: [2, 3, 2, 2, 1, 2, 1] 0 indexed Output: (0, 2) (0, 3) (2, 3) (4, 6) Notes: (3, 5) is not a valid output element because 1 (< 2) is in between. (0, 3) is valid since both 3 and 2 in between are not smaller (>=).

windowmeasures

C++ Users group - Mumbai task for Windowed Measure