thesoumyajitdey Goto Github PK

-tagschat

anytimedoctor

automated-attendance-system

Automated Attendance System is an app , a very intelligent app that can automatically able to distinguish between users and automatically able to check them in! But, when you checkout you have to physically have to press a button and the check out time is being shown and also presented with a very funny Bollywood MEME! Development: This App Has Been Developed using a new technology introduced by Google which is known as FLUTTER. It's a Hybrid Development Technology which means code and all the stuff has been only written using one time and the final code gets compiled in All the Mobile OS exits today: iOS , Android and Web! Use it and give honest feedback!

cardinfo

design-and-analysics-of-algorithm-all-important-questions

An Algorithm is a sequence of steps to solve a problem. Design and Analysis of Algorithm is very important for designing algorithm to solve different types of problems in the branch of computer science and information technology. This tutorial introduces the fundamental concepts of Designing Strategies, Complexity analysis of Algorithms, followed by problems on Graph Theory and Sorting methods. This tutorial also includes the basic concepts on Complexity theory.

e-commerce-android-

e-commerce-in-android-

Coming Soon.....

e-commgraphe

1st Commit

electricity-management-system-in-android-

The project is an Android based application where users can get instant electricity bill and pay them online via credit card. The system automates the conventional process of paying electricity bill by visiting the place. Users have to stand in queue for paying bill and wait for their turn. The process is tiresome and time consuming. They even have to wait for the bill being delivered to their place which sometimes can be delivered late by the delivery boy. Hence the system is developed to automate the electricity bill calculation and payment for user convenience. The system would be having two logins admin and user login. Admin can view user account details and can even add or updates things in their account. Admin has to feed the system with electricity usage data into respective users account through online web application. The system then calculates the electricity bill for every user and updates the information into their account every month. User can then view their electricity bill and pay on the spot before month end. If user is incapable of paying the bill before month end, it then calculates fine for each day.

facemash

:boom: The Infamous FaceMash Built In PHP

flutterexampleapps

[Example APPS] Basic Flutter apps, for flutter devs.

frontend

Frontend pages

frontendchallenge

given-an-array-of-integers-return-indices-of-the-two-numbers-such-that-they-add-up-to-a-specific-ta

guessthenumber

New Number Game for Kids

hopcroft--karp-algorithm-in-java

A vertex that is not the endpoint of an edge in some partial matching M M is called a free vertex. The basic concept that the algorithm relies on is that of an augmenting path, a path that starts at a free vertex, ends at a free vertex, and alternates between unmatched and matched edges within the path. It follows from this definition that, except for the endpoints, all other vertices (if any) in augmenting path must be non-free vertices. An augmenting path could consist of only two vertices (both free) and single unmatched edge between them. If M M is a matching, and P P is an augmenting path relative to M M, then the symmetric difference of the two sets of edges, M ⊕ P M \oplus P, would form a matching with size | M | + 1 |M| + 1. Thus, by finding augmenting paths, an algorithm may increase the size of the matching. Conversely, suppose that a matching M M is not optimal, and let P P be the symmetric difference M ⊕ M ∗ M \oplus M^* where M ∗ M^* is an optimal matching. Because M M and M ∗ M^* are both matchings, every vertex has degree at most 2 in P P. So P P must form a collection of disjoint cycles, of paths with an equal number of matched and unmatched edges in M M, of augmenting paths for M M, and of augmenting paths for M ∗ M^*; but the latter is impossible because M ∗ M^* is optimal. Now, the cycles and the paths with equal numbers of matched and unmatched vertices do not contribute to the difference in size between M M and M ∗ M^*, so this difference is equal to the number of augmenting paths for M M in P P. Thus, whenever there exists a matching M ∗ M^* larger than the current matching M M, there must also exist an augmenting path. If no augmenting path can be found, an algorithm may safely terminate, since in this case M M must be optimal. An augmenting path in a matching problem is closely related to the augmenting paths arising in maximum flow problems, paths along which one may increase the amount of flow between the terminals of the flow. It is possible to transform the bipartite matching problem into a maximum flow instance, such that the alternating paths of the matching problem become augmenting paths of the flow problem.[3] In fact, a generalization of the technique used in Hopcroft–Karp algorithm to arbitrary flow networks is known as Dinic's algorithm.

