Name: Nayeem Mollick Joy
Type: User
Company: Boom Software , UK .
Bio: Software Engineer, Boom Software, UK. A Passionate Competitive Programmer, Love to work out algorithms, data structure, and math problems.
Location: Rajshahi University, Rajshahi.
Nayeem Mollick Joy's Projects
Web Panel of Moti Talk
One kind of special keyboard which has two option user and viewer. If user uses this keyboard ,then on another hand one can see details whatever one is typing by this keyboard.
Number Theory , Math, Inclusion-Exclusion,Combinatorics,Counting ,Sieve ,Euler's totient ,Fermat's theorem .
Solutions to ACM ICPC - style problems
Online shopping app like daraz(e-commerce app).It has also admin option ,admin can add new products or can delete any product from store.User has to register an account , after that if user forgets ,one can retrieve original password by pusing username and number.One can use this for a online medium business.
Uva Normal Medium Problem Solution With Logic
Persistent Segment Tree with pointer algorithm
Probability , Expected Value ,Important Comments Line .
Only Graph , Tree , LinkedList , Backtracking Problem Solutions
Normal Math and Randomly Number Theory Problems
A very normal e-commerce website prototype demo using react js and javscript styling .
Strongly Connected Component (SCC), Cycle Detecting and Topological Sort problems , Disjoint Set Union (DSU) problems.
Segment tree with lazy propagation , Segment tree without lazy propagation ,Binary Index Tree (BIT)
sorting , binary search , ternary search ,custom-sort ,2D sort
Sparse Table , RMQ (Range Minimum Query) and LCA (Lowest Common Ancestor)
Normal String problems implementation Problems
n*(logn)^2 algorithm , LCP array
suffix automation , its most famous problems
A normal kid's tic-tac-toe game with computer by react-Typescript.
conversion of texts to voice and generation of mp3
AVL Tree, Treap.
Prefix tree (Trie ) and Xor techniques with Trie