Skip to content

/ interview-techdev-guide

Pinned issues

💻 🎃 Welcome to Hacktoberfest 2019🎃 💻
#24 opened Oct 3, 2019 by sauravjaiswalsj
Open 1
Request to contributors
#151 opened Oct 5, 2019 by sauravjaiswalsj
Open
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

47 Open 200 Closed
47 Open 200 Closed
Author
Filter by author
Label
Filter by label
Use alt + click/return to exclude labels.
Projects
Filter by project
Milestones
Filter by milestone
Assignee
Filter by who’s assigned
Sort
Sort by
Newest Oldest Most commented Least commented Recently updated Least recently updated
Most reactions
👍 👎 😄 🎉 😕 ❤️ 🚀 👀
buy_sell stock
#669 opened Oct 27, 2020 by akshitagupta15june
Python implementation of Disjoint Set
#665 opened Oct 11, 2020 by atyachari
Disjoint set code in C++
#649 opened Oct 31, 2019 by Aashna-Agrawal
1
Longest Palindromic Subsequence in O(n) Complexity.
#648 opened Oct 31, 2019 by namanbansal013
1
Add comments
#641 opened Oct 30, 2019 by ark1911
1
A forensic lab wants to know whether a deceased person’s DNA matches a set of known relatives. It is known that the closest relatives will have most of the DNA matching, and as the relationship becomes farther, the matching genes will be lesser. For this, the DNA pattern of the deceased is given and the DNA pattern of 10 likely relatives are given. Write a program to identify the family of the deceased.
#632 opened Oct 26, 2019 by shrikantpadhy18
2
Write the code for bubble sort, insertion sort, quicksort(with random pivot), mergesort and heapsort for sorting N numbers. Vary the value of N from 500, 1000, 5000, 10000, 50000, 100000, 500000, 1000000, 5000000; and for each value perform 10 observations of execution time for the search operation. Plot the result in a graph.
#631 opened Oct 26, 2019 by shrikantpadhy18
3
[Math] Implement factorial in C Hacktoberfest
#623 opened Oct 26, 2019 by roeey777 Hacktoberfest
1
1
sliding window technique for greatest/smallest sub-array of a given array Hacktoberfest
#608 opened Oct 25, 2019 by ravi9989 Hacktoberfest
2
Max Heap Data Structure using C Hacktoberfest
#553 opened Oct 20, 2019 by shrikantpadhy18 Hacktoberfest
3
GOOGLE : FIND THE ODDS Hacktoberfest
#506 opened Oct 14, 2019 by siddharthrajaraja Hacktoberfest
Print all leaf nodes of a Binary Tree from left to right in C++ Hacktoberfest
#482 opened Oct 11, 2019 by NripeshKumar Hacktoberfest
2
Airbnb TwoSum implementation in C++ Hacktoberfest
#478 opened Oct 11, 2019 by imbipulkumar Hacktoberfest
1
Disjoint sets using c Hacktoberfest
#474 opened Oct 11, 2019 by vyom153069 Hacktoberfest
1
Disjoint Sets in java Hacktoberfest
#473 opened Oct 11, 2019 by vyom153069 Hacktoberfest
Implemented Sieve ofEratosthenes algorithm in Java Hacktoberfest
#467 opened Oct 10, 2019 by NripeshKumar Hacktoberfest
1
Heap data Structure Implementation in c++ Hacktoberfest
#462 opened Oct 9, 2019 by peruljain Hacktoberfest
Kosaraju's Algorithm Hacktoberfest
#461 opened Oct 9, 2019 by peruljain Hacktoberfest
1
Dynamic Programming Problems Hacktoberfest
#442 opened Oct 9, 2019 by nikhilgupta30 Hacktoberfest
2
[Algorithm]Insertion Sort [C] Hacktoberfest
#393 opened Oct 8, 2019 by Rex1911 Hacktoberfest
2
Google #Valid Hacktoberfest
#365 opened Oct 7, 2019 by siddharthrajaraja Hacktoberfest
1
Critical! Link broken for Contributor.md in README.md Hacktoberfest
#363 opened Oct 7, 2019 by imbipulkumar Hacktoberfest
1
Mazepath Algorithm in Java Hacktoberfest
#361 opened Oct 7, 2019 by rajk1121 Hacktoberfest
Goldmine in Dynamic Programming Hacktoberfest
#360 opened Oct 7, 2019 by Harvey38 Hacktoberfest
1
Double Ended Queue implementation using C Hacktoberfest
#358 opened Oct 7, 2019 by himanshujain171 Hacktoberfest
3
ProTip! Find all open issues with in progress development work with linked:pr.
You can’t perform that action at this time.