mehboobali98 Goto Github PK
Name: Mehboob Ali
Type: User
Company: @7Vals
Bio: SWE | Full Stack Engineer | RoR | FAST'21 Alumnus
Location: Lahore, Pakistan
Name: Mehboob Ali
Type: User
Company: @7Vals
Bio: SWE | Full Stack Engineer | RoR | FAST'21 Alumnus
Location: Lahore, Pakistan
Contains solutions to the 30 Days of Code challenges on HackerRank.
Collection of algorithms in multiple programming languages.
Annotate Rails classes with schema and routes info
Audited (formerly acts_as_audited) is an ORM extension that logs all changes to your Rails models.
😎 Awesome lists about all kinds of interesting topics
It is a classic dynamic programming problem in which we have to collect items in the knapsack in such a way that our profit is maximized. The difference between this problem and the fractional knapsack one is that you CANNOT take a fraction of an item.
A dealer produces a sequence s1, …, sn of .cards, face-up, where each card si has a value vi. Then two players take turns picking a card from the sequence, but can only pick the first or the last card of the (remaining) sequence. The goal is to collect cards of largest total value.
Open-source customer engagement suite, an alternative to Intercom, Zendesk, Salesforce Service Cloud etc. 🔥💬
A composite pattern is a partitioning design pattern and describes a group of objects that are treated the same way as a single instance of the same type of object. The intent of a composite is to “compose” objects into tree structures to represent part-whole hierarchies. It allows you to have a tree structure and ask each node in the tree structure to perform a task.
📊 Data Science Resources, Data Science Standards & Machine Learning Pipelines
Codecademy Docs is a collection of information for all things code. 📕
E-Workers is a home services app for hiring workers for day-to-day tasks. The aim of the app is to make these tasks easy and convenient for the users. Workers can be hired on the app with a few simple clicks.
In the Edit Distance problem, we need to find the minimum number of edits or operations required to make two strings equal.
Manually generating a Mid-term exam schedule for NUCES-FAST Lahore is an involved task as a diverse set of constraints must be enforced while creating the schedule. In this repository, the famous natured inspired Genetic Algorithm combined with local search is implemented for solving the scheduling problem.
For empowering community 🌱
The repository contains resources for our Final Year Project - Structuring Scholarly Contributions in Open Research Knowledge Graph.
The Open Source Data Science Masters
Godot Engine official documentation
A modified Huffman algorithm is implemented for compressing sequences of characters from an alphabet of size n, where the characters occur with known frequencies f1, f2, …, fn. The algorithm encodes each character with a variable-length codeword over the values 0, 1, 2 such that no codeword is a prefix of another codeword and so as to obtain the maximum possible compression.
Human Essentials is an inventory management system for diaper, incontinence, and period-supply banks. It supports them in distributing to partners, tracking inventory, and reporting stats and analytics.
The test cases of the IMS (Inventory Management System) have been automated using Selenium.
The Web-based application would be used for lending, issuance, and returning of different items. The details of these transactions would be stored in the database. Moreover, details regarding different items such as item quantity, item precedence, etc would also be stored in the database to keep track of the items available in the inventory.
The popular IRIS dataset is used for the training of linear and non-linear SVM models. The hyper-parameters are fine-tuned of the models are fine-tuned using K-Fold Cross-Validation and GridSearch to improve model performance.
Iterator pattern is used to get a way to access the elements of a collection object in a sequential manner without any need to know its underlying representation.
Given an array or list of n integers, we need to find the longest increasing subsequence. The array could include positive and negative integers.
In this problem, we have to compute the longest zig-zag subsequence using Dynamic Programming given a sequence of n integers as input.
Mask R-CNN for object detection and instance segmentation on Keras and TensorFlow
The solution to the popular maximum sum sub-array problem has been provided using the Dynamic Programming approach.
It contains config for my GitHub profile.
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.