# Saurabh Gupta

## Technical Content Writer @ IncludeHelp

My name is Saurabh Gupta and I am currently pursuing B. Tech in Computer Science and Engineering from Lovely Professional University, Punjab.

I'm an ambitious person filled with a lot of enthusiasm, I remain passionate about learning new skills and growing up. I'm diligent at the same time adaptable towards my work. I love to explore new things and learn from them.

I am an intermediate level programmer and have good programming skills in Python and C language. I am a Machine Learning and Artificial Intelligence enthusiast and I'm currently acquiring the required skills to excel in this field.

Apart from all these technical stuff, I am Co-Founder of student organization SAPPHIRE in LPU and currently, serve as the Chief Financial Officer for the organization.

### His submissions

**Digital Electronics**

- Number systems and their representation
- Conversion of Decimal Number System into Binary Number System
- Conversion of Decimal Number System into Octal Number System
- Conversion of Decimal Number System into Hexadecimal Number System
- Conversion of Binary Number System to Decimal Number System
- Conversion of Binary Number System into Octal Number System
- Conversion of Binary Number System into Hexadecimal Number System
- Conversion of Octal Number System to Binary, Decimal and Hexadecimal Number Systems
- Conversion of Hexadecimal Number System to Binary, Octal and Decimal Number Systems
- Binary Addition and Subtraction
- Binary Multiplication and Division
- Signed Representation of Binary Numbers
- Floating Point Representation of Binary Numbers
- r's and (r-1)'s Complement of Numbers
- Binary Coded Decimal (BCD Code) and its addition
- Error Detecting Codes
- Excess-3 (XS-3) Code and Gray Code
- Logic Gates
- Universal Logic Gates (NAND, NOR)
- Duality Principle and Rules for Reduction of Boolean Expressions
- Axioms and Laws of Boolean Algebra
- Realization of Boolean expressions using Basic Logic Gates
- Solved Examples on Reduction of Boolean Expression
- Realization of Boolean Expressions using only Universal Gates
- Karnaugh Maps (K-Maps)
- POS and SOP form representation of a Boolean Function
- Min and Max Terms Notation in Boolean Algebra
- Mapping of expressions on K-Map and Encircling of groups
- Karnaugh Maps with Don't Care Conditions
- Combinational Circuit | Digital Electronics
- Designing of Half-Adder, Full Adder and making Full Adder using Half Adder
- Designing of Half Subtractor and Full Subtractor
- N-bit Parallel Adders (4-bit Binary Adder and Subtractor)
- Construction of Code Converters
- SR Latch in Digital Electronics
- Sequential Circuits in Digital Electronics
- Concept of Read Only Memory (ROM) in Digital Electronics
- Concept of Random Access Memory (RAM) in Digital Electronics
- Conversion of Flip Flops
- Solved Examples on Conversion of Flip-Flops
- Programmable Array Logic (PALs)
- Magnetic Memories
- Introduction to JK Flip Flop
- Race Around Condition in JK Flip Flop and T-Flip Flop
- Master-Slave JK Flip Flop
- Logic Devices and Concept of PROM
- Programmable Logic Array (PLAs)
- Designing of Asynchronous Counters
- Designing of Synchronous Counters
- Examples of Designing of Synchronous Mod-N Counters
- Examples of Designing of Arbitrary Sequence Counters and Bidirectional Counter
- Designing of Comparators

TOP 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

Comments and Discussions