JAVA Program Count 1’s in a sorted binary array
JAVA Program Count 1’s in a sorted binary array - Searching and Sorting - A simple solution is to linearly traverse the...
Author
Venkatesan Prabu
Wikitechy Founder, Author, International Speaker, and Job Consultant. My role as the CEO of Wikitechy, I help businesses build their next generation digital platforms and help with their product innovation and growth strategy. I'm a frequent speaker at tech conferences and events.
2835 Articles
C Programming-Searching for Patterns Set 1 Naive Pattern Searching
C Programming-Searching for Patterns Set 1 Naive Pattern Searching - Searching and Sorting - Given a text txt[0..n-1] and a...
Digital Signatures and Certificates
Digital Signatures and Certificates - Digital Electronics - Process of converting electronic data into another form, called...
PYHTON Programming-Searching for Patterns Set 1 Naive Pattern Searching
PYHTON Programming-Searching for Patterns Set 1 Naive Pattern Searching - Searching and Sorting - Given a text txt[0..n-1]...
python programming Tarjan’s Algorithm to find Strongly Connected Components
python programming Tarjan’s Algorithm to find Strongly Connected Components - Graph - A directed graph is strongly...
Python Program Count 1’s in a sorted binary array
PYTHON Program Count 1’s in a sorted binary array - Searching and Sorting - A simple solution is to linearly traverse the...
C++ Program Count 1’s in a sorted binary array
C++ Program Count 1’s in a sorted binary array - Searching and Sorting - A simple solution is to linearly traverse the...
Python Programming – Longest Common Subsequence
Python Programming - Longest Common Subsequence - Dynamic Programming - LCS problem has optimal substructure property as...
Sliding Window Protocol | Set 2 (Receiver Side)
Sliding Window Protocol | Set 2 (Receiver Side) - Computer Network - Sliding Window Protocol is actually a theoretical...
JAVA programming – Given a sorted array and a number x, find the pair in array whose sum is closest to x
JAVA programming - Given a sorted array and a number x, find the pair in array whose sum is closest to x - Searching and...
