CodeQuotient_Programming-Abstraction

This is the repo for all Code solution for Code Quotient course of Programming Abstraction. Codes are in JAVA & C++ (check the extensions of the file to know the language of codes)

Section 1

1. Reverse a 4 digit number

2. Add one to each digit of a number

3. Fibonacci sequence

4. Leaders in an array

5. Use Minimum Square Tiles

6. Move the elements

Section 2

1. Reverse an array in groups

2. Verify Prime Number

3. Buy maximum toys possible

4. Distribute in Circle

5. Reduce the array to zero

6. Make a group for competition

7. GCD of two numbers

8. Average per city

Section 3

1. Cut the chocolate smartly for maximum pieces

2. Reach a single digit

3. Fill the gaps

4. Multiple sum

5. How many duplicates in array

6. Find the special index of array

7. Count the total reward points

8. Make Array Positive

Section 4

1. Grab the recursive Gifts

2. Count the square numbers

3. Pascal Triangle

4. Find the winner in elections

5. Scoring based on difficulty level

6. Array Sum and Pair Product Puzzle

7. Turning point in stock prices

8. Compare two Array

Section 5

1. Action Game

2. Next Palindrome

3. Same Digit

4. Continous Substraction Game

Section 6

1. Form a new number

2. Fibonacci sequence using recursion

3. Factorial using recursion

4. Largest number possible with digits

5. Make pairs in the party

Section 7

1. Check the numbers for power of 2

2. How much the team knows

[3. Find the rightmost set bit of a number](https://github.com/YuvrajxChopra/CodeQuotient-Programming_Abstraction/blob/main/CodeQuotient%20- %20Programming%20Abstraction/Section-7/rishMostBit.java)

4. Count the set bits of a number

Section 8

1. Rotate a 2-D array by 90 degrees

2. Collect coins in snake game

3. Escape The Bombs

4. Bit Difference

5. Toggle the number except kth bit

6. Counter Diagonal Traversal

Section 9

1. Check if strings are rotations or not

2. Compress a string

3. Expand a string

4. Vowel Substrings

5. Keyword Count

6. Reverse the words of a string

Section 9

1. Reverse a linked list

2. Find the middle node of the list

3. Find the merge point of two lists

4. Rotate a linked List

5. Check List for Palindrome

6. Add Two Numbers Represented by Lists

7. Find the loop in Linked list

8. Move the Smallest and largest to head and tail of list

9. Swap Two Nodes of Doubly Linked List

10. Rearrange the Even-Odd Nodes of Doubly Linked List

11. Remove Duplicates from a sorted doubly linked list\

Section 11

1. Belong to same spieces

2. Decode Message

3. Find Max Sum

4. Get Minimum Jumps

5. Is Compatible

6. Is Palindrome

7. Minimum Distance

8. Multiply Matrix

9. Find Odd pair

10. Rotate Image

11. Swap even bits

12. Toggle Bits

Section 12

1. Collect Data

2. Complier output

3. Evalute Post Fix

4. Higlighted Brackets