# Radib Kar

## Technical Content Writer @ IncludeHelp

Name | Radib Kar |

Course | Bachelor of Engineering (B.E), Computer Science & Eng. |

College | Jadavpur University |

Technical skills | C, C++, Java, JavaScript, MATLAB, HTML, CSS |

### His submissions

**Data Structure**

- Implementation of Queue using two Stacks
- Implementation of Stack using two Queues
- Level Order Traversal on a Binary Tree | Data Structure
- Find the number of leaf nodes in a Binary Tree | Data Structure
- Find whether two trees are structurally identical or not | Data Structure
- Introduction to Linked List
- Single Linked list and its basic operations with traversing implementation
- Single linked list insertion
- Single linked list deletion
- Deleting a node from a linked list without head pointer
- Boundary Traversal of a binary Tree

**C, C++**

- Queue in C++ Standard Template Library (STL)
- C++ program Input list of candidates and find winner of the Election based on received votes
- C++ program of Airline Seat Reservation Problem
- C++ STL sort function to sort an array or vector
- <bits/stdc++.h> as header file in C++
- C program to find second largest elements in a one dimensional array
- C program to find two largest elements in a one dimensional array
- C program to find second smallest element in a one dimensional array
- C program to find two smallest elements in a one dimensional array
- C Program to Cyclically Permute the Elements of an Array
- C program to accept Sorted Array and do Search using Binary Search
- C Program to find the Biggest Number in an Array of Numbers using Recursion
- C++ program to Sort Names in an Alphabetical Order
- C++ program to print all the Repeated Numbers with Frequency in an Array
- C++ program to print all the Non-repeated Numbers in an Array
- Bitwise Operators and their working with Examples in C
- C program to find the Highest Bit Set for any given Integer
- C program to check if all the bits of a given integer is one (1)
- C program to count number of bits set to 1 in an Integer
- C program to display a Linked List in Reverse
- C program to check whether a given number is palindrome or not using Bitwise Operator
- C program to Reverse only First N Elements of a Linked List
- C program to find odd or even number using bitmasking
- C program to replace bit in an integer at a specified position from another integer
- C program to swap two Integers using Bitwise Operators
- C program to Check if nth Bit in a 32-bit Integer is set or not
- Merge sort for single linked lists
- C++ program to find Union of two single Linked Lists
- Find intersection of two linked lists using C++ program
- C program to convert a Binary Tree into a Singly Linked List by Traversing Level by Level
- Stack in C++ STL (Standard Template Library)
- stack::push() function in C++ STL
- stack::pop() function in C++ STL
- stack::top() function in C++ STL
- stack::size() function in C++ STL
- stack::empty() function in C++ STL
- set::size() function in C++ STL
- set::erase() function in C++ STL
- set::insert() function in C++ STL
- set::empty() function in C++ STL
- set::emplace() function in C++ STL
- set::clear() function in C++ STL
- set::lower_bound() function in C++ STL
- set::upper_bound() function in C++ STL
- set::find() function in C++ STL
- Set in C++ STL (Standard Template Library)
- How to convert an integer to string in C++ STL?
- String::length() Function with Example in C++ STL
- How to convert a character to string in C++ STL?
- Accessing character elements from a string in C++ STL
- Comparing two string using comparison operators in C++ STL
- Concatenating two string using + (plus) operator in C++ STL
- std::string in C++ STL (Standard Template Library)
- Difference between Call by Reference and Call by Value | Use of Pointer
- Multimap insert(), erase() in C++ STL
- Multimap find(), lower_bound(), upper_bound() in C++ STL
- Multimap in C++ STL
- C++ STL | User-defined comparator for priority queue
- C++ STL | Sort a map based on values instead of keys
- sizeof() Operator in C/C++
- Different ways to copy a vector in C++
- Passing vector to a function in C++
- Initialize 2D vector in C++ in different ways
- Sort a 2D vector in C++
- std::pair, std::tuple to return multiple values from a function
- Default argument in C++
- std::nth_element() in C++
- Finding Median of an unsorted array in Linear Time using C++ standard library function
- Shuffling an array using C++ STL function
- std::binary_search() in C++
- std::equal() in C++
- std::for_each() in C++
- std::find() with examples in C++
- std::find_first_of() with examples in C++
- Replace all vowels in a string using C++ STL function
- std::includes() function with example in C++
- Size of struct in C | padding, alignment in struct
- Size of a class in C++ | Padding, alignment in class | Size of derived class
- Comparing two strings in C++
- std::string::compare() function with example in C++
- std::next_permutation() function with example in C++ STL
- std::swap() function with example in C++ STL
- std::lower_bound() function with example in C++ STL
- std::upper_bound() function with example in C++ STL
- std::swap_ranges() function with example in C++
- How to access a global variable if there is a local variable with same name in C++?
- Calling Undeclared Function in C and C++
- Multithreading in C/C++
- Sum of an array using Multithreading in C/C++

