I am a Full Stack Developer with significant experience with modern backend stacks and front-end frameworks. My proficiency lies not just on implementing high-level frameworks and libraries but also in core programming and problem solving to turn ideas into reality.
I get highly motivated on writing code that best suites SOLID, YAGNI, DRY, immutability, scalability and other principals. I love working collaboratively with team.
I enjoy implementing complex algorithms and generating data with multiple joins and filters and play with them throughout Single Page Application (SPA).
In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child.
AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes.
This web app visualizes how AVL balancing is performed on Binary Tree
Dangerous Dave is a 1988 computer game by John Romero. It was developed for the Apple II and MS-DOS
The objective of the game is to collect gold cups to move on to the next level. Dave needs to find key and pass through door to unlock next level.
Blockers like fires, currents, monsters are around the way which should be tackled