Skip to content
This repository contains curated technical interview questions by fn+geeks community
Python Java C++ C Ruby C# Other
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
Algorithms
Company Specific Interview Questions
Data Structures
.DS_Store
.gitignore
CODE_OF_CONDUCT.md
CONTRIBUTING.md
ClassicalQuestions.md
LICENSE
README.md

README.md

Welcome to the interview resources (footsteps) by FnPlus Community to crack your dream company :octocat:

This repository is a part of HacktoberFest-an event organised by DigitalOcean. You are requested to create your profile using the above link to be a part of it.

This repository contains examples of various algorithms written on different programming languages...

Contributors

Contributing

  1. Have a look at open issues. They contain the list of algorithms/DS we plan to be implemented. Pick an unassigned issue.
  2. You can also create a new issue for an algorithm that is not in the list.
  3. Make sure you are assigned for the issue.
  4. Fork the repo!
  5. Clone the forked repository to local system.
  6. Create your feature branch: git checkout -b my-new-feature
  7. Be sure to not include any compiled binaries in the patch.
  8. Commit your changes: git commit -am 'Add some feature'. Go through Commit Messages guidelines
  9. Push to the branch: git push origin my-new-feature While sending a PR make sure you follow one issue per PR rule.
  10. Submit a pull request 😄

See Extended Contributing Guidelines

Important Data Structures

Data Structure C CPP Java Python
Dynamic array
Stack
Singly Linked List
Double Linked List
Circular Linked List
Hash Tables
Heap
Fibonacci Heaps
Disjoints Sets
Adjacency matrix
Queue
Priority Queue

Important Algorithms

Maths C CPP Java Python
Euclidean GCD
Fibonacci series
Pallindrome number
Perfect number :octocat:
Searching and Sorting C CPP Java Python
QuickSort :octocat: :octocat:
Merge Sort :octocat: :octocat: :octocat:
Insertion Sort :octocat:
Counting Sort
Radix Sort :octocat:
Bubble Sort
Heap Sort
Selection Sort :octocat:
Linear Search
Binary Search :octocat:
Tree traversal C CPP Java Python
Pre-Order Traversal
Post-Order Traversal
In-Order Traversal
Binary Search Tree
Height of the Tree
Depth of the Tree
AVL Tree
Spanning Tree
Segment Tree
Fenwick Tree
Trie
Graph Traversal C CPP Java Python
Breadth First Search
Depth First Search
Topological Sort
Kruskals Algorithms
Prim's Algorithms
Belmon Ford Algorithms
Floyd-Warshall Algorithm
Dijkstra's Algorithm

Curated resources (Footsteps) by FnPlus Community

Coding Practices

Video Lectures

Interview Books

Guides

Courses

Sites

Videos

System Design

Computer Science News

Sample Run

Language Steps
Python
python [filename.py]
C
gcc [filename.c]
./a.out # unix
a.exe # windows
CPP
g++ [filename.cpp]
./a.out # unix
a.exe # windows
Java
javac [filename.java]
java [filename]
Golang
go build [filename.go]
[./filename]

Support

Feel free to contact us at our E-mail, we'd be happy to help! Check out our app called footsteps which helps you keep a log of your online learning and inspire others to follow it!

Notes

Only project maintainers should merge a PR. Other members can add their reviews to a PR but the merging should be done by only a project maintainer.

Authors

You can’t perform that action at this time.