python programming Tarjan’s Algorithm to find Strongly Connected Components – Graph – A directed graph is strongly connected
PYTHON Program Count 1’s in a sorted binary array – Searching and Sorting – A simple solution is to linearly traverse the array. The time complexity of the simple solution is O(n). We can use Binary Search to find count in O(Logn) time.
C++ Program Count 1’s in a sorted binary array – Searching and Sorting – A simple solution is to linearly traverse the array. The time complexity of the simple solution is O(n). We can use Binary Search to find count in O(Logn) time.
If you are a sysadmin, managing your Linux server’s hard disk partition is a critical task. In this tutorial, we’ll focus on how to use sfdisk command-line utility to manage…
Restorecon stands for “Restore SELinux Context” – LINUX – restorecon command will reset the SELinux security context for files and directories.
Python Programming – Longest Common Subsequence – Dynamic Programming – LCS problem has optimal substructure property as main problem can be solved.
Sliding Window Protocol | Set 2 (Receiver Side) – Computer Network – Sliding Window Protocol is actually a theoretical concept in which we have only talked.
JAVA programming – Given a sorted array and a number x, find the pair in array whose sum is closest to x – Searching and sorting – Given a sorted array and a number x, find a pair in array whose sum is closest to x.
C++ programming – Given a sorted array and a number x, find the pair in array whose sum is closest to x – Searching and sorting – Given a sorted array and a number x, find a pair in array whose sum is closest to x.