Algorithms Minimum number of Fibonacci terms with sum equal to a given number N Given a number N, we need to find the minimum number of fibonacci numbers required that sums up to a given number N. Note a fibonacci number can be repeated
Software Engineering Get details of a place and nearby places using Geo API of Twitter In this article, we will use the Geo API of Twitter API and use it to get details of a place and find out nearby places (co-ordinates) to it. This is interesting as one may think that Twitter is all about Tweets but classifying data across Geography is a major feature of Twitter.
Software Engineering HTML <span> tag explained Span tag in HTML is an inline element which can be used to apply special styling (using CSS) or behaviour (using JavaScript) to a specific component in a div, p and other tags.
Software Engineering Basics of Web-VR using A-frame A-frame is an open-source web framework for building Virtual Reality(VR) applications. It is used for a well-known javascript library known as Three.js. It allows developers to create 3D and virtual reality experiences using HTML.
Software Engineering Ternary Operator in C Ternary operator in C is an alternative syntax for if else conditional statement. It is usually used to condense if else statements.
Data Structures Burkhard Keller Tree (BK Tree) Burkhard Keller Tree (BK-Tree) is a Tree Data Structure that is used to find the near-matches to a String Query. It is used in several applications like spell correction and autocompletion.
Software Engineering A Deeper Look at HTTP Requests In this article, we looked in how HTTP requests like GET, PUT and others are formed, how websites interact with them and the response send back.
Algorithms Binary exponentiation (Power in log N) Binary exponentiation is an algorithm to find the power of any number N raise to an number M (N^M) in logarithmic time O(log M). The normal approach takes O(M) time provided multiplication takes constant time.
Algorithms 2 Sum Problem: Number of pairs with a given sum We will find out how we can count the number of pairs in an array whose sum is equal to a certain number. Brute force approaches will take O(N^2) time but we can solve this in O(N) time using a Hash Map.
Algorithms Shortest Path with k edges using Dynamic Programming Given a weighted directed graph, we need to find the shortest path from source u to the destination v having exactly k edges. Brute force approach takes O(V^k) time complexity which we reduce to O(V^3 * k) using dynamic programming
Data Structures Must read research papers on Data Structures We presented research papers on Data Structures that are a must read for everyone. These come from authors like Raimund Seidel, Knuth, Rubinchik and others
Algorithms Number of paths with k edges using Dynamic programming and Divide and Conquer Given a directed graph, we need to find the number of paths with exactly k edges from source u to the destination v. A brute force approach has time complexity which we improve to O(V^3 * k) using dynamic programming which we improved further to O(V^3 * log k) using a divide and conquer technique.
Algorithms Must read research papers on Algorithms We presented some of the must read research papers in the field of Algorithms. The papers come from authors like C. A. R. Hoare, D. E. Knuth, V. Strassen and many others.
Software Engineering XMLHttpRequest to make HTTP requests XMLHttpRequest can be defined as an API in the form of an object which is used to transfer data between the web browser and the web server. It gives us the ability to update parts of a web page without reloading the whole page
Data Structures Autocomplete Feature using Ternary Search Tree Autocomplete Feature can be implemented using Ternary Search Tree as well which is a memory optimized version of trie and performs equally well.
Machine Learning (ML) Linear vs Logistic Regression We have explored the differences between Linear and Logistic regression in depth. We looking into the applications of Linear and Logistic regression along with a basic background.
Machine Learning (ML) Text classification using K Nearest Neighbors (KNN) In this article, we will demonstrate how we can use K-Nearest Neighbors (KNN) algorithm for classifying input text into different categories. We used 20 news groups for a demo.
Machine Learning (ML) PageRank PageRank is an algorithm to assign weights to nodes on a graph based on the graph structure and is largely used in Google Search Engine being developed by Larry Page
Software Engineering Get length of array in C and C++ In C and C++, we find the length of an array we need to use the sizeof operator and get the length as size of entire array divided by size of an element.
Algorithms Bozosort Bozosort is a random sorting algorithms where the key idea is to swap any two elements of the list randomly and check if the list is sorted. The average time complexity of Bozosort is O(N!) and the space complexity is O(1).
Algorithms Number of ways to pair elements In this article, we are going to discuss about element pairing problem where we need to find the number of ways a set of elements can be pair or kept separate. This can be solved using Dynamic Programming in linear time O(N).
Software Engineering Hashing in C++ using std::hash In this article, we will cover how hashing is natively supported in C++ through STL (std:hash) and how we can use it to generate hash of any object in C++.
Algorithms Finding number of pairs with a certain XOR value In this article, we are going to find the number of pairs in an unsorted array, whose XOR values matches with our target value (say K). Using our efficient approach (with Hash map), we can solve this in O(N) time complexity while the brute force approach takes O(N^2) time complexity
Algorithms Check if a number is an Armstrong Number An Armstrong number is an integer such that the sum of the digits raised to the power of the number of digits is equal to the number itself. We verify it in O(logN * loglogN) time.
Algorithms Number of ways to represent a number N as sum of K Fibonacci terms The problem we will solve is that given a number N and K, we need to find the numbers of ways we can represent N as a sum of K fibonacci numbers. We will solve this problem efficiently using a recursive technique in O(N).
