Kanav-Arora

table stock{

 item_id varchar(10)

 item_name varchar(25)

 gst_slab int

 quantity mediumtexttext

Kanav-Arora

/*
  Space complexity - O(1)   in-place
  Time Complexity - O(N)
*/

class Solution {  
  public:
    void rotate(vector<int>& nums, int k) {
        k = k - (k/nums.size())*nums.size();
        reverse(nums, 0,nums.size()-k-1);

Kanav-Arora

/*
  Initial list: 1->2->3->4->5->6->null
  Append 3 nodes
  4->5->6->1->2->3->null
*/

void appendKNodes(Node* &head, int k)
{
    Node* temp = head;
    for(int i=0; i<length(head)-k-1; i++)

Kanav-Arora

#include <bits/stdc++.h>
using namespace std;

void solve()
{
    
}

int main()
{

Kanav-Arora

Kanav-Arora

Kanav-Arora