mishrasamiksha Goto Github PK

followers: 17.0 following: 9.0 repos: 96.0 gists: 0.0

Name: Samiksha Mishra

Type: User

Bio: My mission in life is not merely to survive, but to thrive; and to do some with passion, some compassion, some humour and some style.

Location: Bhubaneswar

Samiksha Mishra's Projects

actions

Author and use Azure Actions to automate your GitHub workflows

alpha_vantage

A python wrapper for Alpha Vantage API for financial data.

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.

atsamd

Target atsamd microcontrollers using Rust

awesome-microbit

A curated list of BBC micro:bit resources.

awesome-rl-for-cybersecurity

A curated list of resources dedicated to reinforcement learning applied to cyber security.

awesome-typst

Awesome Typst Links

aws-toolkit-jetbrains

AWS Toolkit for JetBrains - a plugin for interacting with AWS from JetBrains IDEs

bbgo

The modern cryptocurrency trading bot framework written in Go.

better-terrain

Terrain plugin for Godot 4

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