Scribd Logo
Upload

Welcome to Scribd!

  • 4 views

    21BCS8358 - Smiksha (IT Day3)

    Uploaded by

    yegan13026
    The document discusses four programming algorithms - multi-level inheritance, reversing integers, permutations, and finding the minimum in a rotated sorted array. Code implementations are provided for each algorithm.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    21BCS8358 - Smiksha (IT Day3)

    Uploaded by

    yegan13026
    4 views6 pages
    The document discusses four programming algorithms - multi-level inheritance, reversing integers, permutations, and finding the minimum in a rotated sorted array. Code implementations are provided for each algorithm.

    Original Description:

    iuygegjmkokya

    Original Title

    21BCS8358_Smiksha(IT Day3)

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses four programming algorithms - multi-level inheritance, reversing integers, permutations, and finding the minimum in a rotated sorted array. Code implementations are provided for each algorithm.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    4 views6 pages

    21BCS8358 - Smiksha (IT Day3)

    Uploaded by

    yegan13026
    The document discusses four programming algorithms - multi-level inheritance, reversing integers, permutations, and finding the minimum in a rotated sorted array. Code implementations are provided for each algorithm.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 6

    DEPARTMENT OF

    Worksheet Day 4

    Student Name: Naman UID: 21BCS8137


    Branch: CSE Section/Group: 21BCS_CC-652-B
    Subject Name: IT Skills Date of Performance: 31/05/24

    Aim:
    To demonstrate the concept of programming algorithms.

    Objective:

    1) Multi Level Inheritance - we explore multi-level inheritance. (Level – Medium)

    2) Reverse Integer- Given a signed 32-bit integer x, return x with its digits reversed. If reversing x
    causes the value to go outside the signed 32-bit integer range [-231, 231 - 1], then return 0. (Level –
    Medium)

    3) Permutations - Given an array nums of distinct integers, return all the possible permutations. You can
    return the answer in any order.. (Level – Medium)

    4) Find Minimum in Rotated Sorted Array II . - Suppose an array of length n sorted in ascending order is
    rotated between 1 and n times. For example, the array nums = [0,1,4,4,5,6,7] might become:. (Level –
    Hard)

    Code:
    1) class Solution {
    public:

    ListNode* partition(ListNode* head, int x) {

    ListNode *left = new ListNode(0);

    ListNode *right = new ListNode(0)

    ListNode *leftTail = left;

    Naman 21BCS8137
    DEPARTMENT OF
    COMPUTER SCIENCE & ENGINEERING

    ListNode *rightTail = right;

    while(head != NULL){

    if(head->val < x){

    leftTail->next = head;

    leftTail = leftTail->next;

    else{

    rightTail->next = head;

    rightTail = rightTail->next;

    head = head->next;

    leftTail->next = right->next;

    rightTail->next = NULL;

    return left->next;

    };

    2)
    class Solution {
    public:
    int reverse(int x) {

    long r=0;
    while(x){

    r=r*10+x%10;
    Naman 21BCS8137
    DEPARTMENT OF
    COMPUTER SCIENCE & ENGINEERING
    x=x/10;
    }

    if(r>INT_MAX || r<INT_MIN) return 0;


    return int(r);
    }
    };

    3) class Solution {
    public:
    vector<vector<int>> result;

    // Backtracking
    void permutation(vector<int> &nums,int i,int n){
    if(i==n){
    result.push_back(nums);
    return ;
    }

    for(int j=i;j<=n;j++){
    swap( nums[i],nums[j]);
    permutation(nums,i+1,n);
    swap( nums[i],nums[j]);
    }
    }

    vector<vector<int>> permute(vector<int>& nums) {

    permutation(nums,0,nums.size()-1);

    return result;
    }
    };

    4) class Solution {
    public:
    int findMin(vector<int>& nums) {
    int l = 0, r = nums.size() - 1;
    while (l < r && nums[l] > nums[r]) {
    int m = l + (r - l) / 2;
    if (nums[m] > nums[m + 1]) {
    return nums[m + 1];
    }

    Naman 21BCS8137
    DEPARTMENT OF
    COMPUTER SCIENCE & ENGINEERING
    if (nums[m] > nums[r]) {
    l = m + 1;
    } else {
    r = m;
    }
    }
    return findMin(nums, l, r);
    }

    private:
    int findMin(vector<int>& nums, int l, int r) {
    int mini = nums[l++];
    while (l <= r) {
    mini = min(mini, nums[l++]);
    }
    return mini;
    }

    Output:

    1)

    Naman 21BCS8137
    DEPARTMENT OF
    COMPUTER SCIENCE & ENGINEERING

    2)

    3)

    Naman 21BCS8137
    DEPARTMENT OF
    COMPUTER SCIENCE & ENGINEERING

    4)

    Naman 21BCS8137

    You might also like