**Algorithms**

- Given an array of n numbers, Check whether there is any duplicate or not
- Finding the missing number
- Find the number occurring an odd number of times
- Find the pair whose sum is closest to zero in minimum time complexity
- Find three elements in an array such that their sum is equal to given element K
- Bitonic Search Algorithm
- Check whether a number is Fibonacci or not
- Segregate even and odd numbers in minimum time complexity
- Find trailing zeros in factorial of a number
- Find Nearest Greatest Neighbours of each element in an array
- Interpolation search algorithm
- Analysis of LRU page replacement algorithm and Belady's anomaly
- Meta Binary Search | One-sided Binary Search
- Binary Search in C, C++
- Randomized Binary Search
- Difference between Linear Search and Binary Search
- Binary Search in String
- Variants of Binary Search
- Floor and ceil of an element in an array using C++
- Two Elements whose sum is closest to zero
- Find a pair with a given difference
- Count number of occurrences (or frequency) in a sorted array
- Find a Fixed Point (Value equal to index) in a given array
- Find the maximum element in an array which is first increasing and then decreasing

**Interview coding problems/challenges **

- Run-length encoding (find/print frequency of letters in a string)
- Sort an array of 0's, 1's and 2's in linear time complexity
- Checking Anagrams (check whether two string is anagrams or not)
- Relative sorting algorithm
- Finding subarray with given sum
- Find the level in a binary tree with given sum K
- Check whether a Binary Tree is BST (Binary Search Tree) or not
- 1[0]1 Pattern Count
- Capitalize first and last letter of each word in a line
- Print vertical sum of a binary tree
- Print Boundary Sum of a Binary Tree
- Reverse a single linked list
- Greedy Strategy to solve major algorithm problems
- Job sequencing problem
- Root to leaf Path Sum
- Exit Point in a Matrix
- Find length of loop in a linked list
- Toppers of Class
- Print All Nodes that don't have Sibling
- Transform to Sum Tree
- Shortest Source to Destination Path
- Check for Valid Sudoku
- Count and Say sequence
- Longest Common Prefix
- Palindrome Linked List
- Symmetric Tree
- Convert Sorted Array to Binary Search Tree
- Finding First Bad Version
- House Robber
- Odd even level difference in a binary tree
- Maximum value in a bitonic array
- Palindromic Array
- Check if Tree is Isomorphic
- Count Substrings
- Expression Tree
- K distance from root
- Right View of Binary Tree
- Number following the pattern
- Diameter of Binary Tree
- Intersection Point in Y-Shaped Linked List
- Delete nodes greater than or equal to k in a BST
- Next Permutation
- Reverse Level Order Traversal
- Diagonal Traversal of Binary Tree
- Leftmost and Rightmost Nodes of Binary Tree
- Lowest Common Ancestor in a BST
- Generate Gray Code Sequences
- Convert Ternary Expression to Binary Tree
- Count of strings that can be formed using a, b and c under given constraints
- Bottom View of Binary Tree
- Minimum Number of Flips
- Picking Numbers
- Count Occurrences of Anagrams
- Sieve of Eratosthenes
- Largest Fibonacci Subsequence
- Rearrange a string
- Coin Change
- Ancestors in Binary Tree
- All Root to Leaf Paths
- Pairs of songs with total durations divisible by 60
- Sum of all numbers formed by root to leaf path
- Game of XOR
- Print bracket number
- Longest Palindromic Subsequence
- Prisoners and the poison
- K-th smallest element in a Binary Search Tree
- Find nth Magic number
- Level order traversal in spiral form
- Absolute sorting on a single linked list
- All subarray Sum of an array
- Total number of non-decreasing numbers with n digits
- Friends pairing problem
- Maximum Profit in Stock Buy and sell with at most K Transaction
- Floyd Warshall Algorithm
- Optimal Strategy for a Game
- Highway billboard
- Gold Mine Problem
- Longest Increasing Subsequence
- Minimum Number of coins to make the change
- Get Minimum Squares
- Count Numbers with unique digits
- String Matrix
- Maximum Sum Problem
- Find number of times a string occurs as a subsequence
- Number of Unique Paths
- Minimum number of jumps
- Rod Cutting
- Dice throw
- Longest Common Subsequence
- Longest Repeating Subsequence
- Subset Sum
- Equal Sum partition
- Maximize the cut segments
- Pizza Mania Problem
- Letter/Blog Writer Coding Problem (using Dynamic Programming)
- Largest zigzag sequence
- Number of ways to construct the grid
- Minimum number of deletions to make a string palindrome
- Minimum Cost to Make Two Strings Identical
- Maximum difference of zeros and ones in binary string
- Minimum number of deletions to make a sorted sequence
- Jumbled Strings
- Count of divisible array
- Maximum Calorie
- Special Keyboard
- Minimal moves to form a string
- Total number of non-decreasing numbers with n digits using dynamic programming
- Minimum Time to Display N Character
- Sum of all substrings of a number
- Count of Subarrays
- Knapsack with Duplicate Items
- Longest Common Subsequence of three strings
- Minimum steps to minimize n as per given condition
- Minimum Add to Make Parentheses Valid
- Count total number of Palindromic Subsequences
- Minimum cost to fill given weight in a bag
- Adjacent are not allowed
- Count number of binary strings without consecutive 1's
- Longest Palindromic Substring
- Count total number of Palindromic Substrings
- Search for a Range
- Nesting Depth - Google CodeJam 2020 qualification round problem solution
- Top 25 Dynamic programming problems for interviews
- Suggesting movie randomly from a list C++ program
- Count Number of Nodes in a Complete Binary Tree (Leetcode Problem Solution)
- Bus Routes Google Code Jam Round B Problem No. 2 Solution
- Bike Tour Google Kick Start Round B Problem 1 Solution
- Parenting Partnering Returns - Google CodeJam 2020 Qualification Round Problem Solution

