- Longest Increasing Subsequence, Leetcode, Dynamic programming
- LeetCode – 224. Basic Calculator , Interview question
- Custom getElementByAttribute function – JavaScript/FrontEnd interview question
- JavaScript interview questions – Flatten an array in JavaScript
- Debounce function – JavaScript/FrontEnd interview questions
- Find a rectangle of 0s in matrix of 1s and 0s
- Print all combinations of points from given set of input that can compose a given number. (Recursive & Dynamic approach)
- Find child having n parent ( Graph Problem )
- Depth Sum or Nested List Weight Sum ( Linked In Interview question)
- Find Minimum Insertions to form a palindrome string ( Hacker rank interview question)
- Water Container Problem (Java)
- Leet Code – 49. Group Anagrams
- Stack implementation using Array
- Insertion Sort implementation in Java
- String Operations
- How to Add new row to DataFrame in R
- Binary Tree Insertion, Deletion, Search, Traversal in Java
- QuickSort implementation example using ArrayList in Java
- Selection Sort using ArrayList (Inplace) in Java
- Merge sort using ArrayList in Java with example
- Web Security – Importance of browser security headers
- Neo4j Samples (Simple and Complex Queries)
- Introduction to R and MongoDB
- Parentheses / Brackets Check (Hacker Rank Interview Questions)
- The caterpillar problem (Hacker Rank Interview Questions)
- Total Number of Perfect Squares (Hacker Rank Interview Question)
- Find unique pairs with k difference (KDiff) (Hacker Rank Interview Question)
- Count Duplicate Pairs of Integer in a given array (Hacker Rank Interview Questions)
- Print all the possible permutations by adding X and Y (Hacker Rank Interview Question)
- Slice Down problem in Java (Hacker Rank Interview Questions)
- Gradle with Jmeter Integeration
- Calculate Fibonacci number in java using Recursion and Multi Threading
- Verify preorder sequence of Binary Search Tree (BST) Interview Question – Hacker Rank
- WEB Accessibility – tips and tricks
- Tries, Contacts Hackerrank question
- When Binary Search Tree can perform worst?
- ES6 features that every developer should know