imgbot

An Azure Function solution to crawl through all of your image files in GitHub and losslessly compress them. This will make the file size go down, but leave the dimensions and quality untouched. Once it's done, ImgBot will open a pull request for you to review and merge. [email protected]

kitchen-made-easy

leetcode

Solving all Leetcode Questions

leetcode-1-two--number-java-solution-easy-

Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the same element twice. Example: Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].Connect Me ON: Linkedin:https://www.linkedin.com/in/soumyajit-dey-a07596158/ Github: https://github.com/SoumyajitDey

leetcode-9-palindrome-number-java-solution-easy-

Description of the Question : Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. Example 1: Input: 121 Output: true Example 2: Input: -121 Output: false Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome. Example 3: Input: 10 Output: false Explanation: Reads 01 from right to left. Therefore it is not a palindrome. Connect Me ON: Linkedin:https://www.linkedin.com/in/soumyajit-dey-a07596158/ Github: https://github.com/SoumyajitDey

overview-basic-java-programs-

Java is a general-purpose programming language that is class-based, object-oriented, and designed to have as few implementation dependencies as possible. It is intended to let application developers write once, run anywhere (WORA),[15] meaning that compiled Java code can run on all platforms that support Java without the need for recompilation.[16] Java applications are typically compiled to bytecode that can run on any Java virtual machine (JVM) regardless of the underlying computer architecture. The syntax of Java is similar to C and C++, but it has fewer low-level facilities than either of them. As of 2019, Java was one of the most popular programming languages in use according to GitHub,[17][18] particularly for client-server web applications, with a reported 9 million developers.[19] Java was originally developed by James Gosling at Sun Microsystems (which has since been acquired by Oracle) and released in 1995 as a core component of Sun Microsystems' Java platform. The original and reference implementation Java compilers, virtual machines, and class libraries were originally released by Sun under proprietary licenses. As of May 2007, in compliance with the specifications of the Java Community Process, Sun had relicensed most of its Java technologies under the GNU General Public License. Meanwhile, others have developed alternative implementations of these Sun technologies, such as the GNU Compiler for Java (bytecode compiler), GNU Classpath (standard libraries), and IcedTea-Web (browser plugin for applets). The latest versions are Java 13, released in September 2019, and Java 11, a currently supported long-term support (LTS) version, released on September 25, 2018; Oracle released for the legacy Java 8 LTS the last free public update in January 2019 for commercial use, while it will otherwise still support Java 8 with public updates for personal use up to at least December 2020. Oracle (and others) highly recommend uninstalling older versions of Java because of serious risks due to unresolved security issues.[20] Since Java 9 (and 10 and 12) is no longer supported, Oracle advises its users to immediately transition to the latest version (currently Java 13) or an LTS release.

qr-code-message-encryptor-

Encrypt And Decrypt Messages Using QR Code

recogext

A Machine Learning App that can get a text from an Image and you can copy it and use it!

soumyajitdey-sjournal

Project Comming Very Soon

tagging

Build-Tool to automatic increase the version and create a tag in the remote VCS repository.

test.github.io

Hosted

the-graphe

thesoumyajitdey

time-conversion---hackerrank-solution

Given a time in -hour AM/PM format, convert it to military (24-hour) time. Note: Midnight is 12:00:00AM on a 12-hour clock, and 00:00:00 on a 24-hour clock. Noon is 12:00:00PM on a 12-hour clock, and 12:00:00 on a 24-hour clock. Function Description Complete the timeConversion function in the editor below. It should return a new string representing the input time in 24 hour format. timeConversion has the following parameter(s): s: a string representing time in hour format Input Format A single string containing a time in -hour clock format (i.e.: or ), where and . Constraints All input times are valid Output Format Convert and print the given time in -hour format, where . Sample Input 0 07:05:45PM Sample Output 0 19:05:45