- Doolittle Algorithm : LU Decomposition
- Online Algorithm
- Stable Selection Sort
- std::slice (Valarray slice selector)
- Python program to split and join a string
- Check if a number is power of k using base changing method
- Least Common Denominator (LCD)
- Number of Binary Trees for given Preorder Sequence length
- Cycles of length n in an undirected and connected graph
- Count of strings where adjacent characters are of difference one
- Newton Forward And Backward Interpolation
- Cholesky Decomposition : Matrix Decomposition
- Common characters in n strings
- Secretary Problem (A Optimal Stopping Problem)
- Lucas Primality Test
- Direction of a Point from a Line Segment
- partition_point in C++
- Bessel's Interpolation
- std::setbase, std::setw , std::setfill in C++
- std::gslice | Valarray generalized slice selector
- Double Base Palindrome
- Count all possible paths between two vertices
- Minimum cost to construct a string
- Minimum height of a triangle with given base and area
- Add 1 to number represented as array | Recursive Approach
- SQL general functions | NVL, NVL2, DECODE, COALESCE, NULLIF, LNNVL and NANVL
- Multiplication of Matrix using pthreads
- Binary Search using pthread
- Merge Sort using Multi-threading
- Self Organizing List : Move to Front Method
- Growable array based stack
- Self Organizing List : Count Method
- Implement Stack and Queue using Deque
- Banker's Algorithm in Operating System
- Sum of an array using pthreads
- <climits> (limits.h) in C/C++
- Self Organizing List : Transpose Method
- Level of Each node in a Tree from source node (using BFS)
- IPC using Message Queues
- fork() to execute processes from bottom to up using wait()
- IPC through shared memory
- Program to build DFA that starts and end with 'a' from input (a, b)
- isblank() in C/C++
- Consecutive sequenced numbers in a string
- Average of given numbers in Bash
- Check if binary string multiple of 3 using DFA
- Check if a number is sandwiched between primes
- Postfix to Prefix Conversion
- Sum of products of all combination taken (1 to n) at a time
- C++ program for hashing with chaining
- Prefix to Postfix Conversion
- Prefix to Infix Conversion
- Rotate the matrix right by K times
- Smallest expression to represent a number using single digit
- Double Hashing
- Minimum removal to make palindrome permutation
- Polybius Square Cipher
- Morse Code Implementation
- Time taken by Loop unrolling vs Normal loop
- Prime numbers after prime P with sum S
- Timer in C++ using system calls

shubham_rana_77 hasn't improved any 'Articles' yet!