• 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

C Program for TAIL command of UNIX

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Python Dictionaries

Max Sum in circularly situated Values

Trapping Rain Water

Given Set of words or A String find whether chain is possible from these words or not

Sequence Finder Dynamic Programming

Convert number to words java

FizzBuzz Solution C C++

SAP Off Campus Hiring_ March 2015 Verbal Skills

Maximum of all subarrays of size k

LeetCode: Binary Tree Maximum Path Sum

Find Nearest Minimum number in left side in O(n)

Urban Ladder Written Test.

Print vertical sum of all the axis in the given binary tree

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

Flipkart SDET Interview Experience

Fibonacci Hashing & Fastest Hashtable

Implement a generic binary search algorithm for Integer Double String etc

Leetcode: Edit Distance

Find min element in Sorted Rotated Array (Without Duplicates)

Connect n ropes with minimum cost

ADOBE Aptitude C Language Test

Binary Tree in Java

Hackerearth : Counting Subarrays

Possible sizes of bus to carry n groups of friends

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Regular Expression Matching

Copyright © 2026 · Genesis Framework · WordPress · Log in