Samiksha Mishra's repositories
Tower_of_Hanoi
The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower[1] and sometimes pluralized) is a mathematical game or puzzle. It consists of three rods and a number of disks of different sizes, which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules: Only one disk can be moved at a time. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod. No larger disk may be placed on top of a smaller disk.
Array_Target_Sum_Pair
Take as input N, the size of array. Take N more inputs and store that in an array. Take as input “target”, a number. Write a function which prints all pairs of numbers which sum to target. Constraints: Length of the arrays should be between 1 and 1000. Sample Input: 5 1 3 4 2 5 5 Sample Output: 1 and 4 2 and 3 Explanation: Find any pair of elements in the array which has sum equal to target element and print them.
Arrays_Target_Sum_Triplet
Take as input N, the size of array. Take N more inputs and store that in an array. Take as input “target”, a number. Write a function which prints all triplets of numbers which sum to target. Input Format: First line contains input N. Next N lines contains the elements of array and N+1 line contains target number. Constraints: Length of Array should be between 1 and 1000. Output Format: Print all the triplet present in the array. Sample Input: 9 5 7 9 1 2 4 6 8 3 10 Sample Output: 1, 2 and 7 1, 3 and 6 1, 4 and 5 2, 3 and 5 Explanation: Array = {5, 7, 9, 1, 2, 4, 6 ,8 ,3}. Target number = 10. Find any three number in the given array which sum to target number.
Biggest-Number-Formation
A cpp program to make largest number from given numbers we are provided with an array of numbers. The basic approach for this can be done using stacks, but here we can also arrange the same by using the sorting techniques and swapping methods. Although it can be time taking but it is very helpful for those who avoid doing this using stacks or linked list. We need to arrange them in a way that results the largest value that can be formed. Input Format: First line contains integer T which is number of test case. For each test case, it contains an integer n which is the size of array A[] and next line contains n space separated integers A[i] . Constraints: 1<=t<=100 ;1<=m<=100 ;1<=A[i]<=10^5; Output Format: Print the largest value. Sample Input: 1 4 54 546 548 60 Sample Output : 6054854654 Approach to solve the problem : - 1.We will find the largest digit among the elements which is at the end position. 2. We will swap the found element having the largest digit in its front with the first element 3.By fixing the first element we will sort the rest of the arrays in decreasing order. And then make the rearranged decreased elements followed by the first element. CONCEPT USED : 1. Swapping concept 2.Sorting
Building-a-Simple-Chatbot-in-Python-using-NLTK
Building a Simple Chatbot from Scratch in Python (using NLTK)
finger-detection
To detect the number of fingers in a video
github-slideshow
A robot powered training repository :robot:
GitHubGraduation-2021
Join the GitHub Graduation Yearbook and "walk the stage" on June 5.
Hand-Detection-Finger-Counting
Detect Hand and count number of fingers using Convex Hull algorithm in OpenCV lib in Python
Hello-Github
So, it's my first repository. Hope to learn many things here and contribute my efforts too. But, to be honest I am having no idea what to do at the moment. Just hoping for the best !
Matrix_Search
Given an n x m matrix, where every row and column is sorted in increasing order, and a number x . Find if element x is present in the matrix or not. Input Format: First line consists of two space separated integers N and M, denoting the number of element in a row and column respectively. Second line of each test case consists of N*M space separated integers denoting the elements in the matrix in row major order. Third line of each test case contains a single integer x, the element to be searched. Constraints: 1 <= N,M <= 30 0 <= A[i] <= 100 Output Format: Print 1 if the element is present in the matrix, else 0. Sample Input: 3 3 3 30 38 44 52 54 57 60 69 62 1 6 18 21 27 38 55 67 55 Sample Output: 0 1 Explanation: Search the element in the sorted matrix. If the element is present print 1 otherwise print 0. In the sample input,in first case 62 is not present in the matrix so 0 is printed. Similarly, for second case 55 is present in the matrix so 1 is printed. Time Limit: 1 sec
opencv
Open Source Computer Vision Library
PartsUnlimited
.Net Core + SQL Azure app for DevOps Scenarios
QuickLabs
Solution of Google Cloud Quick Labs
v4
Fourth iteration of my personal website built with Gatsby