**Computer Networks**

- Multiple Access Protocol | Computer Networks
- Random Access methods | Multiple Access protocols | Computer Networks
- Aloha: A random access method of multiple access | Computer Networks
- Carrier Sense Multiple Access (CSMA) | Computer Networks
- FDMA and TDMA: Channelization Processes | Computer Networks
- Code-Division Multiple Access (CDMA) | Computer Networks
- Logical addressing: IPV4 addressing | Computer Networks
- Classful and Classless Addressing: IPV4 addressing | Computer Networks
- Subnetting and Supernetting | Computer Networks
- Network Address Translation | Computer Networks

**Data Structure**

- Hashing Data Structure
- Hash functions and its characteristics
- Collisions in Hashing and Collision Resolution Techniques
- Hashing | Separate chaining for collision resolution
- Hashing | Open addressing for collision handling
- Minimum deletions to make all elements same using hash table
- Maximum distance between two occurrences of same element in array
- Check if two arrays are similar or not using hashing
- Minimum number of operations to make all elements same using hashing
- First element occurring K times in the array using hashing
- Count maximum points on same line
- Sort elements by frequency
- Shuffle a given array in O(n) time using Fisher-Yates shuffle algorithm
- Check if one array is subarray of the other or not in C++
- Given an array A[] and number X, check for pair in A[] with sum X | using hashing O(n) time complexity | Set 1
- Minimum Number of Steps to Make Two Strings Anagram
- Tree Data Structure
- Inorder Traversal in Binary Tree (with recursion) in C, C++
- Preorder Traversal in Binary Tree (with recursion) in C, C++
- Postorder Traversal in Binary Tree (using recursion) in C, C++
- Reverse Inorder Traversal in Binary Tree (with recursion) in C, C++
- Reverse Preorder Traversal in Binary Tree (with recursion) in C, C++
- Reverse Postorder Traversal in Binary Tree (using recursion) in C, C++
- Inorder Traversal in Binary Tree Iteratively (without recursion)
- Preorder Traversal in Binary Tree Iteratively (without recursion)
- Find height of a binary tree using recursive approach | Set 1
- Find Height of a Binary Tree using level order tree traversal | set 2
- Generic Tree (N-array Tree)
- Find the height of an N-array tree
- Find All Root to Leaf Paths in an N-array Tree
- Full Binary Tree
- Complete Binary Tree
- Perfect Binary Tree
- Given which two traversals you can determine the tree uniquely?
- Morris Traversal (Inorder) | Inorder traversal of binary Tree without recursion and without using Stack
- Constructing a Binary Tree from Its Preorder & Inorder Traversal
- Construct a Binary Tree from Postorder and Inorder Traversal
- Check If a Given Tree is Sum Tree or Not
- Check if two nodes are cousins in a binary tree
- Check if a given tree has all leaves at same level or not
- Checking if all three traversals inorder, preorder & postorder are of same binary tree or not
- Check if two trees are identical or not
- Check if two trees are structurally similar or not
- Check if a tree is full binary tree or not
- Check if the given tree is perfect binary tree or not
- Lowest Common Ancestor in a Binary Tree | Set 1
- Check If a Given Tree is Height-balanced or Not
- Check if a binary tree is a subtree of another binary tree
- Check if the tree has duplicate value or not
- Check if there is a root to leaf path with the given sequence
- Print the path from Root to the given node
- Print all cousins of a node in the given tree
- Sum of all nodes in a Binary Tree
- Sum of all parents having child value X in the given tree
- Sum of all right leaf nodes in a given tree
- Sum of all left leaf nodes in a given tree
- Sum of nodes on the longest path from the root to the leaf node
- Max Level Sum in Binary Tree
- Difference between Sum of Odd and Even Levels in a Given Binary Tree
- Root to Leaf Path having sum X in the given Tree
- Merge two Trees using Node Sum | Recursive solution (Set 1)
- Sum of heights of all the nodes
- Disjoint Set ADT
- Find disjoint sets in a graph using disjoint set ADT operations FIND, UNION
- Finding a cycle in an undirected graph using Disjoint Sets
- Check if the graph is tree or not
- Find largest subtree sum in a tree
- Find duplicate subtrees in a given Binary Tree
- Rearrange a string so that no two adjacent characters have the same letter
- Introduction to Heap Data Structure
- Check if a subtree exists with the given sum
- Binary Search Tree (BST)
- Insertion in a Binary Search Tree | Set 2
- Deletion in Binary Search Tree (BST) | Set 2
- Comparison between Hash Table and Binary Search Tree
- Construct BST from Given Preorder Traversal
- Construct a binary search tree from a sorted linked list
- Construct a binary search tree from a sorted 1-D array
- Convert given Binary Search Tree to a Greater Sum Tree
- Construct all possible BSTs with keys 1 to N
- Convert given Binary Search Tree to a Smaller Sum Tree
- Convert a Binary Search Tree into a min-heap
- Construct BST from level order traversal
- Convert an unbalanced BST to a balanced BST
- Find the Minimum and Maximum node in a Binary Search Tree
- Check if the given array can represent Preorder Traversal of a Binary Search Tree
- Kth Maximum in a Binary Search Tree
- Kth Minimum in a Binary Search Tree
- Check if given sorted subsequence exits in the Binary Search Tree or Not
- Check if the Binary Search Tree contains a dead end
- Check if the given array can represent inorder traversal of a BST
- Check if two BSTs have same set of elements or not
- Largest Element in the BST less than or Equal to N
- Distance between two nodes in a BST
- Count Number of pairs from two different BSTs whose sum is equal to X
- Merge Two Binary Search Trees Set 1
- Merge two Binary Search Trees set 2 (limited space)

**AdonisJs**

- How to install AdonisJs in Ubuntu?
- How to create the boilerplate for AdonisJs & details on the created directory structure?
- Database Migrations in AdonisJs
- Understanding Migration Scripts in AdonisJs
- Creating Migration Scripts in AdonisJs
- Introduction to Lucid Models in AdonisJs
- Creating a lucid model in AdonisJs
- Introduction to Controllers in AdonisJs
- Request and response in AdonisJs
- Creating Endpoints in Postman
- Creating a controller to handle CRUD endpoints in AdonisJs
- Middlewares and Auth Middleware in AdonisJs
- Handling User registration & Login in AdonisJs
- Auth methods, jwt tokens & password hashing in AdonisJs
- How passwords are stored in the database in AdonisJs?
- Handling PUT Request in AdonisJs | Part 1
- AdonisJs | Lucid Query Builders | Part 1
- AdonisJs | Lucid Query Builders | Part 2
- Authenticate incoming requests in AdonisJs
- Create new instances in the database from POST requests in AdonisJs

**Articles**

Comments and Discussions!