Code Monkey home page Code Monkey logo

gitpad's Introduction

Hi there 👋 Ask me anything!

Abhinav jha's github

I am a software engineer with the power of patience towards tolerance of dirty code. With the power of smell, I have excelled my hobbies or cooking and travelling (I travel to breathe fresh air as in Indian cities we always have a pollution problem).

To know more about me, connect with me on the following channels:

Discord Badge Leave Contact Badge Linkedin Badge Medium Badge Website Badge Twitter Badge Instagram Badge Gmail Badge

Talking about Personal Stuffs:

GIF

  • 👨🏽‍💻 I'm currently a Software Developer at Nagarro Softwares working on Microservice and Cloud Computing.
  • 🌱 I'm currently exploring React, Python and Cloud Computing boundaries.
  • 👯 I'm looking for collaboration for The Polyglots Academy to support non-profit developer community.
  • 🤔 I'm interested to work with Natural Language Processing and IOT and AI Self Learning Cloud Services for cloud platforms.
    • Disclaimer: If you have any opportunity feel free to contact me.
  • 💬 Ask me anything on my Discord server.
  • 📫 Use above connections to reachout to me. Add Query: as subject.
  • 😄 Feel free to explore my life over here.

visitors

gitpad's People

Contributors

abhinav2127 avatar

Watchers

avatar avatar

gitpad's Issues

Data Structure Topics

Basic data structures

  • Array
  • Dynamic array / arraylist
  • Linked List
    Singly Linked List
    Doubly Linked List
    Stack
    Stack
    Stack using queue
    Queue
    Queue
    Circular queue
    Deque
    Priority queue
    Queue using stack
    Queue using Linked List
    Binary Tree
    Hash Map
    Hash Map
    Collision handling techniques in Hash map

Intermediate data structures

Binary Search tree
    maximum or minimum element in a binary search tree
Heap
    Min/ Max Heap
    Binomial Heap
    Fibonacci Heap
    Leftist Heap
    Soft Heap
    Pairing Heap
    Shadow Heap
    Min-Max heap
Self balancing binary tree:
    AVL Tree 
    Red Black Tree 
    Splay Tree
    B Tree
    B+ Tree
Bitmask
Adjacency matrix 
Adjacency list 
Lowest Common Ancestor in a Binary Tree 
Union Find
Trie 
Range minimum query
    Native approach
    Square root decomposition
    Segment tree
    Fenwick tree
    Sparse table
    Cartesian tree
Range addition query
    Native approach
    Square root decomposition
    Segment tree
    Fenwick tree
    Sparse table
    Cartesian tree
Finding the number of elements less than a given number in a given range
    Fenwick tree
Number of distinct elements in a index range
Square Root Decomposition
Sparse tree
Sparse table 
Binary lifting in Lowest Common Ancestor
Fractional cascading (binary search)
Longest Common Prefix array (LCP)
Prefix Sum Array 1
Rope Data Structure
Gap buffer
Zipper
Piece table
order statistics tree
Patracia tree
Policy based data structures (C++)

Advanced data structures

XOR Linked list 5 
XOR Linked list in Java
Using XOR Linked list to implement backward and forward navigation of visited web pages
Using XOR Linked list to implement Most Recently Used list
Radix tree 
K dimensional tree 
Implicit K D tree
KDB tree
R tree
M tree
Range tree
Interval tree
Ternary Search Tree 3
Cartesian Tree
Palindromic Tree
Segment tree
    Segment Tree 4
    2D Segment Tree
    Lazy propogation in Segment tree
    Persistent segment tree 
    Heavy light decomposition in Segment tree
    Li Chao tree
Fenwick Tree / Binary Index Tree (BIT)
    Fenwick Tree 4
    2D Fenwick Tree
Octree
Quad Trees 
Quad edge
Winged edge
Anagram Trees
X fast tries 1
Y fast tries
Van Emde Boas Trees
Sqrt Tree
Suffix array
Suffix tree
Ukkonen’s Suffix Tree algorithm
ScapeGoat Tree
Burkhard Keller Tree
Rainbow table
Finger tree
Wavelet tree

Probabilistic data structures

Bloom filter
Count Min sketch
Skip list
Treap
Quotient filter
Rapidly-exploring Random Tree (RRT)

Kinetic data structure

Kinetic heap
Kinetic sorted list
Kinetic minimum spanning tree
Kinetic tournament/ priority queue

Problems / Applications of above data structures

Infix to postfix using Stack
Count inversions in an array using Fenwick Tree
postfix to infix using stack

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.