Problems on Binary Tree Find number of Universal Value subtrees in a Binary Tree In this article, we will be working on finding number of subtrees whose nodes have same value, called universal value subtree or simply univalue subtree.
Algorithms Minimum number of increment operations to make K elements of an array equal Given an array arr[] of n elements and an integer k, the task is to make any k elements of the array equal by performing only increment operations. This is solved using sliding window technique.
Algorithms Find path with maximum average value in a 2D matrix Given a square matrix of size N * N, where each cell is associated with a specific cost. Find the path with maximum average value in the 2D matrix. The path should start from top left point and end at bottom right point.
Software Engineering Different ways to select random element from list in Python Following are the different ways of selecting a random element from a list: random.randrange(), random.random(), random.choice() and random.randint().
Algorithms Different collision resolution techniques in Hashing In this article, we have explored the idea of collision in hashing and explored different collision resolution techniques such as open hashing, closed hashing, linear probing, quadratic probing and double hashing.
Software Engineering File Hosting Service in Django In this article, we will learn to create a file hosting service webpage in Django wherein one can host their files on the local server and generate a shareable URL link to access the file.
Algorithms Number of ways to reach number using increments of 1 and 2 (consecutive 1s are not allowed) In this problem, we are given a number, we need to find the number of ways to reach it using increments of 1 and 2, given consecutive 1s not allowed.
Algorithms Multi Dimensional Divide and Conquer In this article we will be discussing a research paper published in 1980 by Jon Louis Bentley. Generally we see algorithms that solve a single specific purpose, but in this paper we discuss multidimensional divide-and-conquer.
Algorithms Algorithms & Data Structures for Range Searching (Advanced) Range Searching is one of the most important fields in computational geometry and the areas of database searching and mostly in geographical data bases.
Software Engineering An Introduction to Ciphers This article is based on exactly on the understanding of what are ciphers. Before we go into kinds of cipher ,their uses and working ; we need to exactly does a cipher mean , what is cryptography, cryptanalysis and how is the notion of hiding or securing data using algorithms and texts was born.
Algorithms Stable Roommates Problem (Irving's Algorithm) In Stable Roommates Problem, we are given an even-sized set in which each member has a preference list which consists of all other members of the set. We need to match the members of the set such that every member has most preferred choice as their roommate. This is solved using Irving's Algorithm.
Problems on Binary Tree Converting a Sorted Array to Binary Tree Sorted array is converted to Binary Search Tree for faster search operations and querying. In this article we'll learn to convert any sorted array to binary search tree.
Software Engineering <body> Learn about Body Tag </body> body tag defines the body of the webpage. All the basic content of a webpage including heading, paragraph are defined inside the body tag.
Software Engineering priority_queue::push() in C++ Push function in priority queue is used to to insert a element in the queue, the element is inserted in the priority queue based on it's value which defines it's priority in the queue.
Software Engineering Different Ways to Initialize Priority queue in C++ We have demonstrated different Ways to Initialize Priority queue in C++ such as using Max Heap, Min Heap and with vector and array.
Software Engineering Reverse a String (word by word) in C In this problem, we have reversed a string or text word by word in C. The strategy to do this is important and tests C implementation skill.
Software Engineering Basic Bits hacks in Python We have covered several basic bit hacks in Python which everyone should know to write optimized code. Tricks include find sign of an integer, negate an integer and more.
Software Engineering Typecasting in C We have explored Typecasting in the C language. The definition, categories of Typecasting, Why it is used and How, along with many examples so that it will be easy to understand.
Software Engineering Cache in Python We have explored caching by demonstrating it with a Python code example where intermediate results are cached and improved the overall performance. This is done through functools.lru_cache in Python.
Software Engineering Arrays vs Vectors in C++ We have explored the differences between array and vectors in C++ in depth along with C++ code examples. Some differences include size of array is fixed while vector is dynamic.
Data Structures Implementing a Stack using an Array and Linked list Stack is a linear data structure following LIFO (Last in First out) order and can be implemented using Array or Linked List as an internal data structure.
Machine Learning (ML) Alternatives to CNN (Convolutional Neural Network) We have explored Alternatives to CNN (Convolutional Neural Network) which includes Graph Neural Network and Capsule Neural Network.
Algorithms Approximation Algorithms (Introduction) In this article we will be exploring an interesting as well as deep overview of Approximation Algorithms with examples like vertex cover problem, travelling salesman problem and more.
Software Engineering Pass Variable By Reference in Python In this article, we have explored how to pass a variable by reference to a function in Python. We have demonstrated the ideas by Python code snippets.
Data Structures LogLog (Probabilistic Data Structure for Cardinality) LogLog is a Probabilistic Data Structure that uses the idea of hashing to compute Cardinality of a given set.
