Machine Learning (ML) Concrete Problems in AI Safety In this article we shall explore a research paper titled “Concrete Problems in AI Safety” by Dario Amodei and others. This has been a very influential paper.
Software Engineering Strings in Python [Complete Guide] In this article, we will learn how to implement strings in Python and explore the various string operations that we can use.
Algorithms Word Break Problem In this article we are going to talk about a very interesting problem: Word Break Problem. This can be solved using Dynamic Programming [O(N^2) time, O(N^2) space].
Algorithms Check whether a Singly Linked List is Palindrome or not Linked List can be palindrome if they have the same order when it traverse from forward as well as backward. This is solved using three methods: using stack, string and by reversing the list.
Algorithms Cycle in a graph using degree of nodes of the graph There are different ways of detecting cycle in a graph. Let us understand how to detect cycles in an undirected graph using the degree of each vertex.
Algorithms Transpose Graph In this article, we will explore the idea of Transpose Graph along with the basics of Graph Data Structures. We have presented an algorithm to get the transpose of a graph as well.
Machine Learning (ML) Zipf's Law in NLP According to Zipf's law, the frequency of a given word is dependent on the inverse of it's rank . Zipf's law is one of the many important laws that plays a significant part in natural language processing.
Software Engineering Choose the right type of NoSQL Database In this article, we will gather knowledge about different NoSQL databases and choosing the correct database for a given problem or use case.
Software Engineering List of Top Users in CodeForces In this article, we will make a list of all the users of Codeforces and store their information in a JSON file. We will use the json and urlib.request library of python for the purpose.
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.
