|
7 | 7 |
|
8 | 8 | Collection of interview questions with Unit Tests. Problems includes Data Structures, Logical and few Classical problems.
|
9 | 9 |
|
10 |
| - |
11 |
| - |
12 | 10 | ## Table of Contents
|
13 | 11 |
|
14 |
| -### Data Structures |
15 |
| - |
16 |
| -- [Singly Linked List](src/_DataStructures_/LinkedList) |
17 |
| - |
18 |
| - - [N Element From Last](src/_DataStructures_/LinkedList/element-from-last) |
19 |
| - - [Middle Node](src/_DataStructures_/LinkedList/middle-node) |
20 |
| - - [Detect Loop](src/_DataStructures_/LinkedList/loop-in-list) |
21 |
| - - [Reverse Linked List](src/_DataStructures_/LinkedList/reverse-linked-list) |
22 |
| - |
23 |
| -- [Stack](src/_DataStructures_/Stack) |
24 |
| - |
25 |
| - - [Implement Queue Using Stack](src/_DataStructures_/Stack/immitate-queue-using-stack) |
26 |
| - - [Baseball Game](src/_DataStructures_/Stack/baseball-game) |
27 |
| - - [Find minimum in the Stack](src/_DataStructures_/Stack/min-stack) |
28 |
| - - [Balanced Parenthesis](src/_DataStructures_/Stack/balanced-parenthesis) |
29 |
| - - [Postfix Expression Evaluation](src/_DataStructures_/Stack/postfix-expression-evaluation) |
30 |
| - - [Remove Consecutive Repeated Digits](src/_DataStructures_/Stack/remove-consecutive-repeated-digits) |
31 |
| - - [Implement 2 Stacks using Single Array](src/_DataStructures_/Stack/2-stacks-using1-array) |
32 |
| - - [Sort a Stack](src/_DataStructures_/Stack/sort-a-stack) |
33 |
| - |
34 |
| -- [Queue](src/_DataStructures_/Queue) |
35 |
| - |
36 |
| - - [Weave](src/_DataStructures_/Queue/weave) |
37 |
| - - [Reverse First K Elements of a Queue](src/_DataStructures_/Queue/reverse-first-k) |
38 |
| - - [Generate all Binary Numbers from 1 to N](src/_DataStructures_/Queue/generate-binary-number) |
39 |
| - - [Queue using Stack](src/_DataStructures_/Queue/queue-using-stack) |
40 |
| - |
41 |
| -- [Doubly Linked List](src/_DataStructures_/DoublyLinkedList) |
42 |
| - |
43 |
| -- [Trees](src/_DataStructures_/Trees) |
44 |
| - - [Binary Tree (creation using level order)](src/_DataStructures_/Trees/BinaryTree) |
45 |
| - - [Binary Search Tree](src/_DataStructures_/Trees/BinarySearchTree) |
46 |
| - - [Find k<sup>th</sup> maximum in a BinarySearchTree](src/_DataStructures_/Trees/BinarySearchTree/find-kth-max) |
47 |
| - - [Find k<sup>th</sup> minimum in a BinarySearchTree](src/_DataStructures_/Trees/BinarySearchTree/find-kth-min) |
48 |
| - - [Find Ancestors of a Node](src/_DataStructures_/Trees/BinarySearchTree/find-ancestors) |
49 |
| - - [Find Height of BST](src/_DataStructures_/Trees/BinarySearchTree/height-of-bst) |
50 |
| - - [Find k Nodes from Root of BST](src/_DataStructures_/Trees/BinarySearchTree/find-k-nodes-from-root) |
51 |
| - - [Suffix Tree](src/_DataStructures_/SuffixTree) |
52 |
| - - [Trie](src/_DataStructures_/Trees/Trie) |
53 |
| - - [Total words count count in a Trie](src/_DataStructures_/Trees/Trie/total-words-in-trie) |
54 |
| - - [Unique words count in a Trie](src/_DataStructures_/Trees/Trie/unique-word-count) |
55 |
| - - [All the words from a Trie](src/_DataStructures_/Trees/Trie/all-words-in-trie) |
56 |
| - - [Unique words in a Trie](src/_DataStructures_/Trees/Trie/get-unique-words) |
57 |
| - |
58 |
| -### Logical Problems |
59 |
| - |
60 |
| -- [Anagrams](src/_Problems_/anagrams) |
61 |
| -- [Array Chunk](src/_Problems_/array-chunk) |
62 |
| -- [Count Vowels](src/_Problems_/count-vowels) |
63 |
| -- [Find 2 numbers that add upto N](src/_Problems_/find-2-nums-adding-to-n) |
64 |
| -- [Find 2nd Maxinum from an Array](src/_Problems_/find-2nd-max) |
65 |
| -- [FizzBuzz](src/_Problems_/fizzbuzz) |
66 |
| -- [String Permutaions](src/_Problems_/get-string-permutations) |
67 |
| -- [Get Subsequence](src/_Problems_/get_subsequence) |
68 |
| -- [Get Maze Path](src/_Problems_/get-mazePath) |
69 |
| -- [Get longest consecutive 1s](src/_Problems_/max-consecutive-1s) |
70 |
| -- [Get Max Char](src/_Problems_/maxchar) |
71 |
| -- [Get Smallest Common Number](src/_Problems_/get-smallest-common-number) |
72 |
| -- [Merge 2 Sorted Arrays](src/_Problems_/merge-two-sorted-arrays) |
73 |
| -- [Palindrome](src/_Problems_/palindrome) |
74 |
| -- [Product of Elements](src/_Problems_/product-of-elements) |
75 |
| -- [Remove Duplicates](src/_Problems_/remove-duplicates) |
76 |
| -- [Reverse String](src/_Problems_/reverse_string) |
77 |
| -- [Maximum Product of Three Numbers](src/_Problems_/max-product-of-3-numbers) |
78 |
| -- [Next Greater for Every Element in an Array](src/_Problems_/next-greater-element) |
79 |
| - |
80 |
| -### Searching |
81 |
| - |
82 |
| -- [Binary Search](src/_Searching_/BinarySearch) |
83 |
| - |
84 |
| -### Algorithms |
85 |
| - |
86 |
| -- [LRU Cache](src/_Algorithms_/lru-cache) |
87 |
| -- Path Finders |
88 |
| - - [A*](src/_Algorithms_/path-finder/a-star) |
89 |
| - |
90 |
| - |
91 |
| -### Classics |
| 12 | +This repo contains the following in **JavaScript** |
| 13 | +- Data Structures |
| 14 | +- Algorithms |
| 15 | +- Logical Problems |
| 16 | +- Classics (Few of the classical questions) |
92 | 17 |
|
93 |
| -- [Caeser Cipher](src/_Classics_/caeser_cipher) |
94 |
| -- [Fibonacci](src/_Classics_/fibonacci) |
| 18 | +Find the detailed Table of Contents here: [Detailed TOC](TOC.MD) |
95 | 19 |
|
96 | 20 | ## CONTRIBUTION Guide
|
97 | 21 |
|
|
0 commit comments