/interview-techdev-guide

This repository contains curated technical interview questions by fn+geeks community

Primary LanguageC++MIT LicenseMIT

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

(https://github.com/divyhshah)

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 :octocat:
Stack :octocat: :octocat: :octocat: :octocat:
Singly Linked List :octocat: :octocat: :octocat:
Double Linked List :octocat: :octocat:
Circular Linked List :octocat:
Hash Tables :octocat: :octocat: :octocat:
Heap
Fibonacci Heaps :octocat:
Disjoints Sets :octocat:
Adjacency matrix
Queue :octocat: :octocat: :octocat: :octocat:
Priority Queue

Important Algorithms

Maths C CPP Java Python
Euclidean GCD :octocat: :octocat: :octocat: :octocat:
Fibonacci series :octocat: :octocat: :octocat: :octocat:
Pallindrome number :octocat: :octocat: :octocat: :octocat:
Perfect number :octocat: :octocat: :octocat: :octocat:
Magic number :octocat:
Polite number :octocat: :octocat: :octocat:
Sieve of Eratosthenes :octocat: :octocat: :octocat:
Modular exponentiation :octocat: :octocat: :octocat: :octocat:
Searching and Sorting C CPP Java Python
QuickSort :octocat: :octocat: :octocat:
Merge Sort :octocat: :octocat: :octocat: :octocat:
Insertion Sort :octocat: :octocat: :octocat:
Counting Sort :octocat:
Radix Sort :octocat:
Bubble Sort :octocat: :octocat:
Heap Sort :octocat: :octocat:
Selection Sort :octocat: :octocat:
Linear Search :octocat: :octocat:
Binary Search :octocat: :octocat: :octocat: :octocat:
Tree traversal C CPP Java Python
Pre-Order Traversal :octocat:
Post-Order Traversal :octocat:
In-Order Traversal :octocat:
Binary Search Tree :octocat:
Height of the Tree
Depth of the Tree
AVL Tree
Spanning Tree
Segment Tree
Fenwick Tree
Trie :octocat: :octocat:
Graph Traversal C CPP Java Python
Breadth First Search :octocat: :octocat: :octocat:
Depth First Search :octocat: :octocat: :octocat:
Topological Sort
Kruskals Algorithms :octocat: :octocat:
Prim's Algorithms :octocat:
Belmon Ford Algorithms :octocat:
Floyd-Warshall Algorithm :octocat:
Dijkstra's Algorithm :octocat:
Dynamic Programming C CPP Java Python
Edit distance :octocat:
Fractional Knapsack :octocat:
Longest Increasing Sequence
Kadane's Algorithms

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: