• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

strtok()

March 21, 2014 by Dhaval Dave

Function Strtok

char * strtok ( char * str, const char * delimiters );
What it does : Split string into tokens
A sequence of calls to this function split str into tokens,
which are sequences of contiguous characters separated by any of
the characters that are part of delimiters

Example

/* strtok example */


int main ()
{
  char str[] ="This-is Go,Hired Site.";
  char * pch;
  printf ("Splitting string "%s" into tokens:n",str);
  printf ("--------");
  pch = strtok (str," ,.-"); // ',' '.' and '-' will be removed
  while (pch != NULL)
  {
    printf ("%sn",pch);
    pch = strtok (NULL, " ,.-");
  }
  return 0;
}
Output:
Splitting string “This-is Go,Hired Site.” into tokens:
——–
This is Go Hired Site

Similar Articles

Filed Under: problem Tagged With: Array, string

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

CodeChef’ RRCOPY

Find if a binary tree is height balanced ?

1014 Practice Question of New GRE – Princeton

DFS (Depth First Search)

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

Max Sum in circularly situated Values

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

LeetCode: Container With Most Water

Urban Ladder Written Test.

Subset Sum Problem Dynamic programming

SAP Interview Questions

Naurki.com Security Breach

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Given a string, find the first character which is non-repetitive

Sort an array according to the order defined by another array

Find Percentage of Words matching in Two Strings

Right view of Binary tree

Amazon Interview On-Campus For Internship – 1

BlueStone E-commerce Interview Experience

ADOBE Aptitude C Language Test

Find two non repeating elements in an array of repeating elements

Difference between a LinkedList and a Binary Search Tree BST

Get Minimum element in O(1) from input numbers or Stack

K’th Largest Element in BST when modification to BST is not allowed

Knight Tour Problem (Graph – Breadth First Search)

Fibonacci Hashing & Fastest Hashtable

Python String and numbers

Search element in a matrix with all rows and columns in sorted order

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

VMWare SDEII Interview

Copyright © 2026 · Genesis Framework · WordPress · Log in