### My interview with GeeksforGeeks: Geek on the top – Aashish Barnwal

### My contribution on GeeksforGeeks over the years:

- How to prepare for top MNCs?
- Implementing Iterator pattern of a single Linked List
- Curiously recurring template pattern (CRTP)
- Opaque pointer
- Factory design pattern
- K Dimensional Tree | Set 1 (Search and Insert)
- Design an efficient data structure for given operations
- Ternary Search Tree
- Print unique rows in a given boolean matrix
- Implement LRU Cache
- Sort numbers stored on different machines
- Find the k most frequent words from a file
- Given a sequence of words, print all anagrams together | Set 1
- Given a sequence of words, print all anagrams together | Set 2
- Generate integer from 1 to 7 with equal probability
- Graph and its representations
- Median of two sorted arrays of different sizes
- Iterative Quick Sort
- Magic Square
- Comparator function of qsort() in C
- Copy elision in C++
- Playing with Destructors in C++
- Casting operators in C++ | Set 1 (const_cast)
- DFA based division
- Counting Sort
- Space and time efficient Binomial Coefficient
- Efficient program to calculate e^x
- Greedy Algorithms | Set 2 (Kruskal’s Minimum Spanning Tree Algorithm)
- Greedy Algorithms | Set 3 (Huffman Coding) – GeeksforGeeks
- Greedy Algorithms | Set 4 (Efficient Huffman Coding for Sorted Input)
- Greedy Algorithms | Set 6 (Prim’s MST for Adjacency List Representation)
- Dynamic Programming | Set 27 (Maximum sum rectangle in a 2D matrix)
- Dynamic Programming | Set 28 (Minimum insertions to form a palindrome)
- Dynamic Programming | Set 30 (Dice Throw)
- Dynamic Programming | Set 31 (Optimal Strategy for a Game)
- Dynamic Programming | Set 34 (Assembly Line Scheduling)
- Find minimum elements after considering all possible transformations – GeeksforGeeks
- Check whether a given graph is Bipartite or not
- Maximum of all subarrays of size k (Added a O(n) method)
- Linked complete binary tree & its creation
- Print all permutations in sorted (lexicographic) order
- Lexicographic rank of a string
- Union-Find Algorithm | Set 1 (Detect Cycle in a an Undirected Graph)
- Measure one litre using two vessels and infinite water supply
- Random number generator in arbitrary probability distribution fashion
- Iterative Postorder Traversal | Set 1 (Using Two Stacks)
- Iterative Postorder Traversal | Set 2 (Using One Stack)
- Boundary Traversal of binary tree
- An in-place algorithm for String Transformation
- Morris traversal for Preorder
- Construct Full Binary Tree from given preorder and postorder traversals
- Two nodes of a BST are swapped, correct the BST
- Check if each internal node of a BST has exactly one child
- Largest subarray with equal number of 0s and 1s
- Check if a number is Palindrome
- Given a number, find the next smallest palindrome
- Construct BST from given preorder traversal | Set 1
- Construct BST from given preorder traversal | Set 2
- Flattening a Linked List
- Find the largest multiple of 3
- Count numbers that don’t contain 3
- Check divisibility by 7
- To find sum of two numbers without using any operator
- Find a pair with the given difference
- Add two numbers represented by linked lists | Set 2
- Longest Palindromic Substring | Set 1
- Longest Palindromic Substring | Set 2
- Count the number of possible triangles
- Find the number of islands
- Pascal’s Triangle
- Stack | Set 1 (Introduction)
- Heap Sort

Copyright © 2017, Aashish Barnwal, All rights reserved.