Language Breakdown
Lines of code distribution across 50 owned repositories
T-Shaped Developer
T-shapedDeep in Jupyter Notebook with broad versatility
Collaboration Network
Global Impact visualization
Repos
62
PRs
0
Growth
+18%
Top Collaborators
No collaborator data yet.
Coding Streak
Contribution activity over the past year
Vibhav Bobade
@waveywaves
Vinamra Jain
@vinamra28
srirseshadri
@srirseshadri
James Strachan
@jstrachan
Gareth Evans
@garethjevans
Top Repositories
Implemented a BST with pure x86 Assembly with all basic operations. A binary search tree (BST) is a binary tree where each node has a Comparable key (and an associated value) and satisfies the restriction that the key in any node is larger than the keys in all nodes in that node's left subtree and smaller than the keys in all nodes in that node's right subtree.
Bootstrap Kubernetes the hard way on Google Cloud Platform. No scripts.
A context-free grammar is a set of recursive rules used to generate patterns of strings. Context-free grammar can describe all regular languages and more, but it cannot describe all possible languages. I used C++ to check whether the given structure/sentence(input) satisfies the given grammar or not.
Linux, Jenkins, AWS, SRE, Prometheus, Docker, Python, Ansible, Git, Kubernetes, Terraform, OpenStack, SQL, NoSQL, Azure, GCP, DNS, Elastic, Network, Virtualization. DevOps Interview Questions
Guidance for routine operations in Azure.
Open Source Impact
Contributions to external projects
No external contributions found.